Algorithmic extremal problems in combinatorial optimization
- 30 September 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (3) , 225-244
- https://doi.org/10.1016/0196-6774(82)90022-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Complexity of Partial SatisfactionJournal of the ACM, 1981
- The fastest exact algorithms for the isolation of the real roots of a polynomial equationComputing, 1980
- P-optimal heuristicsTheoretical Computer Science, 1980
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Computer Algebra of Polynomials and Rational FunctionsThe American Mathematical Monthly, 1973
- Integer Arithmetic Algorithms for Polynomial Real Zero DeterminationJournal of the ACM, 1971
- On coloring graphs to maximize the proportion of multicolored k-edgesJournal of Combinatorial Theory, 1968