On the bidirected cut relaxation for the metric Steiner tree problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 742-751

  Rajagopalan, Sridhar ^a   Vazirani, Vijay V ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIDIRECTED CUT RELAXATION; INTEGRALITY GAP; METRIC STEINER TREE; STEINER VERTICES;

APPROXIMATION THEORY; RELAXATION PROCESSES; TREES (MATHEMATICS);

ALGORITHMS;

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

References (11)