Approximating multiroot 3-outconnected subgraphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A 5/4-approximation algorithm for minimum 2-edge-connectivity
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Approximation algorithm for k-node connected subgraphs via critical graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Approximating the smallest k-edge connected spanning subgraph by LP-rounding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Range assignment for biconnectivity and k-edge connectivity in wireless ad hoc networks
Mobile Networks and Applications
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Max-Life Power Schedule for connectivity and biconnectivity in wireless ad hoc networks
Mobile Networks and Applications
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
Relay Nodes in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
On k-edge-connectivity problems with sharpened triangle inequality
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Relay placement for fault tolerance in wireless networks in higher dimensions
Computational Geometry: Theory and Applications
Power optimization for connectivity problems
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Range augmentation problems in static ad-hoc wireless networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Approximating subset k-connectivity problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Degree-Constrained node-connectivity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Faster approximation algorithms for weighted triconnectivity augmentation problems
Operations Research Letters
Relay placement for two-connectivity
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Approximating subset k-connectivity problems
Journal of Discrete Algorithms
An overview of algorithms for network survivability
ISRN Communications and Networking
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Computers and Operations Research
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |