Robust matchings and maximum clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 251-258

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETE GRAPHS; DISJOINT EDGES; EDGE WEIGHTS; GRAPH PARTITIONING PROBLEMS; MATCHINGS; NON NEGATIVES;

GRAPH THEORY;

EID: 84956856246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (5)

1. T. Feo, O. Goldschmidt and M. Khellaf, “One half approximation algorithms for the k-partition problem", Operations Research 40, 1992, S170-S172.
2. T. Feo and M. Khellaf, “A class of bounded approximation algorithms for graph partitioning", Networks 20, 1990, 181-195.
3. R. Hassin, S. Rubinstein and A. Tamir, “Approximation algorithms for max-imum dispersion", Operations Research Letters, 21 (1997), 133-137.
4. B. Korte and D. Hausmann, “An analysis of the greedy heuristic for indepen-dence systems," Annals of Discrete Mathematics 2, 1978, 65-74.
5. G. Woeginger, private communication.