Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
1999 ◽
Vol 58
(1)
◽
pp. 193-210
◽
Sanjeev Arora
◽
David Karger
◽
Marek Karpinski
Sanjeev Arora
◽
David Karger
◽
Marek Karpinski
2001 ◽
Vol 30
(3)
◽
pp. 386-397
◽
2009 ◽
Vol 158
(5)
◽
pp. 727-740
◽
V. Kreinovich
◽
M. Margenstern
1998 ◽
Vol 45
(5)
◽
pp. 753-782
◽
An Zhu
◽
Rajeev Motwani
◽
Liadan O’Callaghan
Flávio K. Miyazawa
◽
Lehilton L. C. Pedrosa
◽
Rafael C. S. Schouery
◽
Maxim Sviridenko
◽
Yoshiko Wakabayashi
Jianer Chen
◽
Xiuzhen Huang
◽
Iyad A. Kanj
◽
Ge Xia
Peter Jonsson
◽
Andrei Krokhin
◽
Fredrik Kuivinen