Research map / Learning theory and algorithms / Submodular and game algorithms
The Linear Distance Traveling Tournament Problem Allows an EPTAS
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use a schedule construction based on an optimal k-path packing, with randomly assigned path-teams and super-teams | LDTTP-k · LDTTP-k, 3 ≤ k = o(∛n) | approximation ratio: 1 + ε | Helped |
Closest papers by meaning
- A Matching-Based Algorithm for the Traveling Tournament Problem (AAAI 2025 · similarity 0.95)
- A TSP-Based Algorithm for Multi-League Traveling Tournament (AAAI 2026 · similarity 0.92)
- An Exercise in Tournament Design: When Some Matches Must Be Scheduled (AAAI 2024 · similarity 0.85)
- Adaptive Manipulation for Coalitions in Knockout Tournaments (AAAI 2025 · similarity 0.83)
- Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team Games (NeurIPS 2024 · similarity 0.81)
- Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (AAAI 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.