Dial a Ride from k-Forest
From MaRDI portal
Publication:3527216
DOI10.1007/978-3-540-75520-3_23zbMath1151.68745MaRDI QIDQ3527216
R. Ravi, Viswanath Nagarajan, Anupam Gupta, Mohammad Taghi Hajiaghayi
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_23
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C59: Approximation methods and heuristics in mathematical programming
68W25: Approximation algorithms
Related Items
An approximation algorithm for the generalized \(k\)-multicut problem, Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing, Online and offline algorithms for the sorting buffers problem on the line metric, Euclidean prize-collecting Steiner forest