A uniform framework for approximating weighted connectivity problems

Authors:
Samir Khuller;Balaji Raghavachari;An Zhu
Affiliations:
Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Department of Computer Science, The University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Maryland, College Park, MD
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
A Memetic Algorithm for Vertex-Biconnectivity Augmentation

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Non-tree routing for reliability and yield improvement

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Journal of Heuristics
Approximating Transitive Reductions for Directed Networks

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Hi-index	0.00