On Approximate Solutions for Combinatorial Optimization Problems
- 1 May 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 3 (2) , 294-310
- https://doi.org/10.1137/0403025
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- On the complexity of approximating the independent set problemPublished by Springer Nature ,1989
- Occam's RazorInformation Processing Letters, 1987
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- Lower bounds on information transfer in distributed computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- On the structure of combinatorial problems and structure preserving reductionsPublished by Springer Nature ,1977
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976