A unified approach to approximation algorithms for bottleneck problems
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
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Approximation Through Local Optimality: Designing Networks with Small Degree
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dimensioning server access bandwidth and multicast routing in overlay networks
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Optimizing Cost Flows by Modifying Arc Costs and Capacities
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Bicriteria Spanning Tree Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Heuristic algorithms for real-time data aggregation in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Spanning trees with minimum weighted degrees
Information Processing Letters
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Network Design with Weighted Degree Constraints
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Data aggregation in sensor networks: balancing communication and delay costs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Multi-objective problems in terms of relational algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Utilitarian mechanism design for multi-objective optimization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Approximating some network design problems with node costs
Theoretical Computer Science
Bicriteria network design via iterative rounding
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Recent advances in multiobjective optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Network design with weighted degree constraints
Discrete Optimization
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |