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
On Minimum Edge Ranking Spanning Trees
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th 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
An approximation algorithm for finding long paths in Hamiltonian graphs
Journal of Algorithms - Special issue: SODA 2000
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Bootstrapping Free-Space Optical Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Characterizing achievable multicast rates in multi-hop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
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
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum-lifetime routing: system optimization & game-theoretic perspectives
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Journal of Parallel and Distributed 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
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
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Network Design with Weighted Degree Constraints
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
Energy-efficient multiple routing trees for aggregate query evaluation in sensor networks
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
Constructing maximum-lifetime data gathering forests in sensor networks
IEEE/ACM Transactions on Networking (TON)
The minimum degree spanning tree problem on directed acyclic graphs
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Network-design with degree constraints
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parallel query processing and edge ranking of graphs
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
On degree constrained shortest paths
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
A push-relabel algorithm for approximating degree bounded MSTs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Improved algorithm for degree bounded survivable network design problem
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On the approximability of some degree-constrained subgraph problems
Discrete Applied Mathematics
Network design with weighted degree constraints
Discrete Optimization
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Efficient Parallel Query Processing by Graph Ranking
Fundamenta Informaticae
On some network design problems with degree constraints
Journal of Computer and System Sciences
Chain-Constrained spanning trees
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |