Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The point-to-point delivery and connection problems: complexity and algorithms
Discrete Applied Mathematics
Improved approximations for the Steiner tree problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Heuristics for weighted perfect matching
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for minimum-cost vertex-connectivity problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A scaling technique for better network design
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A user-aware tour proposal framework using a hybrid optimization approach
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Scalable Architecture for Cooperative Web Caching
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Approximation Algorithms for a Network Design Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Approximating the Maximum Internal Spanning Tree problem
Theoretical Computer Science
On achieving group strategyproof information dissemination in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
ACM Transactions on Algorithms (TALG)
Coverage and connected coverage problems for sensors embedded in a temperature-sensitive environment
International Journal of Sensor Networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A game theoretic analysis of network design with socially-aware users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
A note on the subadditive network design problem
Operations Research Letters
A greedy heuristic for a minimum-weight forest problem
Operations Research Letters
Approximating minimum-cost graph problems with spanning tree edges
Operations Research Letters
The parsimonious property of cut covering problems and its applications
Operations Research Letters
Brief announcement: live streaming with utilities, quality and cost
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
On the approximability of Dense Steiner Problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles or paths satisfying certain requirements. In particular, many basic combinatorial optimization problems fit in this framework, including the shortest path, minimum spanning tree, minimum-weight perfect matching, traveling salesman and Steiner tree problems.Our technique produces approximation algorithms that run in O(n2 log n) time and come within a factor of 2 of optimal for most of these problems. For instance, we obtain a 2-approximation algorithm for the minimum-weight perfect matching problem under the triangle inequality. Our running time of O(n2 log n) time compares favorably with the best strongly polynomial exact algorithms running in O(n3) time for dense graphs. A similar result is obtained for the 2-matching problem and its variants.We also derive the first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems. Moreover, for the prize-collecting traveling salesman or Steiner tree problems, we obtain 2-approximation algorithms, therefore improving the previously best-known performance guarantees of 2.5 and 3, respectively [4].