Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
ACM SIGecom Exchanges（2010）
摘要
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
更多查看译文
关键词
combinatorial optimization problem,utility function,shortest path,complex system,individual cost,combinatorial problems,lower bound,multiple agent,spanning tree,multi-agent submodular cost function,combinatorial problem,vertex cover,multi-agent submodular cost functions,perfect matching,submodular cost function,algorithmic framework,recent interest,cost function,internet,polynomials,algorithm design and analysis,approximation algorithms,upper and lower bounds,multi agent systems
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要