Dial a Ride from k-Forest

DOI10.1007/978-3-540-75520-3_23zbMath1151.68745OpenAlexW1500932665MaRDI QIDQ3527216

Viswanath Nagarajan, Anupam Gupta, R. Ravi, 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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (6)

Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ An approximation algorithm for the generalized \(k\)-multicut problem ⋮ Euclidean prize-collecting Steiner forest ⋮ A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Online and offline algorithms for the sorting buffers problem on the line metric

This page was built for publication: Dial a Ride from k-Forest