Directed Steiner network problem is tractable for a constant number of terminals

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 299-308

  Feldman, Jon ^a   Ruhl, Matthias ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

DIRECTED STEINER NETWORK PROBLEM; POINT TO POINT CONNECTION PROBLEM; POLYNOMIAL TIME ALGORITHM;

COMPUTATIONAL COMPLEXITY;

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

References (10)