Polynomial time approximation schemes for dense instances of NP-hard problems

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225140 ◽

1995 ◽

Author(s):

Sanjeev Arora ◽

David Karger ◽

Marek Karpinski

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Np Hard ◽

Time Approximation ◽

Hard Problems ◽

Np Hard Problems ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences ◽

10.1006/jcss.1998.1605 ◽

1999 ◽

Vol 58 (1) ◽

pp. 193-210 ◽

Author(s):

Sanjeev Arora ◽

David Karger ◽

Marek Karpinski

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Np Hard ◽

Time Approximation ◽

Hard Problems ◽

Np Hard Problems ◽

Polynomial Time Approximation

Download Full-text

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

Algorithmica ◽

10.1007/s00453-001-0012-z ◽

2001 ◽

Vol 30 (3) ◽

pp. 386-397 ◽

Author(s):

M. Karpinski

Keyword(s):

Polynomial Time ◽

Optimization Problems ◽

Approximation Schemes ◽

Np Hard ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial time approximation schemes for some dense instances of NP-hard optimization problems

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_1 ◽

1997 ◽

pp. 1-14 ◽

Author(s):

Marek Karpinski

Keyword(s):

Polynomial Time ◽

Optimization Problems ◽

Approximation Schemes ◽

Np Hard ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

In some curved spaces, one can solve NP-hard problems in polynomial time

Journal of Mathematical Sciences ◽

10.1007/s10958-009-9402-6 ◽

2009 ◽

Vol 158 (5) ◽

pp. 727-740 ◽

Author(s):

V. Kreinovich ◽

M. Margenstern

Keyword(s):

Polynomial Time ◽

Np Hard ◽

Curved Spaces ◽

Hard Problems ◽

Np Hard Problems

Download Full-text

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM ◽

10.1145/290179.290180 ◽

1998 ◽

Vol 45 (5) ◽

pp. 753-782 ◽

Author(s):

Sanjeev Arora

Keyword(s):

Polynomial Time ◽

Traveling Salesman ◽

Approximation Schemes ◽

Time Approximation ◽

Geometric Problems ◽

Polynomial Time Approximation

Download Full-text

Asymptotic Polynomial-Time Approximation Schemes

Handbook of Approximation Algorithms and Metaheuristics - Chapman & Hall/CRC Computer & Information Science Series ◽

10.1201/9781420010749.ch11 ◽

2007 ◽

pp. 11-1-11-15

Author(s):

An Zhu ◽

Rajeev Motwani ◽

Liadan O’Callaghan

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Asymptotic Polynomial-Time Approximation Schemes

Handbook of Approximation Algorithms and Metaheuristics ◽

10.1201/9781420010749-17 ◽

2007 ◽

pp. 181-196

Keyword(s):

Polynomial Time ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial-Time Approximation Schemes for Circle Packing Problems

Algorithms - ESA 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44777-2_59 ◽

2014 ◽

pp. 713-724 ◽

Author(s):

Flávio K. Miyazawa ◽

Lehilton L. C. Pedrosa ◽

Rafael C. S. Schouery ◽

Maxim Sviridenko ◽

Yoshiko Wakabayashi

Keyword(s):

Polynomial Time ◽

Circle Packing ◽

Approximation Schemes ◽

Packing Problems ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Polynomial Time Approximation Schemes and Parameterized Complexity

Lecture Notes in Computer Science - Mathematical Foundations of Computer Science 2004 ◽

10.1007/978-3-540-28629-5_38 ◽

2004 ◽

pp. 500-512 ◽

Author(s):

Jianer Chen ◽

Xiuzhen Huang ◽

Iyad A. Kanj ◽

Ge Xia

Keyword(s):

Polynomial Time ◽

Parameterized Complexity ◽

Approximation Schemes ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74510-5_20 ◽

2007 ◽

pp. 182-193 ◽

Author(s):

Peter Jonsson ◽

Andrei Krokhin ◽

Fredrik Kuivinen

Keyword(s):

Polynomial Time ◽

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Approximation Schemes ◽

Hard Constraint ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text