✦ LIBER ✦

Approximation schemes for NP-hard geometric optimization problems: a survey

✍ Scribed by Sanjeev Arora

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 367 KB
Volume: 97
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-003-0438-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NC-Approximation Schemes for NP- and PSP

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

✍ Harry B Hunt III; Madhav V Marathe; Venkatesh Radhakrishnan; S.S Ravi; Daniel J 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 303 KB

We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our approximation schemes exhibit the same time versus performance trade-off as the best known approximation schemes for planar gr

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

A machine learning approach to algorithm

A machine learning approach to algorithm selection for(mathcal{NP})-hard optimization problems: a case study on the MPE problem

✍ Haipeng Guo; William H. Hsu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 571 KB