Strongly polynomial-time approximation for a class of bicriteria problems

Authors:
Asaf Levin
Affiliations:
Faculty of Industrial Engineering and Management, Technion, Haifa 32000, Israel
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 3

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Bicriteria network design problems

Journal of Algorithms
Parametric Combinatorial Computing and a Problem of Program Module Distribution

Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)

Real time scheduling with a budget: parametric-search is better than binary search

Information Processing Letters
Partial multicuts in trees

Theoretical Computer Science
Approximation algorithm for minimizing total latency in machine scheduling with deliveries

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.