On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A uniform framework for approximating weighted connectivity problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
Approximating minimum size {1,2}-connected networks
Discrete Applied Mathematics
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
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
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
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
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On 2-Coverings and 2-Packings of Laminar Families
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
Journal of Heuristics
Special edges, and approximating the smallest directed k-edge connected spanning subgraph
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
FLSS: a fault-tolerant topology control algorithm for wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Localized Fault-Tolerant Topology Control in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Iterated rounding algorithms for the smallest k-edge connected spanning subgraph
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
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
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms (TALG)
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics
Approximating Node-Connectivity Augmentation Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
On minimum power connectivity problems
Journal of Discrete Algorithms
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximating minimum-power degree and connectivity problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Covering a laminar family by leaf to leaf links
Discrete Applied Mathematics
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
An s-t connection problem with adaptability
Discrete Applied Mathematics
Omnify: investigating the visibility and effectiveness of copyright monitors
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the maximum size of a minimal k-edge connected augmentation
Journal of Combinatorial Theory Series B
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Range augmentation problems in static ad-hoc wireless networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Edge-Connectivity augmentation and network matrices
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Approximating minimum power covers of intersecting families and directed connectivity problems
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
Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph
SIAM Journal on Computing
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A 4/3-approximation algorithm for minimum 3-edge-connectivity
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |