Divide-and-conquer approximation algorithms via spreading metrics

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1995, Pages 62-71

  Even, Guy ^a   Naor, Joseph ^a   Rao, Satish ^a   Schieber, Baruch ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

DIVIDE AND CONQUER APPROXIMATION ALGORITHMS; FEEDBACK SETS; GRAPH EMBEDDING; INTERVAL GRAPH COMPLETION; LINEAR ARRANGEMENT; LOWER BOUNDS; POLYNOMIAL TIME; SPREADING METRICS; STORAGE TIME PRODUCT MINIMIZATION;

ALGORITHMS;

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

References (17)