Strongly polynomial-time approximation for a class of bicriteria problems

Operations Research Letters

Volumn 32, Issue 6, 2004, Pages 530-534

  Levin, Asaf ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Bicriteria optimization; Parametric method

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; INTEGER PROGRAMMING; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; BICRITERIA OPTIMIZATION; LINEAR FUNCTIONS; PARAMETRIC METHOD;

OPERATIONS RESEARCH;

EID: 3042735319     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.02.002     Document Type: Article

References (5)

1. Cole R. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM. 34:1987;200-208.
2. Gusfield D. Parametric combinatorial computing and a problem of program module distribution. J. ACM. 30:1983;551-563.
3. Marathe M.V., Ravi R., Sundaram R., Ravi S.S., Rosenkrantz D.J., Hunt III H.B. Bicriteria network design problems. J. Algorithms. 28:1998;142-171.
4. Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4:1979;414-424.
5. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. 30:1983;852-865.