External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems

Marek Karpinski. Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. In José D. P. Rolim, editor, Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM 97, Bolognna, Italy, July 11-12. 1997, Proceedings. Volume 1269 of Lecture Notes in Computer Science, pages 1-14, Springer, 1997.

Abstract

Abstract is missing.

runs on