The steiner problem with edge lengths 1 and 2,
Information Processing Letters
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Hardness results for multicast cost sharing
Theoretical Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
Limitations of cross-monotonic cost sharing schemes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A group-strategyproof mechanism for Steiner forests
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Proceedings of the 8th ACM conference on Electronic commerce
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
When ignorance helps: Graphical multicast cost sharing games
Theoretical Computer Science
Cost sharing methods for makespan and completion time scheduling
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
The power of two prices: beyond cross-monotonicity
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On budget-balanced group-strategyproof cost-sharing mechanisms
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Cost-recovering bayesian algorithmic mechanism design
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.00 |
In an instance of the prize-collecting Steiner forest problem (PCSF) we are given an undirected graph G = (V, E), non-negative edge-costs c(e) for all e ε E, terminal pairs R = {(si, ti)}1≤i≤k, and penalties π1,...,πk. A feasible solution (F, Q) consists of a forest F and a subset Q of terminal pairs such that for all (si, ti) ε R either si, ti are connected by F or (si, ti) ε Q. The objective is to compute a feasible solution of minimum cost c(F) + π (Q). A game-theoretic version of the above problem has k players, one for each terminal-pair in R. Player i's ultimate goal is to connect si and ti, and the player derives a privately held utility ui ≥ 0 from being connected. A service provider can connect the terminals si and ti of player i in two ways: (1) by buying the edges of an si, ti-path in G, or (2) by buying an alternate connection between si and ti (maybe from some other provider) at a cost of πi. In this paper, we present a simple 3-budget-balanced and group-strategyproof mechanism for the above problem. We also show that our mechanism computes client sets whose social cost is at most O(log2 k) times the minimum social cost of any player set. This matches a lower-bound that was recently given by Roughgarden and Sundararajan (STOC '06).