The Checkpoint Problem
From MaRDI portal
Publication:3588409
DOI10.1007/978-3-642-15369-3_17zbMath1306.90128OpenAlexW2139785710MaRDI QIDQ3588409
Julián Mestre, Rohit Khandekar, Mohammad Taghi Hajiaghayi, Guy Kortsarz
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_17
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
On the path avoiding forbidden pairs polytope ⋮ Complexity of the path avoiding forbidden pairs problem revisited
This page was built for publication: The Checkpoint Problem
