A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM SIGACT News
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buy-at-bulk network design: approximating the single-sink edge installation problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
Directed network design with orientation constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A faster implementation of the Goemans-Williamson clustering algorithm
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Synthesis of low power folded programmable coefficient FIR digital filters (short paper)
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Approximation algorithms for constrained for constrained node weighted steiner tree problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Capacitated vertex covering with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pricing multicasting in more practical network models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Seamster: inconspicuous low-distortion texture seam layout
Proceedings of the conference on Visualization '02
Approximating minimum size {1,2}-connected networks
Discrete Applied Mathematics
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
Approximation Algorithms for a Directed Network Design Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Edge Covers of Setpairs and the Iterative Rounding Method
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An approximation algorithm for the fault tolerant metric facility location problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
The Forest Wrapping Problem on Outerplanar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Profit guaranteeing mechanisms for multicast networks
Proceedings of the 4th ACM conference on Electronic commerce
Budget balanced mechanisms for the multicast pricing problem with rates
Proceedings of the 4th ACM conference on Electronic commerce
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of 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
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A parallel implementation of an asynchronous team to the point-to-point connection problem
Parallel Computing - Special issue: Parallel computing in numerical optimization
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
Proceedings of the 9th annual international conference on Mobile computing and networking
On the complexity of graph tree partition problems
Discrete Applied Mathematics
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Primal-dual algorithms for deterministic inventory problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for partial covering problems
Journal of Algorithms
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
A new algorithm for layout of dark field alternating phase shifting masks
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
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
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
ACM Transactions on Algorithms (TALG)
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
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 8th ACM conference on Electronic commerce
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
Information Processing Letters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for prize collecting forest problems with submodular penalty functions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online make-to-order joint replenishment model: primal dual competitive algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
The online Prize-Collecting Traveling Salesman Problem
Information Processing Letters
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Online unit clustering: Variations on a theme
Theoretical Computer Science
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
Approximation algorithms for group prize-collecting and location-routing problems
Discrete Applied Mathematics
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A circulatory system approach for wireless sensor networks
Ad Hoc Networks
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms (TALG)
Approximation and Online Algorithms
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Obtaining optimal k-cardinality trees fast
Journal of Experimental Algorithmics (JEA)
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Approximating the minimum quadratic assignment problems
ACM Transactions on Algorithms (TALG)
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An approximation algorithm for a 2-depot, heterogeneous vehicle routing problem
ACC'09 Proceedings of the 2009 conference on American Control Conference
The Steiner Forest Problem revisited
Journal of Discrete Algorithms
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithmic aspects of bandwidth trading
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An approximation algorithm to the k-Steiner forest problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A constant bound on throughput improvement of multicast network coding in undirected networks
IEEE Transactions on Information Theory
Minimum-weight cycle covers and their approximability
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Steiner forests on stochastic metric graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Improved approximation algorithm for connected facility location problems
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Primal-dual schema for capacitated covering problems
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Hybrid metaheuristic for the prize collecting travelling salesman problem
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Journal of Computer and System Sciences
Stackelberg strategies for network design games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Strategic cooperation in cost sharing games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
Clustering with internal connectedness
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Insightful slideshow: automatic composition of personal photograph slideshow using the web
Intelligent Decision Technologies - Special issue on design of intelligent environment
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
An O(log n)-competitive algorithm for online constrained forest problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Primal-dual schema and lagrangian relaxation for the k-location-routing problem
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A 3/2 approximation for a constrained forest problem
ESA'11 Proceedings of the 19th European conference on Algorithms
A primal-dual approximation algorithm for the vertex cover P3 problem
Theoretical Computer Science
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Approximation algorithms for 2-stage stochastic optimization problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
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
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Stochastic steiner trees without a root
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Bicriteria network design via iterative rounding
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Perturbative time and frequency allocations for RFID reader networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Approximation schemes for node-weighted geometric steiner tree problems
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the vehicle routing problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Theoretical Computer Science
An approximation algorithm for the Generalized k-Multicut problem
Discrete Applied Mathematics
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Improving christofides' algorithm for the s-t path TSP
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
Operations Research Letters
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
A better approximation algorithm for the budget prize collecting tree problem
Operations Research Letters
Node-weighted network design in planar and minor-closed families of graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the black and white traveling salesman problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A constraint programming approach for the traveling purchaser problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Approximation Algorithms for Capacitated Location Routing
Transportation Science
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
Journal of Combinatorial Optimization
The power of deferral: maintaining a constant-competitive steiner tree online
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved approximation algorithms for (budgeted) node-weighted steiner problems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
Collecting data in ad-hoc networks with reduced uncertainty
Ad Hoc Networks
Hi-index | 0.07 |
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-cost spanning tree, minimum-weight perfect matching, traveling salesman and Steiner tree problems. Our technique produces approximation algorithms that run in $O(n^2\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(n^2\log n)$ time compares favorably with the best strongly polynomial exact algorithms running in $O(n^3)$ 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 [Math. Programming, 59 (1993), pp. 413--420].