Combinatorial approximation algorithms for generalized flow problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 704-714

  Oldham, Jeffrey D ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COSTS; CRITICAL PATH ANALYSIS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

BELLMAN-FORD ALGORITHMS; COMBINATORIAL APPROXIMATION ALGORITHMS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;

ALGORITHMS;

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

References (33)