Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing
A constant-factor approximation algorithm for the k-MST problem
Journal of Computer and System Sciences
Approximation algorithms
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
SIAM Journal on Computing
Approximation Through Local Optimality: Designing Networks with Small Degree
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
SIAM Journal on Computing
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs
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
Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the fifth international workshop on Foundations of mobile computing
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Network Design with Weighted Degree Constraints
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Degree bounded matroids and submodular flows
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Journal of Combinatorial Optimization
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
A generalized algorithm for publish/subscribe overlay design and its fast implementation
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |