Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/B99805zbMath1105.68304OpenAlexW4301133941MaRDI QIDQ5313017

Aravind Srinivasan, Anupam Gupta, Éva Tardos

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80) Approximation algorithms (68W25)

Related Items (9)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) ⋮ Connected facility location via random facility sampling and core detouring ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ A simpler and better derandomization of an approximation algorithm for single source rent-or-buy ⋮ Cross-monotonic cost sharing methods for connected facility location games ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques