Approximating minimum-size k-connected spanning subgraphs via matching

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 292-301

  Cheriyan, Joseph ^a   Thurimella, Ramakrishna ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING;

DEGREE CONSTRAINED SUBGRAPH PROBLEM; MINIMUM SIZE K CONNECTED SPANNING SUBGRAPH;

GRAPH THEORY;

EID: 0030406664     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)