Disjoint paths in densely embedded graphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1995, Pages 52-61

  Kleinberg, Jon ^a   Tardos, Eva ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; HEURISTIC PROGRAMMING; INTERCONNECTION NETWORKS; ONLINE SYSTEMS; TELECOMMUNICATION TRAFFIC;

COMMUNICATION PATHS; CONSTANT FACTOR APPROXIMATION ALGORITHM; DENSELY EMBEDDED GRAPHS; HEURISTICS; HIGH SPEED NETWORKS ROUTING; MAXIMUM DISJOINT PATHS PROBLEM; ONLINE ALGORITHMS; ONLINE SETTING;

GRAPH THEORY;

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

References (26)