ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces
Lectures on Proof Verification and Approximation Algorithms - Lecture Notes in Computer Science
◽
10.1007/bfb0053023
◽
1998
◽
pp. 313-323
Author(s):
Richard Mayr
◽
Annette Schelten
Keyword(s):
Polynomial Time
◽
Metric Spaces
◽
Optimization Problems
◽
Geometric Optimization
◽
Approximation Schemes
◽
Time Approximation
◽
Euclidean Metric
◽
Polynomial Time Approximation
Download Full-text
Related Documents
Cited By
References
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
Cybernetics and Systems Analysis
◽
10.1007/s10559-011-9319-1
◽
2011
◽
Vol 47
(3)
◽
pp. 368-374
◽
Cited By ~ 1
Author(s):
V. A. Mikhailyuk
Keyword(s):
Polynomial Time
◽
Discrete Optimization
◽
Optimization Problems
◽
Approximation Schemes
◽
Time Approximation
◽
Discrete Optimization 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
◽
Cited By ~ 12
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
◽
Cited By ~ 5
Author(s):
Marek Karpinski
Keyword(s):
Polynomial Time
◽
Optimization Problems
◽
Approximation Schemes
◽
Np Hard
◽
Time Approximation
◽
Polynomial Time Approximation
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
◽
Cited By ~ 583
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
◽
Cited By ~ 4
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
◽
Cited By ~ 2
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
◽
Cited By ~ 1
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
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
Journal of Scheduling
◽
10.1007/s10951-019-00616-8
◽
2019
◽
Vol 23
(6)
◽
pp. 643-648
◽
Cited By ~ 1
Author(s):
Nir Halman
Keyword(s):
Polynomial Time
◽
Deteriorating Jobs
◽
Technical Note
◽
Approximation Schemes
◽
Time Approximation
◽
Processing Times
◽
Nonlinear Processing
◽
Polynomial Time Approximation
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close