๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Average polynomial time complexity of some NP-complete problems

โœ Scribed by Phan Dinh Dieu; Le Cong Thanh; Le Tuan Hoa

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
900 KB
Volume
46
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial Time Approximation Schemes fo
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
โœ Sanjeev Arora; David Karger; Marek Karpinski ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

We present a unified framework for designing polynomial time approximation schemes (PTASs) for ``dense'' instances of many NP-hard optimization problems, including maximum cut, graph bisection, graph separation, minimum k-way cut with and without specified terminals, and maximum 3-satisfiability. By