Subscribe
Atlanta, Georgia
Oct. 25, 2009 to Oct. 27, 2009
ISBN: 978-0-7695-3850-1
pp: 755-764
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.81
ABSTRACT
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility functions. In this paper, we introduce an algorithmic framework for studying combinatorial problems in the presence of multiple agents with submodular cost functions. We study several fundamental covering problems (Vertex Cover, Shortest Path, Perfect Matching, and Spanning Tree) in this setting and establish tight upper and lower bounds for the approximability of these problems
CITATION
Gagan Goel,
Chinmay Karande,
Pushkar Tripathi,
Lei Wang,
"Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions", FOCS, 2009, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science,
2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2009, pp. 755-764, doi:10.1109/FOCS.2009.81