default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "polynomial time approximation scheme"
download as .bib file
@article{DBLP:journals/algorithmica/DoerrRW24,
author = {Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt},
title = {Simulated Annealing is a Polynomial-Time Approximation Scheme for
the Minimum Spanning Tree Problem},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {64--89},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01135-x},
doi = {10.1007/S00453-023-01135-X},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GongLMST24,
author = {Mingyang Gong and
Guohui Lin and
Eiji Miyano and
Bing Su and
Weitian Tong},
title = {A polynomial-time approximation scheme for an arbitrary number of
parallel identical multi-stage flow-shops},
journal = {Ann. Oper. Res.},
volume = {335},
number = {1},
pages = {185--204},
year = {2024},
url = {https://doi.org/10.1007/s10479-024-05860-6},
doi = {10.1007/S10479-024-05860-6},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GongLMST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChudnovskyPPT24,
author = {Maria Chudnovsky and
Marcin Pilipczuk and
Michal Pilipczuk and
St{\'{e}}phan Thomass{\'{e}}},
title = {Quasi-Polynomial Time Approximation Schemes for the Maximum Weight
Independent Set Problem in {\textbackslash}({\textbackslash}boldsymbol\{H\}{\textbackslash})-Free
Graphs},
journal = {{SIAM} J. Comput.},
volume = {53},
number = {1},
pages = {47--86},
year = {2024},
url = {https://doi.org/10.1137/20m1333778},
doi = {10.1137/20M1333778},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChudnovskyPPT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-00747,
author = {Hongbo Sun and
Chongkun Xia and
Bo Yuan and
Xueqian Wang and
Bin Liang},
title = {Polynomial-time Approximation Scheme for Equilibriums of Games},
journal = {CoRR},
volume = {abs/2401.00747},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.00747},
doi = {10.48550/ARXIV.2401.00747},
eprinttype = {arXiv},
eprint = {2401.00747},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-00747.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-18352,
author = {Esther Galby and
Andrea Munaro and
Shizhou Yang},
title = {Polynomial-time approximation schemes for induced subgraph problems
on fractionally tree-independence-number-fragile graphs},
journal = {CoRR},
volume = {abs/2402.18352},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.18352},
doi = {10.48550/ARXIV.2402.18352},
eprinttype = {arXiv},
eprint = {2402.18352},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-18352.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/GrangeKMM23,
author = {Aristide Grange and
Imed Kacem and
S{\'{e}}bastien Martin and
Sarah Minich},
title = {Fully polynomial time approximation scheme for the pagination problem
with hierarchical structure of tiles},
journal = {{RAIRO} Oper. Res.},
volume = {57},
number = {1},
pages = {1--16},
year = {2023},
url = {https://doi.org/10.1051/ro/2022022},
doi = {10.1051/RO/2022022},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/GrangeKMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/candar/WangF23,
author = {Chuankai Wang and
Satoshi Fujita},
title = {Polynomial-Time Cloudlet Placement Scheme with an Improved Approximation
Ratio},
booktitle = {Eleventh International Symposium on Computing and Networking, {CANDAR}
2023 - Workshops, Matsue, Japan, November 27-30, 2023},
pages = {179--185},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/CANDARW60564.2023.00037},
doi = {10.1109/CANDARW60564.2023.00037},
timestamp = {Thu, 22 Feb 2024 20:44:52 +0100},
biburl = {https://dblp.org/rec/conf/candar/WangF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdc/Khonji23,
author = {Majid Khonji},
title = {A Fully Polynomial Time Approximation Scheme for Constrained MDPs
Under Local Transitions},
booktitle = {62nd {IEEE} Conference on Decision and Control, {CDC} 2023, Singapore,
December 13-15, 2023},
pages = {1782--1789},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/CDC49753.2023.10383727},
doi = {10.1109/CDC49753.2023.10383727},
timestamp = {Mon, 29 Jan 2024 17:30:32 +0100},
biburl = {https://dblp.org/rec/conf/cdc/Khonji23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GalbyMY23,
author = {Esther Galby and
Andrea Munaro and
Shizhou Yang},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Polynomial-Time Approximation Schemes for Independent Packing Problems
on Fractionally Tree-Independence-Number-Fragile Graphs},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {34:1--34:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.34},
doi = {10.4230/LIPICS.SOCG.2023.34},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GalbyMY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icbbe/BrockaYC23,
author = {Bernard Brocka and
Sharlene Yap and
Jhoirene Clemente},
title = {Parallel Polynomial-Time Approximation Scheme {(PTAS)} for Finding
Compact Structural Motifs},
booktitle = {Proceedings of the 10th International Conference on Biomedical and
Bioinformatics Engineering, {ICBBE} 2023, Kyoto, Japan, November 9-12,
2023},
pages = {73--79},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3637732.3637779},
doi = {10.1145/3637732.3637779},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icbbe/BrockaYC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Bloch-HansenPS23,
author = {Andrew Bloch{-}Hansen and
Daniel R. Page and
Roberto Solis{-}Oba},
editor = {Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed
Acyclic Graphs},
booktitle = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,
Tainan, Taiwan, June 7-10, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13889},
pages = {87--98},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34347-6\_8},
doi = {10.1007/978-3-031-34347-6\_8},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Bloch-HansenPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-07444,
author = {Esther Galby and
Andrea Munaro and
Shizhou Yang},
title = {Polynomial-Time Approximation Schemes for Independent Packing Problems
on Fractionally Tree-Independence-Number-Fragile Graphs},
journal = {CoRR},
volume = {abs/2303.07444},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.07444},
doi = {10.48550/ARXIV.2303.07444},
eprinttype = {arXiv},
eprint = {2303.07444},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-07444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RahgoshayS22,
author = {Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
title = {Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource
Minimization for Fire Containment},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2462--2479},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00972-6},
doi = {10.1007/S00453-022-00972-6},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RahgoshayS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LeeJL22,
author = {Jisun Lee and
Seulgi Joung and
Kyungsik Lee},
title = {A fully polynomial time approximation scheme for the probability maximizing
shortest path problem},
journal = {Eur. J. Oper. Res.},
volume = {300},
number = {1},
pages = {35--45},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.10.018},
doi = {10.1016/J.EJOR.2021.10.018},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LeeJL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SegevS22,
author = {Danny Segev and
Yaron Shaposhnik},
title = {A Polynomial-Time Approximation Scheme for Sequential Batch Testing
of Series Systems},
journal = {Oper. Res.},
volume = {70},
number = {2},
pages = {1153--1165},
year = {2022},
url = {https://doi.org/10.1287/opre.2019.1967},
doi = {10.1287/OPRE.2019.1967},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SegevS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Arunachaleswaran22,
author = {Eshwar Ram Arunachaleswaran and
Siddharth Barman and
Nidhi Rathi},
title = {Fully Polynomial-Time Approximation Schemes for Fair Rent Division},
journal = {Math. Oper. Res.},
volume = {47},
number = {3},
pages = {1970--1998},
year = {2022},
url = {https://doi.org/10.1287/moor.2021.1196},
doi = {10.1287/MOOR.2021.1196},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Arunachaleswaran22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HalmanN22,
author = {Nir Halman and
Giacomo Nannicini},
title = {Fully polynomial time ({\(\Sigma\)} , {\(\Pi\)} )-approximation schemes
for continuous nonlinear newsvendor and continuous stochastic dynamic
programs},
journal = {Math. Program.},
volume = {195},
number = {1},
pages = {183--242},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01685-4},
doi = {10.1007/S10107-021-01685-4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HalmanN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TongXZ22,
author = {Weitian Tong and
Yao Xu and
Huili Zhang},
title = {A polynomial-time approximation scheme for parallel two-stage flowshops
under makespan constraint},
journal = {Theor. Comput. Sci.},
volume = {922},
pages = {438--446},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.044},
doi = {10.1016/J.TCS.2022.04.044},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/TongXZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/DoerrRW22,
author = {Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt},
editor = {Jonathan E. Fieldsend and
Markus Wagner},
title = {Simulated annealing is a polynomial-time approximation scheme for
the minimum spanning tree problem},
booktitle = {{GECCO} '22: Genetic and Evolutionary Computation Conference, Boston,
Massachusetts, USA, July 9 - 13, 2022},
pages = {1381--1389},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3512290.3528812},
doi = {10.1145/3512290.3528812},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gecco/DoerrRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iros/LiWHL22,
author = {Xinrui Li and
Chaoyang Wang and
Hao Hu and
Yanxue Liang},
title = {A polynomial time approximation scheme for the scheduling problem
in the {AGV} system},
booktitle = {{IEEE/RSJ} International Conference on Intelligent Robots and Systems,
{IROS} 2022, Kyoto, Japan, October 23-27, 2022},
pages = {11695--11702},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/IROS47612.2022.9981205},
doi = {10.1109/IROS47612.2022.9981205},
timestamp = {Tue, 03 Jan 2023 14:18:21 +0100},
biburl = {https://dblp.org/rec/conf/iros/LiWHL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/SaitoS22,
author = {Yusuke Saito and
Akiyoshi Shioura},
editor = {Ivana Ljubic and
Francisco Barahona and
Santanu S. Dey and
Ali Ridha Mahjoub},
title = {Polynomial-Time Approximation Schemes for a Class of Integrated Network
Design and Scheduling Problems with Parallel Identical Machines},
booktitle = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
Virtual Event, May 18-20, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13526},
pages = {324--335},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18530-4\_24},
doi = {10.1007/978-3-031-18530-4\_24},
timestamp = {Mon, 06 Nov 2023 13:38:03 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/SaitoS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-02097,
author = {Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt},
title = {Simulated Annealing is a Polynomial-Time Approximation Scheme for
the Minimum Spanning Tree Problem},
journal = {CoRR},
volume = {abs/2204.02097},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.02097},
doi = {10.48550/ARXIV.2204.02097},
eprinttype = {arXiv},
eprint = {2204.02097},
timestamp = {Wed, 06 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-02097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-04780,
author = {Majid Khonji},
title = {A Fully Polynomial Time Approximation Scheme for Fixed-Horizon Constrained
Stochastic Shortest Path Problem under Local Transitions},
journal = {CoRR},
volume = {abs/2204.04780},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.04780},
doi = {10.48550/ARXIV.2204.04780},
eprinttype = {arXiv},
eprint = {2204.04780},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-04780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-14407,
author = {Jianming Dong and
Ruyan Jin and
Guohui Lin and
Bing Su and
Weitian Tong and
Yao Xu},
title = {An efficient polynomial-time approximation scheme for parallel multi-stage
open shops},
journal = {CoRR},
volume = {abs/2205.14407},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.14407},
doi = {10.48550/ARXIV.2205.14407},
eprinttype = {arXiv},
eprint = {2205.14407},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-14407.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuryGSS21,
author = {Marc Bury and
Michele Gentili and
Chris Schwiegelshohn and
Mara Sorella},
title = {Polynomial Time Approximation Schemes for All 1-Center Problems on
Metric Rational Set Similarities},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1371--1392},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00787-3},
doi = {10.1007/S00453-020-00787-3},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuryGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FeldmannS21,
author = {Andreas Emil Feldmann and
David Saulpic},
title = {Polynomial time approximation schemes for clustering in low highway
dimension graphs},
journal = {J. Comput. Syst. Sci.},
volume = {122},
pages = {72--93},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.06.002},
doi = {10.1016/J.JCSS.2021.06.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/FeldmannS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sitters21,
author = {Ren{\'{e}} Sitters},
title = {Polynomial Time Approximation Schemes for the Traveling Repairman
and Other Minimum Latency Problems},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {5},
pages = {1580--1602},
year = {2021},
url = {https://doi.org/10.1137/19M126918X},
doi = {10.1137/19M126918X},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Sitters21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PilipczukLW20,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering
Problems in Planar Graphs},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1703--1739},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00670-w},
doi = {10.1007/S00453-019-00670-W},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PilipczukLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChenLSWB20,
author = {Xin Chen and
Yage Liang and
Malgorzata Sterna and
Wen Wang and
Jacek Blazewicz},
title = {Fully polynomial time approximation scheme to maximize early work
on parallel machines with common due date},
journal = {Eur. J. Oper. Res.},
volume = {284},
number = {1},
pages = {67--74},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2019.12.003},
doi = {10.1016/J.EJOR.2019.12.003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/ChenLSWB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DongJLT20,
author = {Jianming Dong and
Ruyan Jin and
Taibo Luo and
Weitian Tong},
title = {A polynomial-time approximation scheme for an arbitrary number of
parallel two-stage flow-shops},
journal = {Eur. J. Oper. Res.},
volume = {281},
number = {1},
pages = {16--24},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2019.08.019},
doi = {10.1016/J.EJOR.2019.08.019},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/DongJLT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HochbaumR20,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {A fully polynomial time approximation scheme for the Replenishment
Storage problem},
journal = {Oper. Res. Lett.},
volume = {48},
number = {6},
pages = {835--839},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.10.004},
doi = {10.1016/J.ORL.2020.10.004},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HochbaumR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Halman20,
author = {Nir Halman},
title = {A technical note: fully polynomial time approximation schemes for
minimizing the makespan of deteriorating jobs with nonlinear processing
times},
journal = {J. Sched.},
volume = {23},
number = {6},
pages = {643--648},
year = {2020},
url = {https://doi.org/10.1007/s10951-019-00616-8},
doi = {10.1007/S10951-019-00616-8},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Halman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KeikhaLM20,
author = {Vahideh Keikha and
Maarten L{\"{o}}ffler and
Ali Mohades},
title = {A fully polynomial time approximation scheme for the smallest diameter
of imprecise points},
journal = {Theor. Comput. Sci.},
volume = {814},
pages = {259--270},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.02.006},
doi = {10.1016/J.TCS.2020.02.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KeikhaLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmannS20,
author = {Andreas Emil Feldmann and
David Saulpic},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Polynomial Time Approximation Schemes for Clustering in Low Highway
Dimension Graphs},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {46:1--46:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.46},
doi = {10.4230/LIPICS.ESA.2020.46},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FeldmannS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChudnovskyPPT20,
author = {Maria Chudnovsky and
Marcin Pilipczuk and
Michal Pilipczuk and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Shuchi Chawla},
title = {Quasi-polynomial time approximation schemes for the Maximum Weight
Independent Set Problem in \emph{H}-free graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2260--2278},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.139},
doi = {10.1137/1.9781611975994.139},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChudnovskyPPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Dvorak20,
author = {Zdenek Dvor{\'{a}}k},
editor = {Shuchi Chawla},
title = {Baker game and polynomial-time approximation schemes},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2227--2240},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.137},
doi = {10.1137/1.9781611975994.137},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Dvorak20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RahgoshayS20,
author = {Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource
Minimization for Fire Containment},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {33:1--33:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.33},
doi = {10.4230/LIPICS.STACS.2020.33},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/RahgoshayS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12897,
author = {Andreas Emil Feldmann and
David Saulpic},
title = {Polynomial Time Approximation Schemes for Clustering in Low Highway
Dimension Graphs},
journal = {CoRR},
volume = {abs/2006.12897},
year = {2020},
url = {https://arxiv.org/abs/2006.12897},
eprinttype = {arXiv},
eprint = {2006.12897},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-00912,
author = {Marius{-}Simion Costandin and
Bogdan Gavrea},
title = {A Fully Polynomial Time Approximation Scheme For {A} NP-Hard Problem},
journal = {CoRR},
volume = {abs/2007.00912},
year = {2020},
url = {https://arxiv.org/abs/2007.00912},
eprinttype = {arXiv},
eprint = {2007.00912},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-00912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-01631,
author = {Dorit S. Hochbaum and
Xu Rao},
title = {A Fully Polynomial Time Approximation Scheme for the Replenishment
Storage Problem},
journal = {CoRR},
volume = {abs/2010.01631},
year = {2020},
url = {https://arxiv.org/abs/2010.01631},
eprinttype = {arXiv},
eprint = {2010.01631},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-01631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-08049,
author = {Yifan Jing and
Bojan Mohar},
title = {Efficient polynomial-time approximation scheme for the genus of dense
graphs},
journal = {CoRR},
volume = {abs/2011.08049},
year = {2020},
url = {https://arxiv.org/abs/2011.08049},
eprinttype = {arXiv},
eprint = {2011.08049},
timestamp = {Thu, 19 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-08049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AntoniadisHO19,
author = {Antonios Antoniadis and
Chien{-}Chung Huang and
Sebastian Ott},
title = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with
a Sleep State},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3725--3745},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00596-3},
doi = {10.1007/S00453-019-00596-3},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisHO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ShiT19,
author = {Yongtang Shi and
Jianhua Tu},
title = {An efficient polynomial time approximation scheme for the vertex cover
\emph{P\({}_{\mbox{ }}\)3} problem on planar graphs},
journal = {Discuss. Math. Graph Theory},
volume = {39},
number = {1},
pages = {55--65},
year = {2019},
url = {https://doi.org/10.7151/dmgt.2060},
doi = {10.7151/DMGT.2060},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ShiT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DongJHL19,
author = {Jianming Dong and
Ruyan Jin and
Jueliang Hu and
Guohui Lin},
title = {A fully polynomial time approximation scheme for scheduling on parallel
identical two-stage openshops},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {668--684},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0314-6},
doi = {10.1007/S10878-018-0314-6},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DongJHL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GamzuS19,
author = {Iftah Gamzu and
Danny Segev},
title = {A polynomial-time approximation scheme for the airplane refueling
problem},
journal = {J. Sched.},
volume = {22},
number = {1},
pages = {119--135},
year = {2019},
url = {https://doi.org/10.1007/s10951-018-0569-x},
doi = {10.1007/S10951-018-0569-X},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GamzuS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadPP19,
author = {Vincent Cohen{-}Addad and
Michal Pilipczuk and
Marcin Pilipczuk},
editor = {David Zuckerman},
title = {A Polynomial-Time Approximation Scheme for Facility Location on Planar
Graphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {560--581},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00042},
doi = {10.1109/FOCS.2019.00042},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/numta/Khandeev19,
author = {Vladimir I. Khandeev},
editor = {Yaroslav D. Sergeyev and
Dmitri E. Kvasov},
title = {Polynomial-Time Approximation Scheme for a Problem of Searching for
the Largest Subset with the Constraint on Quadratic Variation},
booktitle = {Numerical Computations: Theory and Algorithms - Third International
Conference, {NUMTA} 2019, Crotone, Italy, June 15-21, 2019, Revised
Selected Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {11974},
pages = {400--405},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-40616-5\_36},
doi = {10.1007/978-3-030-40616-5\_36},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/numta/Khandeev19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Arunachaleswaran19,
author = {Eshwar Ram Arunachaleswaran and
Siddharth Barman and
Nidhi Rathi},
editor = {Timothy M. Chan},
title = {Fully Polynomial-Time Approximation Schemes for Fair Rent Division},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1994--2013},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.121},
doi = {10.1137/1.9781611975482.121},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/Arunachaleswaran19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniFH19,
author = {MohammadHossein Bateni and
Alireza Farhadi and
MohammadTaghi Hajiaghayi},
editor = {Timothy M. Chan},
title = {Polynomial-time Approximation Scheme for Minimum k-cut in Planar and
Minor-free Graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1055--1068},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.65},
doi = {10.1137/1.9781611975482.65},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BateniFH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/SilvaSP19,
author = {Mauro R. C. da Silva and
Rafael C. S. Schouery and
Lehilton L. C. Pedrosa},
editor = {Gabriel Coutinho and
Yoshiharu Kohayakawa and
Vin{\'{\i}}cius Fernandes dos Santos and
Sebasti{\'{a}}n Urrutia},
title = {A Polynomial-time Approximation Scheme for the {MAXSPACE} Advertisement
Problem},
booktitle = {Proceedings of the tenth Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2019, Belo Horizonte, Brazil, June
2-7, 2019},
series = {Electronic Notes in Theoretical Computer Science},
volume = {346},
pages = {699--710},
publisher = {Elsevier},
year = {2019},
url = {https://doi.org/10.1016/j.entcs.2019.08.061},
doi = {10.1016/J.ENTCS.2019.08.061},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/SilvaSP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-01797,
author = {Zdenek Dvor{\'{a}}k},
title = {Baker game and polynomial-time approximation schemes},
journal = {CoRR},
volume = {abs/1901.01797},
year = {2019},
url = {http://arxiv.org/abs/1901.01797},
eprinttype = {arXiv},
eprint = {1901.01797},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-01797.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-10680,
author = {Vincent Cohen{-}Addad and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {A Polynomial-Time Approximation Scheme for Facility Location on Planar
Graphs},
journal = {CoRR},
volume = {abs/1904.10680},
year = {2019},
url = {http://arxiv.org/abs/1904.10680},
eprinttype = {arXiv},
eprint = {1904.10680},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-10680.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04585,
author = {Maria Chudnovsky and
Marcin Pilipczuk and
Michal Pilipczuk and
St{\'{e}}phan Thomass{\'{e}}},
title = {Quasi-polynomial time approximation schemes for the Maximum Weight
Independent Set Problem in H-free graphs},
journal = {CoRR},
volume = {abs/1907.04585},
year = {2019},
url = {http://arxiv.org/abs/1907.04585},
eprinttype = {arXiv},
eprint = {1907.04585},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04585.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FominLS18,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Saket Saurabh},
title = {Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {10:1--10:44},
year = {2018},
url = {https://doi.org/10.1145/3154833},
doi = {10.1145/3154833},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FominLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algocloud/NeumannPSSW18,
author = {Frank Neumann and
Sergey Polyakovskiy and
Martin Skutella and
Leen Stougie and
Junhua Wu},
editor = {Yann Disser and
Vassilios S. Verykios},
title = {A Fully Polynomial Time Approximation Scheme for Packing While Traveling},
booktitle = {Algorithmic Aspects of Cloud Computing - 4th International Symposium,
{ALGOCLOUD} 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11409},
pages = {59--72},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-19759-9\_5},
doi = {10.1007/978-3-030-19759-9\_5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/algocloud/NeumannPSSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/CaskurluWSMW18,
author = {Bugra {\c{C}}askurlu and
Matthew D. Williamson and
K. Subramani and
Vahan Mkrtchyan and
Piotr Wojciechowski},
editor = {B. S. Panda and
Partha P. Goswami},
title = {A Fully Polynomial Time Approximation Scheme for Refutations in Weighted
Difference Constraint Systems},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {45--58},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_4},
doi = {10.1007/978-3-319-74180-2\_4},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/CaskurluWSMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BeckerKS18,
author = {Amariah Becker and
Philip N. Klein and
David Saulpic},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Polynomial-Time Approximation Schemes for k-center, k-median, and
Capacitated Vehicle Routing in Bounded Highway Dimension},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {8:1--8:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.8},
doi = {10.4230/LIPICS.ESA.2018.8},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BeckerKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/PilipczukLW18,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering
Problems in Planar Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {65:1--65:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.65},
doi = {10.4230/LIPICS.ESA.2018.65},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/PilipczukLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoharJ18,
author = {Bojan Mohar and
Yifan Jing},
editor = {Mikkel Thorup},
title = {Efficient Polynomial-Time Approximation Scheme for the Genus of Dense
Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {719--730},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00074},
doi = {10.1109/FOCS.2018.00074},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MoharJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Dvorak18,
author = {Zdenek Dvor{\'{a}}k},
editor = {Artur Czumaj},
title = {Thin graph classes and polynomial-time approximation schemes},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1685--1701},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.110},
doi = {10.1137/1.9781611975031.110},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Dvorak18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/MotwaniOZ18,
author = {Rajeev Motwani and
Liadan O'Callaghan and
An Zhu},
editor = {Teofilo F. Gonzalez},
title = {Asymptotic Polynomial Time Approximation Schemes},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {173--187},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-10},
doi = {10.1201/9781351236423-10},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/tf/18/MotwaniOZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/ShachnaiT18,
author = {Hadas Shachnai and
Tami Tamir},
editor = {Teofilo F. Gonzalez},
title = {Polynomial Time Approximation Schemes},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {125--156},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-8},
doi = {10.1201/9781351236423-8},
timestamp = {Fri, 25 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/tf/18/ShachnaiT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-04163,
author = {Eshwar Ram Arunachaleswaran and
Siddharth Barman and
Nidhi Rathi},
title = {Fully Polynomial-Time Approximation Schemes for Fair Rent Division},
journal = {CoRR},
volume = {abs/1807.04163},
year = {2018},
url = {http://arxiv.org/abs/1807.04163},
eprinttype = {arXiv},
eprint = {1807.04163},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-04163.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07626,
author = {Michal Pilipczuk and
Erik Jan van Leeuwen and
Andreas Wiese},
title = {Quasi-polynomial time approximation schemes for packing and covering
problems in planar graphs},
journal = {CoRR},
volume = {abs/1807.07626},
year = {2018},
url = {http://arxiv.org/abs/1807.07626},
eprinttype = {arXiv},
eprint = {1807.07626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04052,
author = {MohammadHossein Bateni and
Alireza Farhadi and
MohammadTaghi Hajiaghayi},
title = {Polynomial-time Approximation Scheme for Minimum k-cut in Planar and
Minor-free Graphs},
journal = {CoRR},
volume = {abs/1811.04052},
year = {2018},
url = {http://arxiv.org/abs/1811.04052},
eprinttype = {arXiv},
eprint = {1811.04052},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiWC17,
author = {Weidong Li and
Lusheng Wang and
Wenjuan Cui},
title = {A Polynomial Time Approximation Scheme for the Closest Shared Center
Problem},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {65--83},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0057-z},
doi = {10.1007/S00453-015-0057-Z},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiWC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/DiaoLD17,
author = {Rui Diao and
Ya{-}Feng Liu and
Yu{-}Hong Dai},
title = {A new fully polynomial time approximation scheme for the interval
subset sum problem},
journal = {J. Glob. Optim.},
volume = {68},
number = {4},
pages = {749--775},
year = {2017},
url = {https://doi.org/10.1007/s10898-017-0514-0},
doi = {10.1007/S10898-017-0514-0},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/DiaoLD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/SternaC17,
author = {Malgorzata Sterna and
Kateryna Czerniachowska},
title = {Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling
with a Common Due Date to Maximize Early Work},
journal = {J. Optim. Theory Appl.},
volume = {174},
number = {3},
pages = {927--944},
year = {2017},
url = {https://doi.org/10.1007/s10957-017-1147-7},
doi = {10.1007/S10957-017-1147-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/SternaC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/KacemSS17,
author = {Imed Kacem and
Myriam Sahnoune and
G{\"{u}}nter Schmidt},
title = {Strongly Fully Polynomial Time Approximation Scheme for the weighted
completion time minimization problem on two-parallel capacitated machines},
journal = {{RAIRO} Oper. Res.},
volume = {51},
number = {4},
pages = {1177--1188},
year = {2017},
url = {https://doi.org/10.1051/ro/2017044},
doi = {10.1051/RO/2017044},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/KacemSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BeckerKS17,
author = {Amariah Becker and
Philip N. Klein and
David Saulpic},
editor = {Kirk Pruhs and
Christian Sohler},
title = {A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on
Planar and Bounded-Genus Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {12:1--12:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.12},
doi = {10.4230/LIPICS.ESA.2017.12},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/BeckerKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeckerKS17,
author = {Amariah Becker and
Philip N. Klein and
David Saulpic},
title = {Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity
Vehicle Routing in Metrics with Bounded Highway Dimension},
journal = {CoRR},
volume = {abs/1707.08270},
year = {2017},
url = {http://arxiv.org/abs/1707.08270},
eprinttype = {arXiv},
eprint = {1707.08270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeckerKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DiaoLD17,
author = {Rui Diao and
Ya{-}Feng Liu and
Yu{-}Hong Dai},
title = {A New Fully Polynomial Time Approximation Scheme for the Interval
Subset Sum Problem},
journal = {CoRR},
volume = {abs/1704.06928},
year = {2017},
url = {http://arxiv.org/abs/1704.06928},
eprinttype = {arXiv},
eprint = {1704.06928},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DiaoLD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dvorak17,
author = {Zdenek Dvor{\'{a}}k},
title = {Thin graph classes and polynomial-time approximation schemes},
journal = {CoRR},
volume = {abs/1704.00125},
year = {2017},
url = {http://arxiv.org/abs/1704.00125},
eprinttype = {arXiv},
eprint = {1704.00125},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/Dvorak17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NeumannPSSW17,
author = {Frank Neumann and
Sergey Polyakovskiy and
Martin Skutella and
Leen Stougie and
Junhua Wu},
title = {A Fully Polynomial Time Approximation Scheme for Packing While Traveling},
journal = {CoRR},
volume = {abs/1702.05217},
year = {2017},
url = {http://arxiv.org/abs/1702.05217},
eprinttype = {arXiv},
eprint = {1702.05217},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NeumannPSSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MiyazawaPSSW16,
author = {Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa and
Rafael Crivellari Saliba Schouery and
Maxim Sviridenko and
Yoshiko Wakabayashi},
title = {Polynomial-Time Approximation Schemes for Circle and Other Packing
Problems},
journal = {Algorithmica},
volume = {76},
number = {2},
pages = {536--568},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0052-4},
doi = {10.1007/S00453-015-0052-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/MiyazawaPSSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ItoNOOUUU16,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
title = {A polynomial-time approximation scheme for the geometric unique coverage
problem on unit squares},
journal = {Comput. Geom.},
volume = {51},
pages = {25--39},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2015.10.004},
doi = {10.1016/J.COMGEO.2015.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ItoNOOUUU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SkutellaV16,
author = {Martin Skutella and
Jos{\'{e}} Verschae},
title = {Robust Polynomial-Time Approximation Schemes for Parallel Machine
Scheduling with Job Arrivals and Departures},
journal = {Math. Oper. Res.},
volume = {41},
number = {3},
pages = {991--1021},
year = {2016},
url = {https://doi.org/10.1287/moor.2015.0765},
doi = {10.1287/MOOR.2015.0765},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SkutellaV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BartalGK16,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Robert Krauthgamer},
title = {The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial
Time Approximation Scheme},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1563--1581},
year = {2016},
url = {https://doi.org/10.1137/130913328},
doi = {10.1137/130913328},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BartalGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Halman16,
author = {Nir Halman},
title = {A deterministic fully polynomial time approximation scheme for counting
integer knapsack solutions made easy},
journal = {Theor. Comput. Sci.},
volume = {645},
pages = {41--47},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.06.015},
doi = {10.1016/J.TCS.2016.06.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Halman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Halman16,
author = {Nir Halman},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {A Deterministic Fully Polynomial Time Approximation Scheme For Counting
Integer Knapsack Solutions Made Easy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {9:1--9:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.9},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.9},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Halman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/door/KelmanovKR16,
author = {Alexander Kelmanov and
Sergey A. Khamidullin and
Semyon Romanchenko},
editor = {Alexander V. Kononov and
Igor A. Bykadorov and
Oleg V. Khamisov and
Ivan A. Davydov and
Polina A. Kononova},
title = {Fully Polynomial-Time Approximation Scheme for a Problem of Finding
a Subsequence},
booktitle = {Supplementary Proceedings of the 9th International Conference on Discrete
Optimization and Operations Research and Scientific School {(DOOR}
2016), Vladivostok, Russia, September 19 - 23, 2016},
series = {{CEUR} Workshop Proceedings},
volume = {1623},
pages = {516--525},
publisher = {CEUR-WS.org},
year = {2016},
url = {https://ceur-ws.org/Vol-1623/papercpr4.pdf},
timestamp = {Fri, 10 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/door/KelmanovKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/door/KelmanovM16,
author = {Alexander Kel'manov and
Anna Motkova},
editor = {Yury Kochetov and
Michael Yu. Khachay and
Vladimir L. Beresnev and
Evgeni A. Nurminski and
Panos M. Pardalos},
title = {A Fully Polynomial-Time Approximation Scheme for a Special Case of
a Balanced 2-Clustering Problem},
booktitle = {Discrete Optimization and Operations Research - 9th International
Conference, {DOOR} 2016, Vladivostok, Russia, September 19-23, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9869},
pages = {182--192},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44914-2\_15},
doi = {10.1007/978-3-319-44914-2\_15},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/door/KelmanovM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Jansen16,
author = {Klaus Jansen},
title = {Efficient Polynomial Time Approximation Scheme for Scheduling Jobs
onUniform Processors},
booktitle = {Encyclopedia of Algorithms},
pages = {624--628},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_500},
doi = {10.1007/978-1-4939-2864-4\_500},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Jansen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Alon16,
author = {Tzvi Alon},
title = {Fully polynomial time approximation schemes {(FPTAS)} for some counting
problems},
journal = {CoRR},
volume = {abs/1611.00992},
year = {2016},
url = {http://arxiv.org/abs/1611.00992},
eprinttype = {arXiv},
eprint = {1611.00992},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Alon16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Shioura15,
author = {Akiyoshi Shioura},
title = {Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes
Utility Under Budget Constraints},
journal = {Math. Oper. Res.},
volume = {40},
number = {1},
pages = {192--225},
year = {2015},
url = {https://doi.org/10.1287/moor.2014.0668},
doi = {10.1287/MOOR.2014.0668},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Shioura15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/MuLM15,
author = {Shin{-}Cheng Mu and
Yu{-}Han Lyu and
Akimasa Morihata},
title = {Approximate by thinning: Deriving fully polynomial-time approximation
schemes},
journal = {Sci. Comput. Program.},
volume = {98},
pages = {484--515},
year = {2015},
url = {https://doi.org/10.1016/j.scico.2014.07.001},
doi = {10.1016/J.SCICO.2014.07.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scp/MuLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MustafaRR15,
author = {Nabil H. Mustafa and
Rajiv Raman and
Saurabh Ray},
title = {Quasi-Polynomial Time Approximation Scheme for Weighted Geometric
Set Cover on Pseudodisks and Halfspaces},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {6},
pages = {1650--1669},
year = {2015},
url = {https://doi.org/10.1137/14099317X},
doi = {10.1137/14099317X},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MustafaRR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BorradaileKM15,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {3},
pages = {19:1--19:20},
year = {2015},
url = {https://doi.org/10.1145/2629654},
doi = {10.1145/2629654},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BorradaileKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KhachayZ15,
author = {Michael Yu. Khachay and
Helen Zaytseva},
editor = {Zaixin Lu and
Donghyun Kim and
Weili Wu and
Wei Li and
Ding{-}Zhu Du},
title = {Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated
Vehicle Routing Problem},
booktitle = {Combinatorial Optimization and Applications - 9th International Conference,
{COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9486},
pages = {178--190},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-26626-8\_14},
doi = {10.1007/978-3-319-26626-8\_14},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/KhachayZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ieem/Lin15,
author = {Shieu{-}Hong Lin},
title = {Multi-objective constrained vehicle refueling planning: Complexity
and polynomial-time approximation schemes},
booktitle = {2015 {IEEE} International Conference on Industrial Engineering and
Engineering Management, {IEEM} 2015, Singapore, December 6-9, 2015},
pages = {1188--1192},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/IEEM.2015.7385835},
doi = {10.1109/IEEM.2015.7385835},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/ieem/Lin15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AntoniadisHO15,
author = {Antonios Antoniadis and
Chien{-}Chung Huang and
Sebastian Ott},
editor = {Piotr Indyk},
title = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with
Sleep State},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1102--1113},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.74},
doi = {10.1137/1.9781611973730.74},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AntoniadisHO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FoxKM15,
author = {Kyle Fox and
Philip N. Klein and
Shay Mozes},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {841--850},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746564},
doi = {10.1145/2746539.2746564},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FoxKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FoxKM15,
author = {Kyle Fox and
Philip N. Klein and
Shay Mozes},
title = {A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection},
journal = {CoRR},
volume = {abs/1504.08008},
year = {2015},
url = {http://arxiv.org/abs/1504.08008},
eprinttype = {arXiv},
eprint = {1504.08008},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FoxKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GamzuS15,
author = {Iftah Gamzu and
Danny Segev},
title = {A Polynomial-Time Approximation Scheme for The Airplane Refueling
Problem},
journal = {CoRR},
volume = {abs/1512.06353},
year = {2015},
url = {http://arxiv.org/abs/1512.06353},
eprinttype = {arXiv},
eprint = {1512.06353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GamzuS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BorradaileDT14,
author = {Glencora Borradaile and
Erik D. Demaine and
Siamak Tazari},
title = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
in Bounded-Genus Graphs},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {287--311},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9662-2},
doi = {10.1007/S00453-012-9662-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BorradaileDT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EpsteinL14,
author = {Leah Epstein and
Asaf Levin},
title = {An efficient polynomial time approximation scheme for load balancing
on uniformly related machines},
journal = {Math. Program.},
volume = {147},
number = {1-2},
pages = {1--23},
year = {2014},
url = {https://doi.org/10.1007/s10107-013-0706-4},
doi = {10.1007/S10107-013-0706-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/EpsteinL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LiS14,
author = {Jian Li and
Tianlin Shi},
title = {A fully polynomial-time approximation scheme for approximating a sum
of random variables},
journal = {Oper. Res. Lett.},
volume = {42},
number = {3},
pages = {197--202},
year = {2014},
url = {https://doi.org/10.1016/j.orl.2014.02.004},
doi = {10.1016/J.ORL.2014.02.004},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HalmanKLOS14,
author = {Nir Halman and
Diego Klabjan and
Chung{-}Lun Li and
James B. Orlin and
David Simchi{-}Levi},
title = {Fully Polynomial Time Approximation Schemes for Stochastic Dynamic
Programs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {4},
pages = {1725--1796},
year = {2014},
url = {https://doi.org/10.1137/130925153},
doi = {10.1137/130925153},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HalmanKLOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tse/TrummerFB14,
author = {Immanuel Trummer and
Boi Faltings and
Walter Binder},
title = {Multi-Objective Quality-Driven Service Selection - {A} Fully Polynomial
Time Approximation Scheme},
journal = {{IEEE} Trans. Software Eng.},
volume = {40},
number = {2},
pages = {167--191},
year = {2014},
url = {https://doi.org/10.1109/TSE.2013.61},
doi = {10.1109/TSE.2013.61},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tse/TrummerFB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/SongHD14,
author = {Liang Song and
Hejiao Huang and
Hongwei Du},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {A Quasi-polynomial Time Approximation Scheme for Euclidean {CVRPTW}},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {66--73},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_6},
doi = {10.1007/978-3-319-12691-3\_6},
timestamp = {Wed, 07 Aug 2024 10:33:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/SongHD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Har-Peled14,
author = {Sariel Har{-}Peled},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {120},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582157},
doi = {10.1145/2582112.2582157},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Har-Peled14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MiyazawaPSSW14,
author = {Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa and
Rafael Crivellari Saliba Schouery and
Maxim Sviridenko and
Yoshiko Wakabayashi},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Polynomial-Time Approximation Schemes for Circle Packing Problems},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {713--724},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_59},
doi = {10.1007/978-3-662-44777-2\_59},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/MiyazawaPSSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaskalakisDDMS14,
author = {Constantinos Daskalakis and
Anindya De and
Ilias Diakonikolas and
Ankur Moitra and
Rocco A. Servedio},
editor = {Chandra Chekuri},
title = {A Polynomial-time Approximation Scheme for Fault-tolerant Distributed
Storage},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {628--644},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.48},
doi = {10.1137/1.9781611973402.48},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DaskalakisDDMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Sitters14,
author = {Ren{\'{e}} Sitters},
editor = {Chandra Chekuri},
title = {Polynomial time approximation schemes for the traveling repairman
and other minimum latency problems},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {604--616},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.46},
doi = {10.1137/1.9781611973402.46},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Sitters14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AntoniadisHO14,
author = {Antonios Antoniadis and
Chien{-}Chung Huang and
Sebastian Ott},
title = {A Fully Polynomial-Time Approximation Scheme for Speed Scaling with
Sleep State},
journal = {CoRR},
volume = {abs/1407.0892},
year = {2014},
url = {http://arxiv.org/abs/1407.0892},
eprinttype = {arXiv},
eprint = {1407.0892},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AntoniadisHO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MiyazawaPSSW14,
author = {Fl{\'{a}}vio Keidi Miyazawa and
Lehilton L. C. Pedrosa and
Rafael Crivellari Saliba Schouery and
Maxim Sviridenko and
Yoshiko Wakabayashi},
title = {Polynomial-Time Approximation Schemes for Circle and Other Packing
Problems},
journal = {CoRR},
volume = {abs/1412.4709},
year = {2014},
url = {http://arxiv.org/abs/1412.4709},
eprinttype = {arXiv},
eprint = {1412.4709},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MiyazawaPSSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KianfarM13,
author = {Kamran Kianfar and
Ghasem Moslehi},
title = {A note on "Fully polynomial time approximation scheme for the total
weighted tardiness minimization with a common due date"},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {2205--2206},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.026},
doi = {10.1016/J.DAM.2013.02.026},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KianfarM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LiWC13,
author = {Weidong Li and
Lusheng Wang and
Wenjuan Cui},
editor = {Ding{-}Zhu Du and
Guochuan Zhang},
title = {A Polynomial Time Approximation Scheme for the Closest Shared Center
Problem},
booktitle = {Computing and Combinatorics, 19th International Conference, {COCOON}
2013, Hangzhou, China, June 21-23, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7936},
pages = {385--396},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38768-5\_35},
doi = {10.1007/978-3-642-38768-5\_35},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/LiWC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/NonnerS13,
author = {Tim Nonner and
Maxim Sviridenko},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment
Problem},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {314--323},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_27},
doi = {10.1007/978-3-642-36694-9\_27},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/NonnerS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iswpc/RafiqFR13,
author = {Rahat Ibn Rafiq and
Rahman Farhan and
Md. Saidur Rahman},
title = {Polynomial time approximation scheme for t-latency bounded information
propagation problem in heterogeneous wireless networks},
booktitle = {International Symposium on Wireless and pervasive Computing, {ISWPC}
2013, Taipei, Taiwan, November 20-22, 2013},
pages = {1--6},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ISWPC.2013.6707432},
doi = {10.1109/ISWPC.2013.6707432},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iswpc/RafiqFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaskalakisDDMS13,
author = {Constantinos Daskalakis and
Anindya De and
Ilias Diakonikolas and
Ankur Moitra and
Rocco A. Servedio},
title = {A Polynomial-time Approximation Scheme for Fault-tolerant Distributed
Storage},
journal = {CoRR},
volume = {abs/1307.3621},
year = {2013},
url = {http://arxiv.org/abs/1307.3621},
eprinttype = {arXiv},
eprint = {1307.3621},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DaskalakisDDMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Har-Peled13,
author = {Sariel Har{-}Peled},
title = {Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons},
journal = {CoRR},
volume = {abs/1312.1369},
year = {2013},
url = {http://arxiv.org/abs/1312.1369},
eprinttype = {arXiv},
eprint = {1312.1369},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Har-Peled13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Sitters13,
author = {Ren{\'{e}} Sitters},
title = {Polynomial time approximation schemes for the traveling repairman
and other minimum latency problems},
journal = {CoRR},
volume = {abs/1307.4289},
year = {2013},
url = {http://arxiv.org/abs/1307.4289},
eprinttype = {arXiv},
eprint = {1307.4289},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Sitters13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-7270,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A polynomial-time approximation scheme for Euclidean Steiner forest},
journal = {CoRR},
volume = {abs/1302.7270},
year = {2013},
url = {http://arxiv.org/abs/1302.7270},
eprinttype = {arXiv},
eprint = {1302.7270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-7270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Wu12,
author = {Bang Ye Wu},
title = {Fully Polynomial-Time Approximation Schemes for the Max-Min Connected
Partition Problem on Interval Graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {4},
number = {1},
year = {2012},
url = {https://doi.org/10.1142/S179383091250005X},
doi = {10.1142/S179383091250005X},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/Wu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jam/Chen12a,
author = {Yen Hung Chen},
title = {Polynomial Time Approximation Schemes for the Constrained Minimum
Spanning Tree Problem},
journal = {J. Appl. Math.},
volume = {2012},
pages = {394721:1--394721:8},
year = {2012},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jam/Chen12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLW12,
author = {Jianping Li and
Weidong Li and
Lusheng Wang},
title = {A polynomial time approximation scheme for embedding a directed hypergraph
on a weighted ring},
journal = {J. Comb. Optim.},
volume = {24},
number = {3},
pages = {319--328},
year = {2012},
url = {https://doi.org/10.1007/s10878-011-9387-1},
doi = {10.1007/S10878-011-9387-1},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangZWZL12,
author = {Wei Zhang and
Zhao Zhang and
Wei Wang and
Feng Zou and
Wonjun Lee},
title = {Polynomial time approximation scheme for t-latency bounded information
propagation problem in wireless networks},
journal = {J. Comb. Optim.},
volume = {23},
number = {4},
pages = {451--461},
year = {2012},
url = {https://doi.org/10.1007/s10878-010-9359-x},
doi = {10.1007/S10878-010-9359-X},
timestamp = {Wed, 23 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangZWZL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Hadda12,
author = {Hatem Hadda},
title = {A polynomial-time approximation scheme for the two machine flow shop
problem with several availability constraints},
journal = {Optim. Lett.},
volume = {6},
number = {3},
pages = {559--569},
year = {2012},
url = {https://doi.org/10.1007/s11590-011-0281-7},
doi = {10.1007/S11590-011-0281-7},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Hadda12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StefankovicVV12,
author = {Daniel Stefankovic and
Santosh S. Vempala and
Eric Vigoda},
title = {A Deterministic Polynomial-Time Approximation Scheme for Counting
Knapsack Solutions},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {2},
pages = {356--366},
year = {2012},
url = {https://doi.org/10.1137/11083976X},
doi = {10.1137/11083976X},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StefankovicVV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuYZWLP12,
author = {Hongwei Du and
Qiang Ye and
Jiaofei Zhong and
Yuexuan Wang and
Wonjun Lee and
Haesun Park},
title = {Polynomial-time approximation scheme for minimum connected dominating
set under routing cost constraint in wireless sensor networks},
journal = {Theor. Comput. Sci.},
volume = {447},
pages = {38--43},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.10.010},
doi = {10.1016/J.TCS.2011.10.010},
timestamp = {Wed, 23 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuYZWLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/MitavskiyH12,
author = {Boris Mitavskiy and
Jun He},
title = {A polynomial time approximation scheme for a single machine scheduling
problem using a hybrid evolutionary algorithm},
booktitle = {Proceedings of the {IEEE} Congress on Evolutionary Computation, {CEC}
2012, Brisbane, Australia, June 10-15, 2012},
pages = {1--8},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/CEC.2012.6256166},
doi = {10.1109/CEC.2012.6256166},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/cec/MitavskiyH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Nonner12,
author = {Tim Nonner},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Polynomial-Time Approximation Schemes for Shortest Path with Alternatives},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {755--765},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_65},
doi = {10.1007/978-3-642-33090-2\_65},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Nonner12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniHKM12,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Philip N. Klein and
Claire Mathieu},
editor = {Yuval Rabani},
title = {A polynomial-time approximation scheme for planar multiway cut},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {639--655},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.54},
doi = {10.1137/1.9781611973099.54},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniHKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EisenstatKM12,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
editor = {Yuval Rabani},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {626--638},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.53},
doi = {10.1137/1.9781611973099.53},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EisenstatKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartalGK12,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Robert Krauthgamer},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {The traveling salesman problem: low-dimensionality implies a polynomial
time approximation scheme},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {663--672},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214038},
doi = {10.1145/2213977.2214038},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BartalGK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ItoNOOUUU12,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage
Problem on Unit Squares},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {24--35},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_3},
doi = {10.1007/978-3-642-31155-0\_3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ItoNOOUUU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-1708,
author = {Boris Mitavskiy and
Jun He},
title = {A Polynomial Time Approximation Scheme for a Single Machine Scheduling
Problem Using a Hybrid Evolutionary Algorithm},
journal = {CoRR},
volume = {abs/1202.1708},
year = {2012},
url = {http://arxiv.org/abs/1202.1708},
eprinttype = {arXiv},
eprint = {1202.1708},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-1708.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4072,
author = {Leah Epstein and
Asaf Levin},
title = {An efficient polynomial time approximation scheme for load balancing
on uniformly related machines},
journal = {CoRR},
volume = {abs/1202.4072},
year = {2012},
url = {http://arxiv.org/abs/1202.4072},
eprinttype = {arXiv},
eprint = {1202.4072},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-4072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/Kacem11,
author = {Imed Kacem},
title = {Erratum to "Fully polynomial time approximation scheme for the weighted
flow-time minimization on a single machine with a fixed non-availability
interval" [Comput. Ind. Eng. 56(2009) 1708-1712]},
journal = {Comput. Ind. Eng.},
volume = {61},
number = {4},
pages = {1351},
year = {2011},
url = {https://doi.org/10.1016/j.cie.2011.06.016},
doi = {10.1016/J.CIE.2011.06.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/Kacem11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YangL11,
author = {Chaoxia Yang and
Guojun Li},
title = {A polynomial time approximation scheme for embedding hypergraph in
a weighted cycle},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {48},
pages = {6786--6793},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.08.014},
doi = {10.1016/J.TCS.2011.08.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Shioura11,
author = {Akiyoshi Shioura},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes
Utility under Budget Constraints},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {1--12},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_1},
doi = {10.1007/978-3-642-23719-5\_1},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Shioura11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwqos/HuangT11,
author = {Jun Huang and
Yoshiaki Tanaka},
title = {QoS routing algorithms using fully polynomial time approximation scheme},
booktitle = {19th International Workshop on Quality of Service, IWQoS 2011, San
Jose, California, USA, 6-7 June 2011},
pages = {1--3},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/IWQOS.2011.5931329},
doi = {10.1109/IWQOS.2011.5931329},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/iwqos/HuangT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1320,
author = {David Eisenstat and
Philip N. Klein and
Claire Mathieu},
title = {An efficient polynomial-time approximation scheme for Steiner forest
in planar graphs},
journal = {CoRR},
volume = {abs/1110.1320},
year = {2011},
url = {http://arxiv.org/abs/1110.1320},
eprinttype = {arXiv},
eprint = {1110.1320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-0699,
author = {Yair Bartal and
Lee{-}Ad Gottlieb and
Robert Krauthgamer},
title = {The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial
Time Approximation Scheme},
journal = {CoRR},
volume = {abs/1112.0699},
year = {2011},
url = {http://arxiv.org/abs/1112.0699},
eprinttype = {arXiv},
eprint = {1112.0699},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-0699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kacem10,
author = {Imed Kacem},
title = {Fully polynomial time approximation scheme for the total weighted
tardiness minimization with a common due date},
journal = {Discret. Appl. Math.},
volume = {158},
number = {9},
pages = {1035--1040},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.01.013},
doi = {10.1016/J.DAM.2010.01.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kacem10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiaoH10,
author = {Chen Liao and
Shiyan Hu},
title = {Polynomial time approximation schemes for minimum disk cover problems},
journal = {J. Comb. Optim.},
volume = {20},
number = {4},
pages = {399--412},
year = {2010},
url = {https://doi.org/10.1007/s10878-009-9216-y},
doi = {10.1007/S10878-009-9216-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiaoH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ZhangV10,
author = {Xiandong Zhang and
Steef L. van de Velde},
title = {Polynomial-time approximation schemes for scheduling problems with
time lags},
journal = {J. Sched.},
volume = {13},
number = {5},
pages = {553--559},
year = {2010},
url = {https://doi.org/10.1007/s10951-009-0134-8},
doi = {10.1007/S10951-009-0134-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ZhangV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Harutyunyan10a,
author = {Imed Kacem},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {New Fully Polynomial Time Approximation Scheme for the Makespan Minimization
with Positive Tails on a Single Machine with a Fixed Non-availability
Interval},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {101--104},
year = {2010},
timestamp = {Fri, 01 Jul 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/Harutyunyan10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/YangL10,
author = {Chaoxia Yang and
Guojun Li},
editor = {Der{-}Tsai Lee and
Danny Z. Chen and
Shi Ying},
title = {A Polynomial Time Approximation Scheme for Embedding Hypergraph in
a Weighted Cycle},
booktitle = {Frontiers in Algorithmics, 4th International Workshop, {FAW} 2010,
Wuhan, China, August 11-13, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6213},
pages = {197--209},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14553-7\_20},
doi = {10.1007/978-3-642-14553-7\_20},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/YangL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/MuLM10,
author = {Shin{-}Cheng Mu and
Yu{-}Han Lyu and
Akimasa Morihata},
editor = {Bruno C. d. S. Oliveira and
Marcin Zalewski},
title = {Constructing datatype-generic fully polynomial-time approximation
schemes using generalised thinning},
booktitle = {Proceedings of the {ACM} {SIGPLAN} Workshop on Generic Programming,
{WGP} 2010, Baltimore, MD, USA, September 27-29, 2010},
pages = {97--108},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1863495.1863508},
doi = {10.1145/1863495.1863508},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icfp/MuLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColemanW10,
author = {Tom Coleman and
Anthony Wirth},
editor = {Moses Charikar},
title = {A Polynomial Time Approximation Scheme for k-Consensus Clustering},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {729--740},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.59},
doi = {10.1137/1.9781611973075.59},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/ColemanW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DasM10,
author = {Aparna Das and
Claire Mathieu},
editor = {Moses Charikar},
title = {A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated
Vehicle Routing},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {390--403},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.33},
doi = {10.1137/1.9781611973075.33},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DasM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-1687,
author = {Daniel Stefankovic and
Santosh S. Vempala and
Eric Vigoda},
title = {A Deterministic Polynomial-time Approximation Scheme for Counting
Knapsack Solutions},
journal = {CoRR},
volume = {abs/1008.1687},
year = {2010},
url = {http://arxiv.org/abs/1008.1687},
eprinttype = {arXiv},
eprint = {1008.1687},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-1687.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-3187,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka},
title = {Polynomial-Time Approximation Schemes for Knapsack and Related Counting
Problems using Branching Programs},
journal = {CoRR},
volume = {abs/1008.3187},
year = {2010},
url = {http://arxiv.org/abs/1008.3187},
eprinttype = {arXiv},
eprint = {1008.3187},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-3187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanKM10,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka},
title = {Polynomial-Time Approximation Schemes for Knapsack and Related Counting
Problems using Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-133}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/133},
eprinttype = {ECCC},
eprint = {TR10-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanKM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/KacemM09,
author = {Imed Kacem and
Ali Ridha Mahjoub},
title = {Fully polynomial time approximation scheme for the weighted flow-time
minimization on a single machine with a fixed non-availability interval},
journal = {Comput. Ind. Eng.},
volume = {56},
number = {4},
pages = {1708--1712},
year = {2009},
url = {https://doi.org/10.1016/j.cie.2008.09.042},
doi = {10.1016/J.CIE.2008.09.042},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/KacemM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RemyS09,
author = {Jan Remy and
Angelika Steger},
title = {A quasi-polynomial time approximation scheme for minimum weight triangulation},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {15:1--15:47},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516517},
doi = {10.1145/1516512.1516517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RemyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HalmanKMOS09,
author = {Nir Halman and
Diego Klabjan and
Mohamed Mostagir and
James B. Orlin and
David Simchi{-}Levi},
title = {A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic
Inventory Control with Discrete Demand},
journal = {Math. Oper. Res.},
volume = {34},
number = {3},
pages = {674--685},
year = {2009},
url = {https://doi.org/10.1287/moor.1090.0391},
doi = {10.1287/MOOR.1090.0391},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HalmanKMOS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HalmanLS09,
author = {Nir Halman and
Chung{-}Lun Li and
David Simchi{-}Levi},
title = {Fully polynomial-time approximation schemes for time-cost tradeoff
problems in series-parallel project networks},
journal = {Oper. Res. Lett.},
volume = {37},
number = {4},
pages = {239--244},
year = {2009},
url = {https://doi.org/10.1016/j.orl.2009.03.002},
doi = {10.1016/J.ORL.2009.03.002},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HalmanLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/LiDX09,
author = {Guojun Li and
Xiaotie Deng and
Ying Xu},
title = {A polynomial-time approximation scheme for embedding hypergraph in
a cycle},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {20:1--20:12},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497296},
doi = {10.1145/1497290.1497296},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/LiDX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcas/HuLA09,
author = {Shiyan Hu and
Zhuo Li and
Charles J. Alpert},
title = {A Fully Polynomial-Time Approximation Scheme for Timing-Constrained
Minimum Cost Layer Assignment},
journal = {{IEEE} Trans. Circuits Syst. {II} Express Briefs},
volume = {56-II},
number = {7},
pages = {580--584},
year = {2009},
url = {https://doi.org/10.1109/TCSII.2009.2022203},
doi = {10.1109/TCSII.2009.2022203},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcas/HuLA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/HuLA09,
author = {Shiyan Hu and
Zhuo Li and
Charles J. Alpert},
title = {A fully polynomial time approximation scheme for timing driven minimum
cost buffer insertion},
booktitle = {Proceedings of the 46th Design Automation Conference, {DAC} 2009,
San Francisco, CA, USA, July 26-31, 2009},
pages = {424--429},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1629911.1630026},
doi = {10.1145/1629911.1630026},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dac/HuLA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppam/Berlinska09,
author = {Joanna Berlinska},
editor = {Roman Wyrzykowski and
Jack J. Dongarra and
Konrad Karczewski and
Jerzy Wasniewski},
title = {Fully Polynomial Time Approximation Schemes for Scheduling Divisible
Loads},
booktitle = {Parallel Processing and Applied Mathematics, 8th International Conference,
{PPAM} 2009, Wroclaw, Poland, September 13-16, 2009, Revised Selected
Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6068},
pages = {1--10},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-14403-5\_1},
doi = {10.1007/978-3-642-14403-5\_1},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ppam/Berlinska09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BorradaileDT09,
author = {Glencora Borradaile and
Erik D. Demaine and
Siamak Tazari},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
in Bounded-Genus Graphs},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {171--182},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1835},
doi = {10.4230/LIPICS.STACS.2009.1835},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BorradaileDT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1043,
author = {Glencora Borradaile and
Erik D. Demaine and
Siamak Tazari},
title = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems
in Bounded-Genus Graphs},
journal = {CoRR},
volume = {abs/0902.1043},
year = {2009},
url = {http://arxiv.org/abs/0902.1043},
eprinttype = {arXiv},
eprint = {0902.1043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-1080,
author = {Matt Gibson and
Gaurav Kanade and
Erik Krohn and
Kasturi R. Varadarajan},
title = {Quasi-Polynomial Time Approximation Schemes for Target Tracking},
journal = {CoRR},
volume = {abs/0907.1080},
year = {2009},
url = {http://arxiv.org/abs/0907.1080},
eprinttype = {arXiv},
eprint = {0907.1080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-1080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CarmiKL08,
author = {Paz Carmi and
Matthew J. Katz and
Nissan Lev{-}Tov},
title = {Polynomial-time approximation schemes for piercing and covering with
applications in wireless networks},
journal = {Comput. Geom.},
volume = {39},
number = {3},
pages = {209--218},
year = {2008},
url = {https://doi.org/10.1016/j.comgeo.2007.01.001},
doi = {10.1016/J.COMGEO.2007.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CarmiKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HalmanLS08,
author = {Nir Halman and
Chung{-}Lun Li and
David Simchi{-}Levi},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff
Problems in Series-Parallel Project Networks},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {91--103},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_8},
doi = {10.1007/978-3-540-85363-3\_8},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HalmanLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZhangGW08,
author = {Zhao Zhang and
Xiaofeng Gao and
Weili Wu},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Polynomial Time Approximation Scheme for Connected Vertex Cover in
Unit Disk Graph},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {255--264},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_24},
doi = {10.1007/978-3-540-85097-7\_24},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ZhangGW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorradaileKM08,
author = {Glencora Borradaile and
Philip N. Klein and
Claire Mathieu},
title = {A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {115--124},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.59},
doi = {10.1109/FOCS.2008.59},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorradaileKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccad/HuLA08,
author = {Shiyan Hu and
Zhuo Li and
Charles J. Alpert},
editor = {Sani R. Nassif and
Jaijeet S. Roychowdhury},
title = {A polynomial time approximation scheme for timing constrained minimum
cost layer assignment},
booktitle = {2008 International Conference on Computer-Aided Design, {ICCAD} 2008,
San Jose, CA, USA, November 10-13, 2008},
pages = {112--115},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/ICCAD.2008.4681560},
doi = {10.1109/ICCAD.2008.4681560},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iccad/HuLA08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenS08,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {A Polynomial Time Approximation Scheme for the Square Packing Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {184--198},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_13},
doi = {10.1007/978-3-540-68891-4\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalmanKLOS08,
author = {Nir Halman and
Diego Klabjan and
Chung{-}Lun Li and
James B. Orlin and
David Simchi{-}Levi},
editor = {Shang{-}Hua Teng},
title = {Fully polynomial time approximation schemes for stochastic dynamic
programs},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {700--709},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347159},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HalmanKLOS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/HickeyCMZ08,
author = {Glenn Hickey and
Paz Carmi and
Anil Maheshwari and
Norbert Zeh},
editor = {Keith A. Crandall and
Jens Lagergren},
title = {{NAPX:} {A} Polynomial Time Approximation Scheme for the Noah's Ark
Problem},
booktitle = {Algorithms in Bioinformatics, 8th International Workshop, {WABI} 2008,
Karlsruhe, Germany, September 15-19, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5251},
pages = {76--86},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87361-7\_7},
doi = {10.1007/978-3-540-87361-7\_7},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/HickeyCMZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-1661,
author = {Glenn Hickey and
Paz Carmi and
Anil Maheshwari and
Norbert Zeh},
title = {{NAPX:} {A} Polynomial Time Approximation Scheme for the Noah's Ark
Problem},
journal = {CoRR},
volume = {abs/0805.1661},
year = {2008},
url = {http://arxiv.org/abs/0805.1661},
eprinttype = {arXiv},
eprint = {0805.1661},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-1661.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-1595,
author = {Aparna Das and
Claire Mathieu},
title = {A quasi-polynomial time approximation scheme for Euclidean capacitated
vehicle routing},
journal = {CoRR},
volume = {abs/0812.1595},
year = {2008},
url = {http://arxiv.org/abs/0812.1595},
eprinttype = {arXiv},
eprint = {0812.1595},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-1595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenHKX07,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
title = {Polynomial time approximation schemes and parameterized complexity},
journal = {Discret. Appl. Math.},
volume = {155},
number = {2},
pages = {180--193},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.04.040},
doi = {10.1016/J.DAM.2006.04.040},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenHKX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JonssonKK07,
author = {Peter Jonsson and
Andrei A. Krokhin and
Fredrik Kuivinen},
editor = {Volker Diekert and
Mikhail V. Volkov and
Andrei Voronkov},
title = {Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint
Satisfaction Problems},
booktitle = {Computer Science - Theory and Applications, Second International Symposium
on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
3-7, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4649},
pages = {182--193},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74510-5\_20},
doi = {10.1007/978-3-540-74510-5\_20},
timestamp = {Thu, 09 Nov 2023 20:20:35 +0100},
biburl = {https://dblp.org/rec/conf/csr/JonssonKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/Hauptmann07a,
author = {Mathias Hauptmann},
editor = {Giuseppe F. Italiano and
Eugenio Moggi and
Luigi Laura},
title = {The Measure Hypothesis and Efficiency of Polynomial Time Approximation
Schemes},
booktitle = {Theoretical Computer Science, 10th Italian Conference, {ICTCS} 2007,
Rome, Italy, October 3-5, 2007, Proceedings},
pages = {151--162},
publisher = {World Scientific},
year = {2007},
timestamp = {Wed, 11 Jun 2008 08:55:26 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/Hauptmann07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorradaileKK07,
author = {Glencora Borradaile and
Claire Kenyon{-}Mathieu and
Philip N. Klein},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {A polynomial-time approximation scheme for Steiner tree in planar
graphs},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1285--1294},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283521},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/BorradaileKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ShachnaiT07,
author = {Hadas Shachnai and
Tami Tamir},
editor = {Teofilo F. Gonzalez},
title = {Polynomial-Time Approximation Schemes},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch9},
doi = {10.1201/9781420010749.CH9},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/ShachnaiT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ZhuMO07,
author = {An Zhu and
Rajeev Motwani and
Liadan O'Callaghan},
editor = {Teofilo F. Gonzalez},
title = {Asymptotic Polynomial-Time Approximation Schemes},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch11},
doi = {10.1201/9781420010749.CH11},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/ZhuMO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Breit06,
author = {Joachim Breit},
title = {A polynomial-time approximation scheme for the two-machine flow shop
scheduling problem with an availability constraint},
journal = {Comput. Oper. Res.},
volume = {33},
pages = {2143--2153},
year = {2006},
url = {https://doi.org/10.1016/j.cor.2005.01.004},
doi = {10.1016/J.COR.2005.01.004},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Breit06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiW06,
author = {Kang Li and
Lusheng Wang},
title = {A polynomial time approximation scheme for embedding a directed hypergraph
on a ring},
journal = {Inf. Process. Lett.},
volume = {97},
number = {5},
pages = {203--207},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.10.008},
doi = {10.1016/J.IPL.2005.10.008},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jec/FisherB06,
author = {Nathan Fisher and
Sanjoy K. Baruah},
title = {A fully polynomial-time approximation scheme for feasibility analysis
in static-priority systems with bounded relative deadlines},
journal = {J. Embed. Comput.},
volume = {2},
number = {3-4},
pages = {291--299},
year = {2006},
url = {http://content.iospress.com/articles/journal-of-embedded-computing/jec00068},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jec/FisherB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenP06,
author = {Klaus Jansen and
Lorant Porkolab},
title = {On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation
Schemes},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {3},
pages = {545--563},
year = {2006},
url = {https://doi.org/10.1137/S0895480101396949},
doi = {10.1137/S0895480101396949},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RemyS06,
author = {Jan Remy and
Angelika Steger},
editor = {Jon M. Kleinberg},
title = {A quasi-polynomial time approximation scheme for minimum weight triangulation},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {316--325},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132563},
doi = {10.1145/1132516.1132563},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RemyS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/XueX04,
author = {Guoliang Xue and
Wei Xiao},
title = {A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained
Multicast Tree under a Steiner Topology},
journal = {Algorithmica},
volume = {41},
number = {1},
pages = {53--72},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1119-9},
doi = {10.1007/S00453-004-1119-9},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/XueX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/Lev-TovP05,
author = {Nissan Lev{-}Tov and
David Peleg},
title = {Polynomial time approximation schemes for base station coverage with
minimum total radii},
journal = {Comput. Networks},
volume = {47},
number = {4},
pages = {489--501},
year = {2005},
url = {https://doi.org/10.1016/j.comnet.2004.08.012},
doi = {10.1016/J.COMNET.2004.08.012},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/Lev-TovP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK05,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {3},
pages = {713--728},
year = {2005},
url = {https://doi.org/10.1137/S0097539700382820},
doi = {10.1137/S0097539700382820},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ErlebachJS05,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
title = {Polynomial-Time Approximation Schemes for Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1302--1323},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402676},
doi = {10.1137/S0097539702402676},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ErlebachJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenKLS05,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas and
Eike Seidel},
title = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
and Geometric Graphs},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {1},
pages = {110--119},
year = {2005},
url = {https://doi.org/10.1137/S009753970139567X},
doi = {10.1137/S009753970139567X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JansenKLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecrts/FisherB05,
author = {Nathan Fisher and
Sanjoy K. Baruah},
title = {A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis
in Static-Priority Systems with Arbitrary Relative Deadlines},
booktitle = {17th Euromicro Conference on Real-Time Systems {(ECRTS} 2005), 6-8
July 2005, Palma de Mallorca, Spain, Proceedings},
pages = {117--126},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/ECRTS.2005.1},
doi = {10.1109/ECRTS.2005.1},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ecrts/FisherB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jansen04,
author = {Klaus Jansen},
title = {Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial
Time Approximation Scheme},
journal = {Algorithmica},
volume = {39},
number = {1},
pages = {59--81},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1078-6},
doi = {10.1007/S00453-003-1078-6},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BadgerKLTJ04,
author = {Jonathan H. Badger and
Paul E. Kearney and
Ming Li and
John Tsang and
Tao Jiang},
title = {Selecting the branches for an evolutionary tree.: {A} polynomial time
approximation scheme},
journal = {J. Algorithms},
volume = {51},
number = {1},
pages = {1--14},
year = {2004},
url = {https://doi.org/10.1016/S0196-6774(03)00086-5},
doi = {10.1016/S0196-6774(03)00086-5},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BadgerKLTJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HassinL04,
author = {Refael Hassin and
Asaf Levin},
title = {An efficient polynomial time approximation scheme for the constrained
minimum spanning tree problem using matroid intersection},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {2},
pages = {261--268},
year = {2004},
url = {https://doi.org/10.1137/S0097539703426775},
doi = {10.1137/S0097539703426775},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HassinL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChenHKX04,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Polynomial Time Approximation Schemes and Parameterized Complexity},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {500--512},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_38},
doi = {10.1007/978-3-540-28629-5\_38},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChenHKX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Chan03,
author = {Timothy M. Chan},
title = {Polynomial-time approximation schemes for packing and piercing fat
objects},
journal = {J. Algorithms},
volume = {46},
number = {2},
pages = {178--189},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(02)00294-8},
doi = {10.1016/S0196-6774(02)00294-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Chan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ChengHLWD03,
author = {Xiuzhen Cheng and
Xiao Huang and
Deying Li and
Weili Wu and
Ding{-}Zhu Du},
title = {A polynomial-time approximation scheme for the minimum-connected dominating
set in ad hoc wireless networks},
journal = {Networks},
volume = {42},
number = {4},
pages = {202--208},
year = {2003},
url = {https://doi.org/10.1002/net.10097},
doi = {10.1002/NET.10097},
timestamp = {Thu, 10 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/ChengHLWD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BazganVK03,
author = {Cristina Bazgan and
Wenceslas Fernandez de la Vega and
Marek Karpinski},
title = {Polynomial time approximation schemes for dense instances of minimum
constraint satisfaction},
journal = {Random Struct. Algorithms},
volume = {23},
number = {1},
pages = {73--91},
year = {2003},
url = {https://doi.org/10.1002/rsa.10072},
doi = {10.1002/RSA.10072},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BazganVK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Sviridenko03,
author = {Maxim Sviridenko},
title = {Makespan Minimization in No-Wait Flow Shops: {A} Polynomial Time Approximation
Scheme},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {2},
pages = {313--322},
year = {2003},
url = {https://doi.org/10.1137/S0895480100370803},
doi = {10.1137/S0895480100370803},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Sviridenko03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenS03,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {An asymptotic fully polynomial time approximation scheme for bin covering},
journal = {Theor. Comput. Sci.},
volume = {306},
number = {1-3},
pages = {543--551},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00363-3},
doi = {10.1016/S0304-3975(03)00363-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KubiakCK02,
author = {Wieslaw Kubiak and
Jinliang Cheng and
Mikhail Y. Kovalyov},
title = {Fast fully polynomial approximation schemes for minimizing completion
time variance},
journal = {Eur. J. Oper. Res.},
volume = {137},
number = {2},
pages = {303--309},
year = {2002},
url = {https://doi.org/10.1016/S0377-2217(01)00211-9},
doi = {10.1016/S0377-2217(01)00211-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KubiakCK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OstrovskyR02,
author = {Rafail Ostrovsky and
Yuval Rabani},
title = {Polynomial-time approximation schemes for geometric min-sum median
clustering},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {139--156},
year = {2002},
url = {https://doi.org/10.1145/506147.506149},
doi = {10.1145/506147.506149},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/OstrovskyR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Polynomial time approximation schemes for general multiprocessor job
shop scheduling},
journal = {J. Algorithms},
volume = {45},
number = {2},
pages = {167--191},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00248-1},
doi = {10.1016/S0196-6774(02)00248-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Wu02,
author = {Bang Ye Wu},
title = {A polynomial time approximation scheme for the two-source minimum
routing cost spanning trees},
journal = {J. Algorithms},
volume = {44},
number = {2},
pages = {359--378},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00205-5},
doi = {10.1016/S0196-6774(02)00205-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Wu02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/KimCCJ02,
author = {Joonmo Kim and
Mihaela Cardei and
Ionut Cardei and
Xiaohua Jia},
title = {A Polynomial Time Approximation Scheme for the Grade of Service Steiner
Minimum Tree Problem},
journal = {J. Glob. Optim.},
volume = {24},
number = {4},
pages = {437--448},
year = {2002},
url = {https://doi.org/10.1023/A:1021298822593},
doi = {10.1023/A:1021298822593},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/KimCCJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jansen02,
author = {Klaus Jansen},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time
Approximation Scheme},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {562--573},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_50},
doi = {10.1007/3-540-45749-6\_50},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Jansen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajLZ02,
author = {Artur Czumaj and
Andrzej Lingas and
Hairong Zhao},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Polynomial-Time Approximation Schemes for the Euclidean Survivable
Network Design Problem},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {973--984},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_83},
doi = {10.1007/3-540-45465-9\_83},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CzumajLZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icecsys/LiuZSK02,
author = {Jian Liu and
Ying Zhao and
Eugene Shragowitz and
George Karypis},
title = {A polynomial time approximation scheme for rectilinear Steiner minimum
tree construction in the presence of obstacles},
booktitle = {Proceedings of the 2002 9th {IEEE} International Conference on Electronics,
Circuits and Systems, {ICECS} 2002, Dubrovnik, Croatia, September
15-18, 2002},
pages = {781--784},
publisher = {{IEEE}},
year = {2002},
url = {https://doi.org/10.1109/ICECS.2002.1046286},
doi = {10.1109/ICECS.2002.1046286},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icecsys/LiuZSK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {William J. Cook and
Andreas S. Schulz},
title = {On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation
Schemes},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {329--349},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_24},
doi = {10.1007/3-540-47867-1\_24},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JansenS02,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Prosenjit Bose and
Pat Morin},
title = {An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {175--186},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_16},
doi = {10.1007/3-540-36136-7\_16},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/JansenS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205012,
author = {Claire Kenyon and
Nicolas Schabanel and
Neal E. Young},
title = {Polynomial-Time Approximation Scheme for Data Broadcast},
journal = {CoRR},
volume = {cs.DS/0205012},
year = {2002},
url = {https://arxiv.org/abs/cs/0205012},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-025,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon and
Yuval Rabani},
title = {Polynomial Time Approximation Schemes for Metric Min-Sum Clustering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-025}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-025/index.html},
eprinttype = {ECCC},
eprint = {TR02-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-041,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon},
title = {A Polynomial Time Approximation Scheme for Metric {MIN-BISECTION}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-041}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-041/index.html},
eprinttype = {ECCC},
eprint = {TR02-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-044,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski},
title = {A Polynomial Time Approximation Scheme for Subdense {MAX-CUT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-044}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-044/index.html},
eprinttype = {ECCC},
eprint = {TR02-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Karpinski01,
author = {Marek Karpinski},
title = {Polynomial Time Approximation Schemes for Some Dense Instances of
NP-Hard Optimization Problems},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {386--397},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0012-z},
doi = {10.1007/S00453-001-0012-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Karpinski01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChengKL01,
author = {Xiuzhen Cheng and
Joon{-}Mo Kim and
Bing Lu},
title = {A Polynomial Time Approximation Scheme for the Problem of Interconnecting
Highways},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {327--343},
year = {2001},
url = {https://doi.org/10.1023/A:1011497227406},
doi = {10.1023/A:1011497227406},
timestamp = {Thu, 10 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChengKL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/ChengDL01,
author = {Xiuzhen Cheng and
Bhaskar DasGupta and
Bing Lu},
title = {Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner
Arborescence Problem},
journal = {J. Glob. Optim.},
volume = {21},
number = {4},
pages = {385--396},
year = {2001},
url = {https://doi.org/10.1023/A:1012730702524},
doi = {10.1023/A:1012730702524},
timestamp = {Thu, 10 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/ChengDL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenM01,
author = {Jianer Chen and
Antonio Miranda},
title = {A Polynomial Time Approximation Scheme for General Multiprocessor
Job Scheduling},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {1},
pages = {1--17},
year = {2001},
url = {https://doi.org/10.1137/S0097539798348110},
doi = {10.1137/S0097539798348110},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/Karger01,
author = {David R. Karger},
title = {A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal
Network Reliability Problem},
journal = {{SIAM} Rev.},
volume = {43},
number = {3},
pages = {499--522},
year = {2001},
url = {https://doi.org/10.1137/S0036144501387141},
doi = {10.1137/S0036144501387141},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/Karger01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/GalotaGRV01,
author = {Matthias Galota and
Christian Gla{\ss}er and
Steffen Reith and
Heribert Vollmer},
title = {A polynomial-time approximation scheme for base station positioning
in {UMTS} networks},
booktitle = {Proceedings of the 5th International Workshop on Discrete Algorithms
and Methods for Mobile Computing and Communications {(DIAL-M} 2001),
Rome, Italy, July 21, 2001},
pages = {52--59},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/381448.381455},
doi = {10.1145/381448.381455},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dialm/GalotaGRV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DengFZZ01,
author = {Xiaotie Deng and
Haodi Feng and
Pixing Zhang and
Hong Zhu},
editor = {Peter Eades and
Tadao Takaoka},
title = {A Polynomial Time Approximation Scheme for Minimizing Total Completion
Time of Unbounded Batch Scheduling},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {26--35},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_3},
doi = {10.1007/3-540-45678-3\_3},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DengFZZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KarunoN01,
author = {Yoshiyuki Karuno and
Hiroshi Nagamochi},
editor = {Peter Eades and
Tadao Takaoka},
title = {A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling
Problem on a Path with Release and Handling Times},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {36--47},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_4},
doi = {10.1007/3-540-45678-3\_4},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KarunoN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachJS01,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
editor = {S. Rao Kosaraju},
title = {Polynomial-time approximation schemes for geometric graphs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {671--679},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365562},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ErlebachJS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenKLS01,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas and
Eike Seidel},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
and Geometric Graphs},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {365--375},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_32},
doi = {10.1007/3-540-44693-1\_32},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenKLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-034,
author = {Cristina Bazgan and
Wenceslas Fernandez de la Vega and
Marek Karpinski},
title = {Polynomial Time Approximation Schemes for Dense Instances of Minimum
Constraint Satisfaction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-034}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-034/index.html},
eprinttype = {ECCC},
eprint = {TR01-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Woeginger00,
author = {Gerhard J. Woeginger},
title = {When Does a Dynamic Programming Formulation Guarantee the Existence
of a Fully Polynomial Time Approximation Scheme (FPTAS)?},
journal = {{INFORMS} J. Comput.},
volume = {12},
number = {1},
pages = {57--74},
year = {2000},
url = {https://doi.org/10.1287/ijoc.12.1.57.11901},
doi = {10.1287/IJOC.12.1.57.11901},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Woeginger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WuCT00,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {A Polynomial Time Approximation Scheme for Optimal Product-Requirement
Communication Spanning Trees},
journal = {J. Algorithms},
volume = {36},
number = {2},
pages = {182--204},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1088},
doi = {10.1006/JAGM.2000.1088},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WuCT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LuR00,
author = {Bing Lu and
Lu Ruan},
title = {Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence
Problem},
journal = {J. Comb. Optim.},
volume = {4},
number = {3},
pages = {357--363},
year = {2000},
url = {https://doi.org/10.1023/A:1009826311973},
doi = {10.1023/A:1009826311973},
timestamp = {Fri, 01 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LuR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JiangKL00,
author = {Tao Jiang and
Paul E. Kearney and
Ming Li},
title = {A Polynomial Time Approximation Scheme for Inferring Evolutionary
Trees from Quartet Topologies and Its Application},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1942--1961},
year = {2000},
url = {https://doi.org/10.1137/S0097539799361683},
doi = {10.1137/S0097539799361683},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JiangKL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SchuurmanW00,
author = {Petra Schuurman and
Gerhard J. Woeginger},
title = {A polynomial time approximation scheme for the two-stage multiprocessor
flow shop problem},
journal = {Theor. Comput. Sci.},
volume = {237},
number = {1-2},
pages = {105--122},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00157-1},
doi = {10.1016/S0304-3975(98)00157-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SchuurmanW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OstrovskyR00,
author = {Rafail Ostrovsky and
Yuval Rabani},
title = {Polynomial Time Approximation Schemes for Geometric k-Clustering},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {349--358},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892123},
doi = {10.1109/SFCS.2000.892123},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/OstrovskyR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenS00,
author = {Klaus Jansen and
Maxim Sviridenko},
editor = {Horst Reichel and
Sophie Tison},
title = {Polynomial Time Approximation Schemes for the Multiprocessor Open
and Flow Shop Scheduling Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {455--465},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_38},
doi = {10.1007/3-540-46541-3\_38},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KenyonSY00,
author = {Claire Kenyon and
Nicolas Schabanel and
Neal E. Young},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Polynomial-time approximation scheme for data broadcast},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {659--666},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335398},
doi = {10.1145/335305.335398},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KenyonSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-064,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas},
title = {A Polynomial Time Approximation Scheme for {MAX-BISECTION} on Planar
Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-064}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-064/index.html},
eprinttype = {ECCC},
eprint = {TR00-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererP99,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {A New Fully Polynomial Time Approximation Scheme for the Knapsack
Problem},
journal = {J. Comb. Optim.},
volume = {3},
number = {1},
pages = {59--71},
year = {1999},
url = {https://doi.org/10.1023/A:1009813105532},
doi = {10.1023/A:1009813105532},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AroraKK99,
author = {Sanjeev Arora and
David R. Karger and
Marek Karpinski},
title = {Polynomial Time Approximation Schemes for Dense Instances of NP-Hard
Problems},
journal = {J. Comput. Syst. Sci.},
volume = {58},
number = {1},
pages = {193--210},
year = {1999},
url = {https://doi.org/10.1006/jcss.1998.1605},
doi = {10.1006/JCSS.1998.1605},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AroraKK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Karger99,
author = {David R. Karger},
title = {A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal
Network Reliability Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {492--514},
year = {1999},
url = {https://doi.org/10.1137/S0097539796298340},
doi = {10.1137/S0097539796298340},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Karger99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mitchell99,
author = {Joseph S. B. Mitchell},
title = {Guillotine Subdivisions Approximate Polygonal Subdivisions: {A} Simple
Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and
Related Problems},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {4},
pages = {1298--1309},
year = {1999},
url = {https://doi.org/10.1137/S0097539796309764},
doi = {10.1137/S0097539796309764},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Mitchell99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WuLBCRT99,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
title = {A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {761--778},
year = {1999},
url = {https://doi.org/10.1137/S009753979732253X},
doi = {10.1137/S009753979732253X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/WuLBCRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BazganV99,
author = {Cristina Bazgan and
Wenceslas Fernandez de la Vega},
editor = {Gabriel Ciobanu and
Gheorghe Paun},
title = {A Polynomial Time Approximation Scheme for Dense {MIN} 2SAT},
booktitle = {Fundamentals of Computation Theory, 12th International Symposium,
{FCT} '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1684},
pages = {91--99},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48321-7\_6},
doi = {10.1007/3-540-48321-7\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BazganV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/Kellerer99,
author = {Hans Kellerer},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {51--62},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_6},
doi = {10.1007/978-3-540-48413-4\_6},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/Kellerer99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenM99,
author = {Jianer Chen and
Antonio Miranda},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {A Polynomial Time Approximation Scheme for General Multiprocessor
Job Scheduling (Extended Abstract)},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {418--427},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301363},
doi = {10.1145/301250.301363},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenSS99,
author = {Klaus Jansen and
Roberto Solis{-}Oba and
Maxim Sviridenko},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Makespan Minimization in Job Shops: {A} Polynomial Time Approximation
Scheme},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {394--399},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301351},
doi = {10.1145/301250.301351},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Arora98,
author = {Sanjeev Arora},
title = {Polynomial Time Approximation Schemes for Euclidean Traveling Salesman
and other Geometric Problems},
journal = {J. {ACM}},
volume = {45},
number = {5},
pages = {753--782},
year = {1998},
url = {https://doi.org/10.1145/290179.290180},
doi = {10.1145/290179.290180},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Arora98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SevastianovW98,
author = {Sergey V. Sevastianov and
Gerhard J. Woeginger},
title = {Makespan minimization in open shops: {A} polynomial time approximation
scheme},
journal = {Math. Program.},
volume = {82},
pages = {191--198},
year = {1998},
url = {https://doi.org/10.1007/BF01585871},
doi = {10.1007/BF01585871},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/SevastianovW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CzumajL98,
author = {Artur Czumaj and
Andrzej Lingas},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {A Polynomial Time Approximation Scheme for Euclidean Minimum Cost
k-Connectivity},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {682--694},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055093},
doi = {10.1007/BFB0055093},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CzumajL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AroraGKKW98,
author = {Sanjeev Arora and
Michelangelo Grigni and
David R. Karger and
Philip N. Klein and
Andrzej Woloszyn},
editor = {Howard J. Karloff},
title = {A Polynomial-Time Approximation Scheme for Weighted Planar Graph {TSP}},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {33--41},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314632},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/AroraGKKW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/WuLBCRT98,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
editor = {Howard J. Karloff},
title = {A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {21--32},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314628},
timestamp = {Mon, 31 Aug 2015 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/WuLBCRT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sieling98,
author = {Detlef Sieling},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Existence of Polynomial Time Approximation Schemes for {OBDD}
Minimization (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {205--215},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028562},
doi = {10.1007/BFB0028562},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Sieling98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-001,
author = {Detlef Sieling},
title = {On the Existence of Polynomial Time Approximation Schemes for {OBDD}
Minimization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-001}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-001/index.html},
eprinttype = {ECCC},
eprint = {TR98-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bell/Khanna97,
author = {Sanjeev Khanna},
title = {A polynomial time approximation scheme for the {SONET} ring loading
problem},
journal = {Bell Labs Tech. J.},
volume = {2},
number = {2},
pages = {36--41},
year = {1997},
url = {https://doi.org/10.1002/bltj.2047},
doi = {10.1002/BLTJ.2047},
timestamp = {Thu, 27 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bell/Khanna97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CesatiT97,
author = {Marco Cesati and
Luca Trevisan},
title = {On the Efficiency of Polynomial Time Approximation Schemes},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {165--171},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00164-6},
doi = {10.1016/S0020-0190(97)00164-6},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CesatiT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Woeginger97,
author = {Gerhard J. Woeginger},
title = {A polynomial-time approximation scheme for maximizing the minimum
machine completion time},
journal = {Oper. Res. Lett.},
volume = {20},
number = {4},
pages = {149--154},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(96)00055-7},
doi = {10.1016/S0167-6377(96)00055-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Woeginger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MayrS97,
author = {Richard Mayr and
Annette Schelten},
editor = {Ernst W. Mayr and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger},
title = {Polynomial Time Approximation Schemes for Geometric Optimization Problems
in Euclidean Metric Spaces},
booktitle = {Lectures on Proof Verification and Approximation Algorithms. (the
book grow out of a Dagstuhl Seminar, April 21-25, 1997)},
series = {Lecture Notes in Computer Science},
volume = {1367},
pages = {313--324},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0053023},
doi = {10.1007/BFB0053023},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MayrS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KargerT97,
author = {David R. Karger and
Ray P. Tai},
editor = {Michael E. Saks},
title = {Implementing a Fully Polynomial Time Approximation Scheme for All
Terminal Network Reliability},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {334--343},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314316},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/KargerT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AsanoKTT97,
author = {Tetsuo Asano and
Naoki Katoh and
Hisao Tamaki and
Takeshi Tokuyama},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Covering Points in the Plane by \emph{k}-Tours: Towards a Polynomial
Time Approximation Scheme for General \emph{k}},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {275--283},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258602},
doi = {10.1145/258533.258602},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AsanoKTT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-001,
author = {Marco Cesati and
Luca Trevisan},
title = {On the Efficiency of Polynomial Time Approximation Schemes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-001}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-001/index.html},
eprinttype = {ECCC},
eprint = {TR97-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-024,
author = {Marek Karpinski},
title = {Polynomial Time Approximation Schemes for Some Dense Instances of
NP-Hard Optimization Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-024}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-024/index.html},
eprinttype = {ECCC},
eprint = {TR97-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Arora96,
author = {Sanjeev Arora},
title = {Polynomial Time Approximation Schemes for Euclidean {TSP} and Other
Geometric Problems},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {2--11},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548458},
doi = {10.1109/SFCS.1996.548458},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Arora96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-043,
author = {Edmund Ihler},
title = {On polynomial time approximation schemes and approximation preserving
reductions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-043}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-043/index.html},
eprinttype = {ECCC},
eprint = {TR96-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonFW95,
author = {Noga Alon and
Alan M. Frieze and
Dominic Welsh},
title = {Polynomial Time Randomized Approximation Schemes for Tutte-Gr{\"{o}}thendieck
Invariants: The Dense Case},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {459--478},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060409},
doi = {10.1002/RSA.3240060409},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AlonFW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraKK95,
author = {Sanjeev Arora and
David R. Karger and
Marek Karpinski},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Polynomial time approximation schemes for dense instances of \emph{NP}-hard
problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {284--293},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225140},
doi = {10.1145/225058.225140},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AroraKK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karger95,
author = {David R. Karger},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {A randomized fully polynomial time approximation scheme for the all
terminal network reliability problem},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {11--17},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225069},
doi = {10.1145/225058.225069},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Karger95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-005,
author = {Noga Alon and
Alan M. Frieze and
Dominic Welsh},
title = {Polynomial Time Randomised Approximation Schemes for Tutte-Gr{\"{o}}thendieck
Invariants: The Dense Case},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR94-005}},
year = {1994},
url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-005/index.html},
eprinttype = {ECCC},
eprint = {TR94-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Katoh92a,
author = {Naoki Katoh},
title = {A fully polynomial time approximation scheme for minimum cost-reliability
ratio problems},
journal = {Discret. Appl. Math.},
volume = {35},
number = {2},
pages = {143--155},
year = {1992},
url = {https://doi.org/10.1016/0166-218X(92)90038-C},
doi = {10.1016/0166-218X(92)90038-C},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Katoh92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fischetti90,
author = {Matteo Fischetti},
title = {A new linear storage, polynomial-time approximation scheme for the
subset-sum problem},
journal = {Discret. Appl. Math.},
volume = {26},
number = {1},
pages = {61--77},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90021-4},
doi = {10.1016/0166-218X(90)90021-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Fischetti90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-09-26 21:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
