z-Approximations
- 1 November 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (2) , 429-442
- https://doi.org/10.1006/jagm.2001.1187
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Differential approximation algorithms for some combinatorial optimization problemsTheoretical Computer Science, 1998
- On an approximation measure founded on the links between optimization and polynomial approximation theoryTheoretical Computer Science, 1996
- The complexity of approximating a nonlinear programMathematical Programming, 1995
- .879-approximation algorithms for MAX CUT and MAX 2SATPublished by Association for Computing Machinery (ACM) ,1994
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977