Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "2-approximation algorithm"
download as .bib file
@article{DBLP:journals/jco/GuoL24,
author = {Yingying Guo and
Qiaoliang Li},
title = {Approximation algorithms for the fault-tolerant facility location
problem with submodular penalties},
journal = {J. Comb. Optim.},
volume = {47},
number = {2},
pages = {14},
year = {2024},
url = {https://doi.org/10.1007/s10878-024-01106-0},
doi = {10.1007/S10878-024-01106-0},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuoL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jifs/LongLW24,
author = {Zuqiang Long and
Zelong Luo and
Yunmeng Wang},
title = {Structure analysis and universal approximation of {IT2} {TS} {FLC}
using {NT} algorithm},
journal = {J. Intell. Fuzzy Syst.},
volume = {46},
number = {2},
pages = {4859--4867},
year = {2024},
url = {https://doi.org/10.3233/jifs-231866},
doi = {10.3233/JIFS-231866},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jifs/LongLW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbboudB24,
author = {Amir Abboud and
Greg Bodwin},
title = {Reachability Preservers: New Extremal Bounds and Approximation Algorithms},
journal = {{SIAM} J. Comput.},
volume = {53},
number = {2},
pages = {221--246},
year = {2024},
url = {https://doi.org/10.1137/21m1442176},
doi = {10.1137/21M1442176},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AbboudB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/BuchheimGM24a,
author = {Christoph Buchheim and
Alexandra Gr{\"{u}}tering and
Christian Meyer},
title = {Parabolic Optimal Control Problems with Combinatorial Switching Constraints,
Part {II:} Outer Approximation Algorithm},
journal = {{SIAM} J. Optim.},
volume = {34},
number = {2},
pages = {1295--1315},
year = {2024},
url = {https://doi.org/10.1137/22m1490284},
doi = {10.1137/22M1490284},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/BuchheimGM24a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/XuAKS24,
author = {Tianshi Xu and
Anthony Austin and
Vasileios Kalantzis and
Yousef Saad},
title = {A Parallel Algorithm for Computing Partial Spectral Factorizations
of Matrix Pencils via Chebyshev Approximation},
journal = {{SIAM} J. Sci. Comput.},
volume = {46},
number = {2},
pages = {S324--S351},
year = {2024},
url = {https://doi.org/10.1137/22m1501155},
doi = {10.1137/22M1501155},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/XuAKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/Ciesielski24,
author = {Mariusz Ciesielski},
title = {Numerical Algorithms for Approximation of Fractional Integrals and
Derivatives Based on Quintic Spline Interpolation},
journal = {Symmetry},
volume = {16},
number = {2},
pages = {252},
year = {2024},
url = {https://doi.org/10.3390/sym16020252},
doi = {10.3390/SYM16020252},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/Ciesielski24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-16225,
author = {Diego F. G. Coelho and
Renato J. Cintra},
title = {Discrete Fourier Transform Approximations Based on the Cooley-Tukey
Radix-2 Algorithm},
journal = {CoRR},
volume = {abs/2402.16225},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.16225},
doi = {10.48550/ARXIV.2402.16225},
eprinttype = {arXiv},
eprint = {2402.16225},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-16225.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-06686,
author = {Junyoung Kim and
Kyungsik Lee},
title = {Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained
binary knapsack problem},
journal = {CoRR},
volume = {abs/2403.06686},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.06686},
doi = {10.48550/ARXIV.2403.06686},
eprinttype = {arXiv},
eprint = {2403.06686},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-06686.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-11811,
author = {Md. Musfiqur Rahman Sanim and
Safrunnesa Saira and
Fatin Faiaz Ahsan and
Rajon Bardhan and
S. M. Ferdous},
title = {A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem},
journal = {CoRR},
volume = {abs/2403.11811},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.11811},
doi = {10.48550/ARXIV.2403.11811},
eprinttype = {arXiv},
eprint = {2403.11811},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-11811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalvezGAJKR23,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Klaus Jansen and
Arindam Khan and
Malin Rau},
title = {A Tight (3/2+{\(\epsilon\)} )-Approximation for Skewed Strip Packing},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3088--3109},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01130-2},
doi = {10.1007/S00453-023-01130-2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalvezGAJKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FischerG23,
author = {David Fischer and
P{\'{e}}ter Gy{\"{o}}rgyi},
title = {Approximation algorithms for coupled task scheduling minimizing the
sum of completion times},
journal = {Ann. Oper. Res.},
volume = {328},
number = {2},
pages = {1387--1408},
year = {2023},
url = {https://doi.org/10.1007/s10479-023-05322-5},
doi = {10.1007/S10479-023-05322-5},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/FischerG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ChenNY23,
author = {Ciwen Chen and
Guyan Ni and
Bo Yang},
title = {Partially symmetric tensor structure preserving rank-R approximation
via {BFGS} algorithm},
journal = {Comput. Optim. Appl.},
volume = {85},
number = {2},
pages = {621--652},
year = {2023},
url = {https://doi.org/10.1007/s10589-023-00471-6},
doi = {10.1007/S10589-023-00471-6},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ChenNY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OnoY23,
author = {Hirotaka Ono and
Hisato Yamanaka},
title = {An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs},
journal = {Discret. Appl. Math.},
volume = {341},
pages = {93--101},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.07.012},
doi = {10.1016/J.DAM.2023.07.012},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OnoY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/JiangLP23,
author = {Xiaojuan Jiang and
Kangbok Lee and
Michael L. Pinedo},
title = {Approximation algorithms for bicriteria scheduling problems on identical
parallel machines for makespan and total completion time},
journal = {Eur. J. Oper. Res.},
volume = {305},
number = {2},
pages = {594--607},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.06.021},
doi = {10.1016/J.EJOR.2022.06.021},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/JiangLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/WuZC23,
author = {Fangfang Wu and
Xiandong Zhang and
Bo Chen},
title = {An improved approximation algorithm for scheduling monotonic moldable
tasks},
journal = {Eur. J. Oper. Res.},
volume = {306},
number = {2},
pages = {567--578},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.08.034},
doi = {10.1016/J.EJOR.2022.08.034},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/WuZC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijahuc/TalebBS23,
author = {Soumaya Ferhat Taleb and
Nour El{-}Houda Benalia and
Rabah Sadoun},
title = {Fitness approximation with {RF} algorithm dedicated to {WSN} node
deployment for a soil monitoring application},
journal = {Int. J. Ad Hoc Ubiquitous Comput.},
volume = {43},
number = {2},
pages = {72--86},
year = {2023},
url = {https://doi.org/10.1504/IJAHUC.2023.131359},
doi = {10.1504/IJAHUC.2023.131359},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijahuc/TalebBS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcgs/DongZL23,
author = {Tianning Dong and
Peiyi Zhang and
Faming Liang},
title = {A Stochastic Approximation-Langevinized Ensemble Kalman Filter Algorithm
for State Space Models with Unknown Parameters},
journal = {J. Comput. Graph. Stat.},
volume = {32},
number = {2},
pages = {448--469},
year = {2023},
url = {https://doi.org/10.1080/10618600.2022.2107531},
doi = {10.1080/10618600.2022.2107531},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcgs/DongZL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/CheWX23,
author = {Maolin Che and
Yimin Wei and
Yanwei Xu},
title = {Randomized algorithms for the computation of multilinear rank-({\(\mu\)}
\({}_{\mbox{1,{\(\mu\)}}}\) \({}_{\mbox{2,{\(\mu\)}}}\) \({}_{\mbox{3)}}\)
approximations},
journal = {J. Glob. Optim.},
volume = {87},
number = {2},
pages = {373--403},
year = {2023},
url = {https://doi.org/10.1007/s10898-022-01182-8},
doi = {10.1007/S10898-022-01182-8},
timestamp = {Thu, 23 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/CheWX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/HanXXY23,
author = {Lu Han and
Dachuan Xu and
Yicheng Xu and
Ping Yang},
title = {Approximation algorithms for the individually fair k-center with outliers},
journal = {J. Glob. Optim.},
volume = {87},
number = {2},
pages = {603--618},
year = {2023},
url = {https://doi.org/10.1007/s10898-022-01195-3},
doi = {10.1007/S10898-022-01195-3},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/HanXXY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LiZBW23,
author = {Qian Li and
Wei Zhang and
Yanqin Bai and
Guoqiang Wang},
title = {A non-convex piecewise quadratic approximation of {\(\mathscr{l}\)}
\({}_{\mbox{0}}\) regularization: theory and accelerated algorithm},
journal = {J. Glob. Optim.},
volume = {86},
number = {2},
pages = {323--353},
year = {2023},
url = {https://doi.org/10.1007/s10898-022-01257-6},
doi = {10.1007/S10898-022-01257-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LiZBW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jossac/XuCQ23,
author = {Gehui Xu and
Guanpu Chen and
Hongsheng Qi},
title = {Algorithm Design and Approximation Analysis on Distributed Robust
Game},
journal = {J. Syst. Sci. Complex.},
volume = {36},
number = {2},
pages = {480--499},
year = {2023},
url = {https://doi.org/10.1007/s11424-023-1436-1},
doi = {10.1007/S11424-023-1436-1},
timestamp = {Fri, 28 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jossac/XuCQ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/BarmannBHK23,
author = {Andreas B{\"{a}}rmann and
Robert Burlacu and
Lukas Hager and
Katja Kutzer},
title = {An Approximation Algorithm for Optimal Piecewise Linear Interpolations
of Bounded Variable Products},
journal = {J. Optim. Theory Appl.},
volume = {199},
number = {2},
pages = {569--599},
year = {2023},
url = {https://doi.org/10.1007/s10957-023-02292-3},
doi = {10.1007/S10957-023-02292-3},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jota/BarmannBHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/DongYQC23,
author = {Wandi Dong and
Gaohang Yu and
Liqun Qi and
Xiaohao Cai},
title = {Practical Sketching Algorithms for Low-Rank Tucker Approximation of
Large Tensors},
journal = {J. Sci. Comput.},
volume = {95},
number = {2},
pages = {52},
year = {2023},
url = {https://doi.org/10.1007/s10915-023-02172-y},
doi = {10.1007/S10915-023-02172-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jscic/DongYQC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AprileDFH23,
author = {Manuel Aprile and
Matthew Drescher and
Samuel Fiorini and
Tony Huynh},
title = {A tight approximation algorithm for the cluster vertex deletion problem},
journal = {Math. Program.},
volume = {197},
number = {2},
pages = {1069--1091},
year = {2023},
url = {https://doi.org/10.1007/s10107-021-01744-w},
doi = {10.1007/S10107-021-01744-W},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/AprileDFH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/OlverSSSZ23,
author = {Neil Olver and
Frans Schalekamp and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
title = {A duality based 2-approximation algorithm for maximum agreement forest},
journal = {Math. Program.},
volume = {198},
number = {1},
pages = {811--853},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01790-y},
doi = {10.1007/S10107-022-01790-Y},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/OlverSSSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/HouL23,
author = {Zhisong Hou and
Sanyang Liu},
title = {Global algorithm for a class of multiplicative programs using piecewise
linear approximation technique},
journal = {Numer. Algorithms},
volume = {92},
number = {2},
pages = {1063--1082},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01330-x},
doi = {10.1007/S11075-022-01330-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/HouL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Mildebrath23,
author = {David T. Mildebrath},
title = {A polynomial-time algorithm for a nonconvex chance-constrained program
under the normal approximation},
journal = {Optim. Lett.},
volume = {17},
number = {2},
pages = {265--282},
year = {2023},
url = {https://doi.org/10.1007/s11590-022-01905-6},
doi = {10.1007/S11590-022-01905-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Mildebrath23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/TrejoSanchezMFLF23,
author = {Joel Antonio Trejo{-}S{\'{a}}nchez and
Francisco Alejandro Madera{-}Ram{\'{\i}}rez and
Jos{\'{e}} Alberto Fern{\'{a}}ndez{-}Zepeda and
Jos{\'{e}} Luis L{\'{o}}pez{-}Mart{\'{\i}}nez and
Alejandro Flores{-}Lamas},
title = {A fast approximation algorithm for the maximum 2-packing set problem
on planar graphs},
journal = {Optim. Lett.},
volume = {17},
number = {6},
pages = {1435--1454},
year = {2023},
url = {https://doi.org/10.1007/s11590-022-01939-w},
doi = {10.1007/S11590-022-01939-W},
timestamp = {Sun, 19 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/TrejoSanchezMFLF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WuCYC23,
author = {Jun Wu and
Yongxi Cheng and
Zhen Yang and
Feng Chu},
title = {A 3/2-approximation algorithm for the multiple Hamiltonian path problem
with no prefixed endpoints},
journal = {Oper. Res. Lett.},
volume = {51},
number = {5},
pages = {473--476},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.07.003},
doi = {10.1016/J.ORL.2023.07.003},
timestamp = {Sun, 24 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/WuCYC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/FreitasAN23,
author = {Jo{\~{a}}o Victor B. de Freitas and
Caio L. N. Azevedo and
Juv{\^{e}}ncio S. Nobre},
title = {A stochastic approximation {ECME} algorithm to semi-parametric scale
mixtures of centred skew normal regression models},
journal = {Stat. Comput.},
volume = {33},
number = {2},
pages = {51},
year = {2023},
url = {https://doi.org/10.1007/s11222-023-10223-5},
doi = {10.1007/S11222-023-10223-5},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sac/FreitasAN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JayaprakashS23,
author = {Aditya Jayaprakash and
Mohammad R. Salavatipour},
title = {Approximation Schemes for Capacitated Vehicle Routing on Graphs of
Bounded Treewidth, Bounded Doubling, or Highway Dimension},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {2},
pages = {20:1--20:36},
year = {2023},
url = {https://doi.org/10.1145/3582500},
doi = {10.1145/3582500},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/JayaprakashS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Civril23,
author = {Ali {\c{C}}ivril},
title = {A new approximation algorithm for the minimum 2-edge-connected spanning
subgraph problem},
journal = {Theor. Comput. Sci.},
volume = {943},
pages = {121--130},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.12.013},
doi = {10.1016/J.TCS.2022.12.013},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Civril23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Civril23a,
author = {Ali {\c{C}}ivril},
title = {Corrigendum to "A new approximation algorithm for the minimum 2-edge-connected
spanning subgraph problem" [Theor. Comput. Sci. 943 {(2023)} 121-130]},
journal = {Theor. Comput. Sci.},
volume = {963},
pages = {113926},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.113926},
doi = {10.1016/J.TCS.2023.113926},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Civril23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/theoretics/00010J023,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
title = {A simple polynomial-time approximation algorithm for the total variation
distance between two product distributions},
journal = {TheoretiCS},
volume = {2},
year = {2023},
url = {https://doi.org/10.46298/theoretics.23.7},
doi = {10.46298/THEORETICS.23.7},
timestamp = {Mon, 19 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/theoretics/00010J023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AsahiroEG0LMOT23,
author = {Yuichi Asahiro and
Hiroshi Eto and
Mingyang Gong and
Jesper Jansson and
Guohui Lin and
Eiji Miyano and
Hirotaka Ono and
Shunichi Tanaka},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Approximation Algorithms for the Longest Run Subsequence Problem},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {2:1--2:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.2},
doi = {10.4230/LIPICS.CPM.2023.2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AsahiroEG0LMOT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001M023,
author = {Fabrizio Grandoni and
Claire Mathieu and
Hang Zhou},
editor = {Yael Tauman Kalai},
title = {Unsplittable Euclidean Capacitated Vehicle Routing: {A} (2+{\(\epsilon\)})-Approximation
Algorithm},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {63:1--63:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.63},
doi = {10.4230/LIPICS.ITCS.2023.63},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001M023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KarlinKG23,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {A Deterministic Better-than-3/2 Approximation Algorithm for Metric
{TSP}},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {261--274},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_19},
doi = {10.1007/978-3-031-32726-1\_19},
timestamp = {Fri, 26 May 2023 10:40:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KarlinKG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ZhuL23,
author = {Yunzhang Zhu and
Renxiong Liu},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Path following algorithms for {\unicode{120001}}\({}_{\mbox{2}}\)-regularized
M-estimation with approximation guarantee},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/00296c0e10cd24d415c2db63ea2a2c68-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/ZhuL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BreenMWW23,
author = {Emmett Breen and
Renee Mirka and
Zichen Wang and
David P. Williamson},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Revisiting Garg's 2-Approximation Algorithm for the \emph{k}-MST Problem
in Graphs},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {56--68},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch6},
doi = {10.1137/1.9781611977585.CH6},
timestamp = {Mon, 20 Mar 2023 16:52:56 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BreenMWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-05398,
author = {Ali {\c{C}}ivril},
title = {An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected
Spanning Subgraph Problem},
journal = {CoRR},
volume = {abs/2305.05398},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.05398},
doi = {10.48550/ARXIV.2305.05398},
eprinttype = {arXiv},
eprint = {2305.05398},
timestamp = {Mon, 15 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-05398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-01867,
author = {Emmett Breen and
Renee Mirka and
Zichen Wang and
David P. Williamson},
title = {Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem
in Graphs},
journal = {CoRR},
volume = {abs/2306.01867},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.01867},
doi = {10.48550/ARXIV.2306.01867},
eprinttype = {arXiv},
eprint = {2306.01867},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-01867.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-08270,
author = {Zeev Nutov},
title = {Extending the primal-dual 2-approximation algorithm beyond uncrossable
set families},
journal = {CoRR},
volume = {abs/2307.08270},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.08270},
doi = {10.48550/ARXIV.2307.08270},
eprinttype = {arXiv},
eprint = {2307.08270},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-08270.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-04327,
author = {Sepideh Aghamolaei and
Mohammad Ghodsi},
title = {A 2-Approximation Algorithm for Data-Distributed Metric k-Center},
journal = {CoRR},
volume = {abs/2309.04327},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.04327},
doi = {10.48550/ARXIV.2309.04327},
eprinttype = {arXiv},
eprint = {2309.04327},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-04327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-02592,
author = {Yuga Kanaya and
Kenjiro Takazawa},
title = {A Faster Deterministic Approximation Algorithm for {TTP-2}},
journal = {CoRR},
volume = {abs/2310.02592},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.02592},
doi = {10.48550/ARXIV.2310.02592},
eprinttype = {arXiv},
eprint = {2310.02592},
timestamp = {Thu, 19 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-02592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonS22,
author = {Noga Alon and
Clara Shikhelman},
title = {Additive Approximation of Generalized Tur{\'{a}}n Questions},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {464--481},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00899-4},
doi = {10.1007/S00453-021-00899-4},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlonS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Levin22,
author = {Asaf Levin},
title = {Approximation Schemes for the Generalized Extensible Bin Packing Problem},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {325--343},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00895-8},
doi = {10.1007/S00453-021-00895-8},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Levin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PedrosaR22,
author = {Lehilton Lelis Chaves Pedrosa and
Hugo Kooki Kasuya Rosado},
title = {A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3522--3558},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00919-3},
doi = {10.1007/S00453-021-00919-3},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PedrosaR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/PitolliSP22,
author = {Francesca Pitolli and
Chiara Sorgentone and
Enza Pellegrino},
title = {Approximation of the Riesz-Caputo Derivative by Cubic Splines},
journal = {Algorithms},
volume = {15},
number = {2},
pages = {69},
year = {2022},
url = {https://doi.org/10.3390/a15020069},
doi = {10.3390/A15020069},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/PitolliSP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/MeloFR22,
author = {Wendel Melo and
Marcia Fampa and
Fernanda M. P. Raupp},
title = {Two linear approximation algorithms for convex mixed integer nonlinear
programming},
journal = {Ann. Oper. Res.},
volume = {316},
number = {2},
pages = {1471--1491},
year = {2022},
url = {https://doi.org/10.1007/s10479-020-03722-5},
doi = {10.1007/S10479-020-03722-5},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/MeloFR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ArdizzoniCLL22,
author = {Stefano Ardizzoni and
Luca Consolini and
Mattia Laurini and
Marco Locatelli},
title = {Shortest path with acceleration constraints: complexity and approximation
algorithms},
journal = {Comput. Optim. Appl.},
volume = {83},
number = {2},
pages = {555--592},
year = {2022},
url = {https://doi.org/10.1007/s10589-022-00403-w},
doi = {10.1007/S10589-022-00403-W},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ArdizzoniCLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Al-HerzP22,
author = {Ahmed Al{-}Herz and
Alex Pothen},
title = {A 2/3-approximation algorithm for vertex-weighted matching},
journal = {Discret. Appl. Math.},
volume = {308},
pages = {46--67},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2019.09.013},
doi = {10.1016/J.DAM.2019.09.013},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Al-HerzP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BelgiN22,
author = {Amir Belgi and
Zeev Nutov},
title = {A polylogarithmic approximation algorithm for 2-edge-connected dominating
set},
journal = {Inf. Process. Lett.},
volume = {173},
pages = {106175},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106175},
doi = {10.1016/J.IPL.2021.106175},
timestamp = {Mon, 11 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BelgiN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Ravelo22,
author = {Santiago Vald{\'{e}}s Ravelo},
title = {Approximation algorithms for simple assembly line balancing problems},
journal = {J. Comb. Optim.},
volume = {43},
number = {2},
pages = {432--443},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00778-2},
doi = {10.1007/S10878-021-00778-2},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Ravelo22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangX22,
author = {Tongli Zhang and
Yong Xia},
title = {Comment on "Approximation algorithms for quadratic programming"},
journal = {J. Comb. Optim.},
volume = {44},
number = {2},
pages = {1099--1103},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00881-y},
doi = {10.1007/S10878-022-00881-Y},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelbasiF22,
author = {Mahdi Belbasi and
Martin F{\"{u}}rer},
title = {An Improvement of Reed's Treewidth Approximation},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {257--282},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00593},
doi = {10.7155/JGAA.00593},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelbasiF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biniaz22a,
author = {Ahmad Biniaz},
title = {Better approximation algorithms for maximum weight internal spanning
trees in cubic graphs and claw-free graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {209--224},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00590},
doi = {10.7155/JGAA.00590},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Biniaz22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/EichfelderW22,
author = {Gabriele Eichfelder and
Leo Warnow},
title = {An approximation algorithm for multi-objective optimization problems
using a box-coverage},
journal = {J. Glob. Optim.},
volume = {83},
number = {2},
pages = {329--357},
year = {2022},
url = {https://doi.org/10.1007/s10898-021-01109-9},
doi = {10.1007/S10898-021-01109-9},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/EichfelderW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/MarchettiP22,
author = {Francesco Marchetti and
Emma Perracchione},
title = {Efficient Reduced Basis Algorithm {(ERBA)} for Kernel-Based Approximation},
journal = {J. Sci. Comput.},
volume = {91},
number = {2},
pages = {41},
year = {2022},
url = {https://doi.org/10.1007/s10915-022-01818-7},
doi = {10.1007/S10915-022-01818-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jscic/MarchettiP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/NikolovST22,
author = {Aleksandar Nikolov and
Mohit Singh and
Uthaipon Tao Tantipongpipat},
title = {Proportional Volume Sampling and Approximation Algorithms for A-Optimal
Design},
journal = {Math. Oper. Res.},
volume = {47},
number = {2},
pages = {847--877},
year = {2022},
url = {https://doi.org/10.1287/moor.2021.1129},
doi = {10.1287/MOOR.2021.1129},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/NikolovST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/TraubT22,
author = {Vera Traub and
Thorben Tr{\"{o}}bst},
title = {A fast {\textdollar}(2 + {\textbackslash}frac\{2\}\{7\}){\textdollar}-approximation
algorithm for capacitated cycle covering},
journal = {Math. Program.},
volume = {192},
number = {1},
pages = {497--518},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01678-3},
doi = {10.1007/S10107-021-01678-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/TraubT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/RenXDL22,
author = {Chunying Ren and
Dachuan Xu and
Donglei Du and
Min Li},
title = {An improved primal-dual approximation algorithm for the k-means problem
with penalties},
journal = {Math. Struct. Comput. Sci.},
volume = {32},
number = {2},
pages = {151--163},
year = {2022},
url = {https://doi.org/10.1017/S0960129521000104},
doi = {10.1017/S0960129521000104},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/RenXDL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/GrapigliaGS22,
author = {Geovani Nunes Grapiglia and
Max L. N. Gon{\c{c}}alves and
G. N. Silva},
title = {A cubic regularization of Newton's method with finite difference Hessian
approximations},
journal = {Numer. Algorithms},
volume = {90},
number = {2},
pages = {607--630},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01200-y},
doi = {10.1007/S11075-021-01200-Y},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/GrapigliaGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/SongHGL22,
author = {Guoting Song and
Junhao Hu and
Shuaibin Gao and
Xiaoyue Li},
title = {The strong convergence and stability of explicit approximations for
nonlinear stochastic delay differential equations},
journal = {Numer. Algorithms},
volume = {89},
number = {2},
pages = {855--883},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01137-2},
doi = {10.1007/S11075-021-01137-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/SongHGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GhalamiG22,
author = {Laleh Ghalami and
Daniel Grosu},
title = {Approximation algorithms for Steiner forest: An experimental study},
journal = {Networks},
volume = {79},
number = {2},
pages = {164--188},
year = {2022},
url = {https://doi.org/10.1002/net.22046},
doi = {10.1002/NET.22046},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GhalamiG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/RanHZD22,
author = {Yingli Ran and
Xiaohui Huang and
Zhao Zhang and
Ding{-}Zhu Du},
title = {Approximation algorithm for minimum partial multi-cover under a geometric
setting},
journal = {Optim. Lett.},
volume = {16},
number = {2},
pages = {667--680},
year = {2022},
url = {https://doi.org/10.1007/s11590-021-01746-9},
doi = {10.1007/S11590-021-01746-9},
timestamp = {Fri, 25 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/RanHZD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/or/Borgwardt22,
author = {Steffen Borgwardt},
title = {An LP-based, strongly-polynomial 2-approximation algorithm for sparse
Wasserstein barycenters},
journal = {Oper. Res.},
volume = {22},
number = {2},
pages = {1511--1551},
year = {2022},
url = {https://doi.org/10.1007/s12351-020-00589-z},
doi = {10.1007/S12351-020-00589-Z},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/or/Borgwardt22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FukunagaRRT22,
author = {Takuro Fukunaga and
R. Ravi and
Oleksandr Rudenko and
Ziye Tang},
title = {Approximation algorithm for the 2-stage stochastic matroid base problem},
journal = {Oper. Res. Lett.},
volume = {50},
number = {2},
pages = {129--132},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.01.004},
doi = {10.1016/J.ORL.2022.01.004},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FukunagaRRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KrumkeM22,
author = {Sven O. Krumke and
Le Huy Minh},
title = {2-approximation algorithm for minmax absolute maximum lateness scheduling-location
problem},
journal = {Oper. Res. Lett.},
volume = {50},
number = {6},
pages = {732--737},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.11.001},
doi = {10.1016/J.ORL.2022.11.001},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KrumkeM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Takazawa22,
author = {Yotaro Takazawa},
title = {Approximation algorithm for the stochastic prize-collecting set multicover
problem},
journal = {Oper. Res. Lett.},
volume = {50},
number = {2},
pages = {224--228},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.02.003},
doi = {10.1016/J.ORL.2022.02.003},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Takazawa22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BoydCCGISW22,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Robert Cummings and
Logan Grout and
Sharat Ibrahimpur and
Zolt{\'{a}}n Szigeti and
Lu Wang},
title = {A {\textdollar}{\textbackslash}frac\{4\}\{3\}{\textdollar}-Approximation
Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in
the Half-Integral Case},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1730--1747},
year = {2022},
url = {https://doi.org/10.1137/20m1372822},
doi = {10.1137/20M1372822},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BoydCCGISW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spl/PortellaCBMC22,
author = {Luan Portella and
Diego F. G. Coelho and
F{\'{a}}bio M. Bayer and
Arjuna Madanayake and
Renato J. Cintra},
title = {Radix-{\textdollar}N{\textdollar} Algorithm for Computing {\textdollar}N\{2\{n\}\}{\textdollar}-Point
{DFT} Approximations},
journal = {{IEEE} Signal Process. Lett.},
volume = {29},
pages = {1838--1842},
year = {2022},
url = {https://doi.org/10.1109/LSP.2022.3200573},
doi = {10.1109/LSP.2022.3200573},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spl/PortellaCBMC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/Wong22,
author = {Tzu{-}Tsung Wong},
title = {Linear Approximation of F-Measure for the Performance Evaluation of
Classification Algorithms on Imbalanced Data Sets},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {34},
number = {2},
pages = {753--763},
year = {2022},
url = {https://doi.org/10.1109/TKDE.2020.2986749},
doi = {10.1109/TKDE.2020.2986749},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tkde/Wong22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnsm/TsigkariS22,
author = {Dimitra Tsigkari and
Thrasyvoulos Spyropoulos},
title = {An Approximation Algorithm for Joint Caching and Recommendations in
Cache Networks},
journal = {{IEEE} Trans. Netw. Serv. Manag.},
volume = {19},
number = {2},
pages = {1826--1841},
year = {2022},
url = {https://doi.org/10.1109/TNSM.2022.3150961},
doi = {10.1109/TNSM.2022.3150961},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnsm/TsigkariS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nctcs/Lan22,
author = {Huan Lan},
editor = {Zhiping Cai and
Yijia Chen and
Jialin Zhang},
title = {A 1/2 Approximation Algorithm for Energy-Constrained Geometric Coverage
Problem},
booktitle = {Theoretical Computer Science - 40th National Conference, {NCTCS} 2022,
Changchun, China, July 29-31, 2022, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {1693},
pages = {105--114},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-981-19-8152-4\_7},
doi = {10.1007/978-981-19-8152-4\_7},
timestamp = {Tue, 13 Dec 2022 15:09:40 +0100},
biburl = {https://dblp.org/rec/conf/nctcs/Lan22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-05520,
author = {Fabrizio Grandoni and
Claire Mathieu and
Hang Zhou},
title = {Unsplittable Euclidean Capacitated Vehicle Routing: {A} (2+{\(\epsilon\)})-Approximation
Algorithm},
journal = {CoRR},
volume = {abs/2209.05520},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.05520},
doi = {10.48550/ARXIV.2209.05520},
eprinttype = {arXiv},
eprint = {2209.05520},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-05520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-09844,
author = {Azzam Habib},
title = {Performance evaluation of approximation algorithms for the minimum
size 2-vertex strongly connected subgraph problem},
journal = {CoRR},
volume = {abs/2210.09844},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.09844},
doi = {10.48550/ARXIV.2210.09844},
eprinttype = {arXiv},
eprint = {2210.09844},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-09844.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FerraioliV21,
author = {Diodato Ferraioli and
Carmine Ventre},
title = {Approximation Guarantee of {OSP} Mechanisms: The Case of Machine Scheduling
and Facility Location},
journal = {Algorithmica},
volume = {83},
number = {2},
pages = {695--725},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00771-x},
doi = {10.1007/S00453-020-00771-X},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FerraioliV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/FaragoM21,
author = {Andr{\'{a}}s Farag{\'{o}} and
Zohre R. Mojaveri},
title = {Safe Approximation - An Efficient Solution for a Hard Routing Problem},
journal = {Algorithms},
volume = {14},
number = {2},
pages = {48},
year = {2021},
url = {https://doi.org/10.3390/a14020048},
doi = {10.3390/A14020048},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/FaragoM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/HuckeR21,
author = {Danny Hucke and
Carl Philipp Reh},
title = {Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings},
journal = {Algorithms},
volume = {14},
number = {2},
pages = {65},
year = {2021},
url = {https://doi.org/10.3390/a14020065},
doi = {10.3390/A14020065},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/HuckeR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computation/MorozSH21,
author = {Leonid V. Moroz and
Volodymyr Samotyy and
Oleh Horyachyy},
title = {Modified Fast Inverse Square Root and Square Root Approximation Algorithms:
The Method of Switching Magic Constants},
journal = {Comput.},
volume = {9},
number = {2},
pages = {21},
year = {2021},
url = {https://doi.org/10.3390/computation9020021},
doi = {10.3390/COMPUTATION9020021},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computation/MorozSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/SaikiaKP21,
author = {Parikshit Saikia and
Sushanta Karmakar and
Aris Pagourtzis},
title = {Primal-dual based distributed approximation algorithm for Prize-collecting
Steiner tree},
journal = {Discret. Math. Algorithms Appl.},
volume = {13},
number = {2},
pages = {2150008:1--2150008:48},
year = {2021},
url = {https://doi.org/10.1142/S1793830921500087},
doi = {10.1142/S1793830921500087},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/SaikiaKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/SoleimaniSA21,
author = {Effat Soleimani and
Hazhir Saberi and
Niloofar Ayoobi{-}Yazdi},
title = {Optimized geometry of the carotid artery cross-section: Comparison
between circular and elliptical approximations in B-mode ultrasound
images},
journal = {Discret. Math. Algorithms Appl.},
volume = {13},
number = {2},
pages = {2150004:1--2150004:15},
year = {2021},
url = {https://doi.org/10.1142/S179383092150004X},
doi = {10.1142/S179383092150004X},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/SoleimaniSA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ida/LiX21,
author = {Jincao Li and
Ming Xu},
title = {A parametric approximation algorithm for spatial group keyword queries},
journal = {Intell. Data Anal.},
volume = {25},
number = {2},
pages = {305--319},
year = {2021},
url = {https://doi.org/10.3233/IDA-195071},
doi = {10.3233/IDA-195071},
timestamp = {Tue, 20 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ida/LiX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/RanZTD21,
author = {Yingli Ran and
Zhao Zhang and
Shaojie Tang and
Ding{-}Zhu Du},
title = {Breaking the \emph{r}\({}_{\mbox{max}}\) Barrier: Enhanced Approximation
Algorithms for Partial Set Multicover Problem},
journal = {{INFORMS} J. Comput.},
volume = {33},
number = {2},
pages = {774--784},
year = {2021},
url = {https://doi.org/10.1287/ijoc.2020.0975},
doi = {10.1287/IJOC.2020.0975},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/RanZTD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GorgiOSH21,
author = {Abbass Gorgi and
Mourad El Ouali and
Anand Srivastav and
Mohamed Hachimi},
title = {Approximation algorithm for the multicovering problem},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {433--450},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00688-9},
doi = {10.1007/S10878-020-00688-9},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GorgiOSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/WangX21,
author = {Siwen Wang and
Zi Xu},
title = {New Approximation Algorithms for Weighted Maximin Dispersion Problem
with Box or Ball Constraints},
journal = {J. Optim. Theory Appl.},
volume = {190},
number = {2},
pages = {524--539},
year = {2021},
url = {https://doi.org/10.1007/s10957-021-01893-0},
doi = {10.1007/S10957-021-01893-0},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/WangX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlc/FatemiHKS21,
author = {Seyed Mohsen Fatemi and
Seyed Mohsen Hosseini and
Ali Kamandi and
Mahmood Shabankhah},
title = {{CL-MAX:} a clustering-based approximation algorithm for mining maximal
frequent itemsets},
journal = {Int. J. Mach. Learn. Cybern.},
volume = {12},
number = {2},
pages = {365--383},
year = {2021},
url = {https://doi.org/10.1007/s13042-020-01177-5},
doi = {10.1007/S13042-020-01177-5},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mlc/FatemiHKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/CoopeT21,
author = {Ian D. Coope and
Rachael Tappenden},
title = {Gradient and diagonal Hessian approximations using quadratic interpolation
models and aligned regular bases},
journal = {Numer. Algorithms},
volume = {88},
number = {2},
pages = {767--791},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-01056-8},
doi = {10.1007/S11075-020-01056-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/CoopeT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/RaffoB21,
author = {Andrea Raffo and
Silvia Biasotti},
title = {Weighted quasi-interpolant spline approximations: Properties and applications},
journal = {Numer. Algorithms},
volume = {87},
number = {2},
pages = {819--847},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-00989-4},
doi = {10.1007/S11075-020-00989-4},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/RaffoB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zhong21,
author = {Xianghui Zhong},
title = {On the approximation ratio of the 3-Opt algorithm for the (1, 2)-TSP},
journal = {Oper. Res. Lett.},
volume = {49},
number = {4},
pages = {515--521},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.05.012},
doi = {10.1016/J.ORL.2021.05.012},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Zhong21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Ducoffe21,
author = {Guillaume Ducoffe},
title = {Faster Approximation Algorithms for Computing Shortest Cycles on Weighted
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {953--969},
year = {2021},
url = {https://doi.org/10.1137/20M1330415},
doi = {10.1137/20M1330415},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Ducoffe21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HuangMMSV21,
author = {Chien{-}Chung Huang and
Mathieu Mari and
Claire Mathieu and
Kevin Schewior and
Jens Vygen},
title = {An Approximation Algorithm for Fully Planar Edge-Disjoint Paths},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {752--769},
year = {2021},
url = {https://doi.org/10.1137/20M1319401},
doi = {10.1137/20M1319401},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HuangMMSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sncs/SaukS21,
author = {Benjamin Sauk and
Nikolaos V. Sahinidis},
title = {Backward Stepwise Elimination: Approximation Guarantee, a Batched
{GPU} Algorithm, and Empirical Investigation},
journal = {{SN} Comput. Sci.},
volume = {2},
number = {5},
pages = {396},
year = {2021},
url = {https://doi.org/10.1007/s42979-021-00788-1},
doi = {10.1007/S42979-021-00788-1},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sncs/SaukS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChitnisFM21,
author = {Rajesh Chitnis and
Andreas Emil Feldmann and
Pasin Manurangsi},
title = {Parameterized Approximation Algorithms for Bidirected Steiner Network
Problems},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {2},
pages = {12:1--12:68},
year = {2021},
url = {https://doi.org/10.1145/3447584},
doi = {10.1145/3447584},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChitnisFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tase/PeiWJWD21,
author = {Zhi Pei and
Mingzhong Wan and
Zhong{-}Zhong Jiang and
Ziteng Wang and
Xu Dai},
title = {An Approximation Algorithm for Unrelated Parallel Machine Scheduling
Under {TOU} Electricity Tariffs},
journal = {{IEEE} Trans Autom. Sci. Eng.},
volume = {18},
number = {2},
pages = {743--756},
year = {2021},
url = {https://doi.org/10.1109/TASE.2020.2995078},
doi = {10.1109/TASE.2020.2995078},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tase/PeiWJWD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HuangHLWRG21,
author = {Yufei Huang and
Bo Hou and
Wen Liu and
Lidong Wu and
Stephen Rainwater and
Suogang Gao},
title = {On approximation algorithm for the edge metric dimension problem},
journal = {Theor. Comput. Sci.},
volume = {853},
pages = {2--6},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.05.005},
doi = {10.1016/J.TCS.2020.05.005},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HuangHLWRG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/wcl/EfremP21,
author = {Christos N. Efrem and
Athanasios D. Panagopoulos},
title = {Minimizing the Installation Cost of Ground Stations in Satellite Networks:
Complexity, Dynamic Programming and Approximation Algorithm},
journal = {{IEEE} Wirel. Commun. Lett.},
volume = {10},
number = {2},
pages = {378--382},
year = {2021},
url = {https://doi.org/10.1109/LWC.2020.3031717},
doi = {10.1109/LWC.2020.3031717},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/wcl/EfremP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Galvez00RW21,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Arindam Khan and
Diego Ram{\'{\i}}rez{-}Romero and
Andreas Wiese},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing
into Multiple L-Shapes, Spirals, and More},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {39:1--39:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.39},
doi = {10.4230/LIPICS.SOCG.2021.39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Galvez00RW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/AggarwalLS21,
author = {Divesh Aggarwal and
Zeyong Li and
Noah Stephens{-}Davidowitz},
editor = {Anne Canteaut and
Fran{\c{c}}ois{-}Xavier Standaert},
title = {A 2\({}^{\mbox{n/2}}\)-Time Algorithm for {\textdollar}{\textbackslash}sqrt\{n\}{\textdollar}-SVP
and {\textdollar}{\textbackslash}sqrt\{n\}{\textdollar}-Hermite SVP,
and an Improved Time-Approximation Tradeoff for {(H)SVP}},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2021 - 40th Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Zagreb, Croatia, October 17-21, 2021, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {12696},
pages = {467--497},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-77870-5\_17},
doi = {10.1007/978-3-030-77870-5\_17},
timestamp = {Wed, 16 Jun 2021 11:49:32 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/AggarwalLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/NaruszkoPR21,
author = {Adrian Naruszko and
Bartlomiej Przybylski and
Krzysztof Rzadca},
editor = {Leonel Sousa and
Nuno Roma and
Pedro Tom{\'{a}}s},
title = {A Log-Linear {(2} +5/6)-Approximation Algorithm for Parallel Machine
Scheduling with a Single Orthogonal Resource},
booktitle = {Euro-Par 2021: Parallel Processing - 27th International Conference
on Parallel and Distributed Computing, Lisbon, Portugal, September
1-3, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12820},
pages = {151--166},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85665-6\_10},
doi = {10.1007/978-3-030-85665-6\_10},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/NaruszkoPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Korhonen21,
author = {Tuukka Korhonen},
title = {A Single-Exponential Time 2-Approximation Algorithm for Treewidth},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {184--192},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00026},
doi = {10.1109/FOCS52979.2021.00026},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Korhonen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Parekh021,
author = {Ojas Parekh and
Kevin Thompson},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation
Algorithms},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {102:1--102:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.102},
doi = {10.4230/LIPICS.ICALP.2021.102},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Parekh021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RohwedderW21,
author = {Lars Rohwedder and
Andreas Wiese},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A {(2} + \emph{{\(\epsilon\)}})-approximation algorithm for preemptive
weighted flow time on a single machine},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1042--1055},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451075},
doi = {10.1145/3406325.3451075},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RohwedderW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FujitoT21,
author = {Toshihiro Fujito and
Takumi Tatematsu},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {On b-Matchings and b-Edge Dominating Sets: {A} 2-Approximation Algorithm
for the 4-Edge Dominating Set Problem},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {65--79},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_5},
doi = {10.1007/978-3-030-92702-8\_5},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/FujitoT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-08947,
author = {Junyuan Lin and
Guangpeng Ren},
title = {On Optimization of 1/2-Approximation Path Cover Algorithm},
journal = {CoRR},
volume = {abs/2101.08947},
year = {2021},
url = {https://arxiv.org/abs/2101.08947},
eprinttype = {arXiv},
eprint = {2101.08947},
timestamp = {Sat, 30 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-08947.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-03304,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Arash Haddadan and
Sharat Ibrahimpur},
title = {A 2-Approximation Algorithm for Flexible Graph Connectivity},
journal = {CoRR},
volume = {abs/2102.03304},
year = {2021},
url = {https://arxiv.org/abs/2102.03304},
eprinttype = {arXiv},
eprint = {2102.03304},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-03304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-00504,
author = {Xianghui Zhong},
title = {On the Approximation Ratio of the 3-Opt Algorithm for the (1, 2)-TSP},
journal = {CoRR},
volume = {abs/2103.00504},
year = {2021},
url = {https://arxiv.org/abs/2103.00504},
eprinttype = {arXiv},
eprint = {2103.00504},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-00504.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-10406,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Arindam Khan and
Diego Ram{\'{\i}}rez{-}Romero and
Andreas Wiese},
title = {Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing
into Multiple L-Shapes, Spirals, and More},
journal = {CoRR},
volume = {abs/2103.10406},
year = {2021},
url = {https://arxiv.org/abs/2103.10406},
eprinttype = {arXiv},
eprint = {2103.10406},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-10406.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-07463,
author = {Tuukka Korhonen},
title = {Single-Exponential Time 2-Approximation Algorithm for Treewidth},
journal = {CoRR},
volume = {abs/2104.07463},
year = {2021},
url = {https://arxiv.org/abs/2104.07463},
eprinttype = {arXiv},
eprint = {2104.07463},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-07463.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-05698,
author = {Ojas Parekh and
Kevin Thompson},
title = {Application of the Level-{\textdollar}2{\textdollar} Quantum Lasserre
Hierarchy in Quantum Approximation Algorithms},
journal = {CoRR},
volume = {abs/2105.05698},
year = {2021},
url = {https://arxiv.org/abs/2105.05698},
eprinttype = {arXiv},
eprint = {2105.05698},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-05698.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-08444,
author = {Shinji Imahori},
title = {A 1+O(1/N) approximation algorithm for {TTP(2)}},
journal = {CoRR},
volume = {abs/2108.08444},
year = {2021},
url = {https://arxiv.org/abs/2108.08444},
eprinttype = {arXiv},
eprint = {2108.08444},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-08444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-13716,
author = {Adrian Naruszko and
Bartlomiej Przybylski and
Krzysztof Rzadca},
title = {A log-linear (2+5/6)-approximation algorithm for parallel machine
scheduling with a single orthogonal resource},
journal = {CoRR},
volume = {abs/2108.13716},
year = {2021},
url = {https://arxiv.org/abs/2108.13716},
eprinttype = {arXiv},
eprint = {2108.13716},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-13716.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adcm/Sidi20,
author = {Avram Sidi},
title = {Vector versions of Prony's algorithm and vector-valued rational approximations},
journal = {Adv. Comput. Math.},
volume = {46},
number = {2},
pages = {30},
year = {2020},
url = {https://doi.org/10.1007/s10444-020-09751-9},
doi = {10.1007/S10444-020-09751-9},
timestamp = {Mon, 27 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adcm/Sidi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/MensahGY20,
author = {Dennis Nii Ayeh Mensah and
Hui Gao and
Liang Wei Yang},
title = {Approximation Algorithm for Shortest Path in Large Social Networks},
journal = {Algorithms},
volume = {13},
number = {2},
pages = {36},
year = {2020},
url = {https://doi.org/10.3390/a13020036},
doi = {10.3390/A13020036},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/MensahGY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arobots/KimY20,
author = {Donghyuk Kim and
Sung{-}Eui Yoon},
title = {Simultaneous planning of sampling and optimization: study on lazy
evaluation and configuration free space approximation for optimal
motion planning algorithm},
journal = {Auton. Robots},
volume = {44},
number = {2},
pages = {165--181},
year = {2020},
url = {https://doi.org/10.1007/s10514-019-09884-x},
doi = {10.1007/S10514-019-09884-X},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arobots/KimY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/ShenFWX20,
author = {Chungen Shen and
Changxing Fan and
Yunlong Wang and
Wenjuan Xue},
title = {Limited memory {BFGS} algorithm for the matrix approximation problem
in Frobenius norm},
journal = {Comput. Appl. Math.},
volume = {39},
number = {2},
year = {2020},
url = {https://doi.org/10.1007/s40314-020-1089-9},
doi = {10.1007/S40314-020-1089-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cam/ShenFWX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/AmanoN20,
author = {Kazuyuki Amano and
Shin{-}Ichi Nakano},
title = {An Approximation Algorithm for the 2-Dispersion Problem},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {103-D},
number = {3},
pages = {506--508},
year = {2020},
url = {http://search.ieice.org/bin/summary.php?id=e103-d\_3\_506},
doi = {10.1587/TRANSINF.2019FCP0005},
timestamp = {Mon, 06 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicet/AmanoN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijdsa/ThakoorBTB20,
author = {Nawdha Thakoor and
Dhiren Kumar Behera and
D{\'{e}}sir{\'{e}} Yannick Tangman and
Muddun Bhuruth},
title = {Howard's algorithm for high-order approximations of American options
under jump-diffusion models},
journal = {Int. J. Data Sci. Anal.},
volume = {10},
number = {2},
pages = {193--203},
year = {2020},
url = {https://doi.org/10.1007/s41060-018-00173-x},
doi = {10.1007/S41060-018-00173-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijdsa/ThakoorBTB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenLLLSXZ20,
author = {Yong Chen and
Guohui Lin and
Tian Liu and
Taibo Luo and
Bing Su and
Yao Xu and
Peng Zhang},
title = {A {(1.4} + {\(\epsilon\)} )-approximation algorithm for the 2-Max-Duo
problem},
journal = {J. Comb. Optim.},
volume = {40},
number = {3},
pages = {806--824},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00621-0},
doi = {10.1007/S10878-020-00621-0},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenLLLSXZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiHHTZ20,
author = {Pan Li and
Qiang Hua and
Zhijun Hu and
Hing{-}Fung Ting and
Yong Zhang},
title = {Approximation algorithms for the selling with preference},
journal = {J. Comb. Optim.},
volume = {40},
number = {2},
pages = {366--378},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00602-3},
doi = {10.1007/S10878-020-00602-3},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiHHTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiLLWZ20,
author = {Jianping Li and
Suding Liu and
Junran Lichen and
Wencheng Wang and
Yujie Zheng},
title = {Approximation algorithms for solving the 1-line Euclidean minimum
Steiner tree problem},
journal = {J. Comb. Optim.},
volume = {39},
number = {2},
pages = {492--508},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00492-0},
doi = {10.1007/S10878-019-00492-0},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiLLWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NongFGDFQ20,
author = {Qingqin Nong and
Jiazhu Fang and
Suning Gong and
Ding{-}Zhu Du and
Yan Feng and
Xiaoying Qu},
title = {A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular
function on a bounded integer lattice},
journal = {J. Comb. Optim.},
volume = {39},
number = {4},
pages = {1208--1220},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00558-4},
doi = {10.1007/S10878-020-00558-4},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NongFGDFQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RawatS20,
author = {Anuj Rawat and
Mark A. Shayman},
title = {A {\textdollar}{\textbackslash}frac\{5\}\{2\}{\textdollar}-approximation
algorithm for coloring rooted subtrees of a degree 3 tree},
journal = {J. Comb. Optim.},
volume = {40},
number = {1},
pages = {69--97},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00564-6},
doi = {10.1007/S10878-020-00564-6},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RawatS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LiZYZD20,
author = {Xianyue Li and
Zhao Zhang and
Ruowang Yang and
Heping Zhang and
Ding{-}Zhu Du},
title = {Approximation algorithms for capacitated partial inverse maximum spanning
tree problem},
journal = {J. Glob. Optim.},
volume = {77},
number = {2},
pages = {319--340},
year = {2020},
url = {https://doi.org/10.1007/s10898-019-00852-4},
doi = {10.1007/S10898-019-00852-4},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LiZYZD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/AnLZ20,
author = {Jing An and
Huiyuan Li and
Zhimin Zhang},
title = {Spectral-Galerkin approximation and optimal error estimate for biharmonic
eigenvalue problems in circular/spherical/elliptical domains},
journal = {Numer. Algorithms},
volume = {84},
number = {2},
pages = {427--455},
year = {2020},
url = {https://doi.org/10.1007/s11075-019-00760-4},
doi = {10.1007/S11075-019-00760-4},
timestamp = {Thu, 16 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/AnLZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/WangQL20,
author = {Tongke Wang and
Meng Qin and
Huan Lian},
title = {The asymptotic approximations to linear weakly singular Volterra integral
equations via Laplace transform},
journal = {Numer. Algorithms},
volume = {85},
number = {2},
pages = {683--711},
year = {2020},
url = {https://doi.org/10.1007/s11075-019-00832-5},
doi = {10.1007/S11075-019-00832-5},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/WangQL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ral/HariNR20,
author = {Sai Krishna Kanth Hari and
Abhishek Nayak and
Sivakumar Rathinam},
title = {An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling
Problem Involving a Human-Robot Team},
journal = {{IEEE} Robotics Autom. Lett.},
volume = {5},
number = {2},
pages = {2146--2153},
year = {2020},
url = {https://doi.org/10.1109/LRA.2020.2970689},
doi = {10.1109/LRA.2020.2970689},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ral/HariNR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/CambierCBRTD20,
author = {L{\'{e}}opold Cambier and
Chao Chen and
Erik G. Boman and
Sivasankaran Rajamanickam and
Raymond S. Tuminaro and
Eric Darve},
title = {An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank
Approximations},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {41},
number = {2},
pages = {715--746},
year = {2020},
url = {https://doi.org/10.1137/19M123806X},
doi = {10.1137/19M123806X},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/CambierCBRTD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tac/LeiC20,
author = {Jinlong Lei and
Han{-}Fu Chen},
title = {Distributed Stochastic Approximation Algorithm With Expanding Truncations},
journal = {{IEEE} Trans. Autom. Control.},
volume = {65},
number = {2},
pages = {664--679},
year = {2020},
url = {https://doi.org/10.1109/TAC.2019.2912713},
doi = {10.1109/TAC.2019.2912713},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tac/LeiC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DingQ20,
author = {Wei Ding and
Ke Qiu},
title = {A 2-approximation algorithm and beyond for the minimum diameter \emph{k}-Steiner
forest problem},
journal = {Theor. Comput. Sci.},
volume = {840},
pages = {1--15},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.12.012},
doi = {10.1016/J.TCS.2019.12.012},
timestamp = {Mon, 28 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DingQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/JiXDG20,
author = {Sai Ji and
Dachuan Xu and
Donglei Du and
Ling Gai},
editor = {Zhao Zhang and
Wei Li and
Ding{-}Zhu Du},
title = {Approximation Algorithm for the Balanced 2-correlation Clustering
Problem on Well-Proportional Graphs},
booktitle = {Algorithmic Aspects in Information and Management - 14th International
Conference, {AAIM} 2020, Jinhua, China, August 10-12, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12290},
pages = {97--107},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57602-8\_9},
doi = {10.1007/978-3-030-57602-8\_9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/JiXDG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BoydCCGISW20,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Robert Cummings and
Logan Grout and
Sharat Ibrahimpur and
Zolt{\'{a}}n Szigeti and
Lu Wang},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph
Problem in the Half-Integral Case},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {61:1--61:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.61},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.61},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BoydCCGISW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HallgrenLP20,
author = {Sean Hallgren and
Eunou Lee and
Ojas Parekh},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {59:1--59:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.59},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.59},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HallgrenLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BeyerCS20,
author = {Stephan Beyer and
Markus Chimani and
Joachim Spoerhase},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected
Spanning Subgraphs},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {347--359},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_28},
doi = {10.1007/978-3-030-58150-3\_28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BeyerCS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/NguyenNND20,
author = {Viet{-}Dung Nguyen and
Phi{-}Le Nguyen and
Trung Hieu Nguyen and
Phan{-}Thuan Do},
title = {A 1/2-Approximation Algorithm for Target Coverage Problem in Mobile
Air Quality Monitoring Systems},
booktitle = {{IEEE} Global Communications Conference, {GLOBECOM} 2020, Virtual
Event, Taiwan, December 7-11, 2020},
pages = {1--6},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/GLOBECOM42002.2020.9322079},
doi = {10.1109/GLOBECOM42002.2020.9322079},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/globecom/NguyenNND20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LokshtanovMPP020,
author = {Daniel Lokshtanov and
Pranabendu Misra and
Fahad Panolan and
Geevarghese Philip and
Saket Saurabh},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {A {(2} + {\(\epsilon\)})-Factor Approximation Algorithm for Split
Vertex Deletion},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {80:1--80:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.80},
doi = {10.4230/LIPICS.ICALP.2020.80},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/LokshtanovMPP020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/TraubT20,
author = {Vera Traub and
Thorben Tr{\"{o}}bst},
editor = {Daniel Bienstock and
Giacomo Zambelli},
title = {A Fast {(2} + 2/7)-Approximation Algorithm for Capacitated Cycle Covering},
booktitle = {Integer Programming and Combinatorial Optimization - 21st International
Conference, {IPCO} 2020, London, UK, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12125},
pages = {391--404},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-45771-6\_30},
doi = {10.1007/978-3-030-45771-6\_30},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/TraubT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/siamcsc/Al-HerzP20,
author = {Ahmed Al{-}Herz and
Alex Pothen},
editor = {H. Martin B{\"{u}}cker and
Xiaoye Sherry Li and
Sivasankaran Rajamanickam},
title = {A Parallel 2/3-Approximation Algorithm for Vertex-Weighted Matching},
booktitle = {Proceedings of the {SIAM} Workshop on Combinatorial Scientific Computing,
{CSC} 2020, Seattle, USA, February 11-13, 2020},
pages = {12--21},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976229.2},
doi = {10.1137/1.9781611976229.2},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/siamcsc/Al-HerzP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Rathinam0BS20,
author = {Sivakumar Rathinam and
R. Ravi and
J. Bae and
Kaarthik Sundar},
editor = {Susanne Albers},
title = {Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot
Heterogeneous Traveling Salesman Problem},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {33:1--33:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.33},
doi = {10.4230/LIPICS.SWAT.2020.33},
timestamp = {Fri, 12 Jun 2020 14:09:17 +0200},
biburl = {https://dblp.org/rec/conf/swat/Rathinam0BS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-02437,
author = {Ren{\'{e}} van Bevern and
Viktoriia A. Slugina},
title = {A historical note on the 3/2-approximation algorithm for the metric
traveling salesman problem},
journal = {CoRR},
volume = {abs/2004.02437},
year = {2020},
url = {https://arxiv.org/abs/2004.02437},
eprinttype = {arXiv},
eprint = {2004.02437},
timestamp = {Wed, 08 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-02437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09556,
author = {Divesh Aggarwal and
Zeyong Li and
Noah Stephens{-}Davidowitz},
title = {A 2\({}^{\mbox{n/2}}\)-Time Algorithm for {\(\surd\)}n-SVP and {\(\surd\)}n-Hermite
SVP, and an Improved Time-Approximation Tradeoff for {(H)SVP}},
journal = {CoRR},
volume = {abs/2007.09556},
year = {2020},
url = {https://arxiv.org/abs/2007.09556},
eprinttype = {arXiv},
eprint = {2007.09556},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09556.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03327,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Robert Cummings and
Logan Grout and
Sharat Ibrahimpur and
Zolt{\'{a}}n Szigeti and
Lu Wang},
title = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph
Problem in the Half-Integral Case},
journal = {CoRR},
volume = {abs/2008.03327},
year = {2020},
url = {https://arxiv.org/abs/2008.03327},
eprinttype = {arXiv},
eprint = {2008.03327},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-11056,
author = {Matthew Drescher and
Samuel Fiorini and
Tony Huynh},
title = {A simple (2+{\(\epsilon\)})-approximation algorithm for Split Vertex
Deletion},
journal = {CoRR},
volume = {abs/2009.11056},
year = {2020},
url = {https://arxiv.org/abs/2009.11056},
eprinttype = {arXiv},
eprint = {2009.11056},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-11056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-05676,
author = {Lars Rohwedder and
Andreas Wiese},
title = {A (2+{\(\epsilon\)})-approximation algorithm for preemptive weighted
flow time on a single machine},
journal = {CoRR},
volume = {abs/2011.05676},
year = {2020},
url = {https://arxiv.org/abs/2011.05676},
eprinttype = {arXiv},
eprint = {2011.05676},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-05676.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-15019,
author = {Jes{\'{u}}s Garc{\'{\i}}a D{\'{\i}}az},
title = {A 3-2/b(G)-approximation algorithm for the graph burning problem},
journal = {CoRR},
volume = {abs/2011.15019},
year = {2020},
url = {https://arxiv.org/abs/2011.15019},
eprinttype = {arXiv},
eprint = {2011.15019},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-15019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijrr/PlonskiI19,
author = {Patrick A. Plonski and
Volkan Isler},
title = {Approximation algorithms for tours of height-varying view cones},
journal = {Int. J. Robotics Res.},
volume = {38},
number = {2-3},
year = {2019},
url = {https://doi.org/10.1177/0278364918784353},
doi = {10.1177/0278364918784353},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijrr/PlonskiI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamc/ShettyP19,
author = {D. Pushparaj Shetty and
M. Lakshmi Prasanna},
title = {Approximation algorithm for receiver interference problem in dual
power Wireless Sensor Networks},
journal = {J. Appl. Math. Comput.},
volume = {61},
number = {1-2},
pages = {87--99},
year = {2019},
url = {https://doi.org/10.1007/s12190-019-01242-5},
doi = {10.1007/S12190-019-01242-5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamc/ShettyP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BeneditoP19,
author = {Marcelo Pinheiro Leite Benedito and
Lehilton L. C. Pedrosa},
title = {Approximation algorithms for Median Hub Location Problems},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {375--401},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00386-1},
doi = {10.1007/S10878-019-00386-1},
timestamp = {Fri, 05 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BeneditoP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CroceST19,
author = {Federico Della Croce and
Rosario Scatamacchia and
Vincent T'kindt},
title = {A tight linear time {\textdollar}{\textdollar}{\textbackslash}frac\{13\}\{12\}{\textdollar}{\textdollar}
-approximation algorithm for the {\textdollar}{\textdollar}P2 {\(\vert\)}{\(\vert\)}
C{\_}\{{\textbackslash}max \}{\textdollar}{\textdollar} problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {608--617},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00399-w},
doi = {10.1007/S10878-019-00399-W},
timestamp = {Fri, 16 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CroceST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangHWXZ19,
author = {Dongmei Zhang and
Chunlin Hao and
Chenchen Wu and
Dachuan Xu and
Zhenning Zhang},
title = {Local search approximation algorithms for the k-means problem with
penalties},
journal = {J. Comb. Optim.},
volume = {37},
number = {2},
pages = {439--453},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0278-6},
doi = {10.1007/S10878-018-0278-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangHWXZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangLWWX19,
author = {Jin Zhang and
Min Li and
Yishui Wang and
Chenchen Wu and
Dachuan Xu},
title = {Approximation algorithm for squared metric two-stage stochastic facility
location problem},
journal = {J. Comb. Optim.},
volume = {38},
number = {2},
pages = {618--634},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00404-2},
doi = {10.1007/S10878-019-00404-2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangLWWX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BorassiN19,
author = {Michele Borassi and
Emanuele Natale},
title = {{KADABRA} is an ADaptive Algorithm for Betweenness via Random Approximation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.2:1--1.2:35},
year = {2019},
url = {https://doi.org/10.1145/3284359},
doi = {10.1145/3284359},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BorassiN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NadaraPRRS19,
author = {Wojciech Nadara and
Marcin Pilipczuk and
Roman Rabinovich and
Felix Reidl and
Sebastian Siebertz},
title = {Empirical Evaluation of Approximation Algorithms for Generalized Graph
Coloring and Uniform Quasi-wideness},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.6:1--2.6:34},
year = {2019},
url = {https://doi.org/10.1145/3368630},
doi = {10.1145/3368630},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NadaraPRRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChepoiDHVA19,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
title = {Fast approximation of eccentricities and distances in hyperbolic graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {393--433},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00496},
doi = {10.7155/JGAA.00496},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChepoiDHVA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/AouadLS19,
author = {Ali Aouad and
Retsef Levi and
Danny Segev},
title = {Approximation Algorithms for Dynamic Assortment Optimization Models},
journal = {Math. Oper. Res.},
volume = {44},
number = {2},
pages = {487--511},
year = {2019},
url = {https://doi.org/10.1287/moor.2018.0933},
doi = {10.1287/MOOR.2018.0933},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/AouadLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AouadS19,
author = {Ali Aouad and
Danny Segev},
title = {The ordered k-median problem: surrogate models and approximation algorithms},
journal = {Math. Program.},
volume = {177},
number = {1-2},
pages = {55--83},
year = {2019},
url = {https://doi.org/10.1007/s10107-018-1259-3},
doi = {10.1007/S10107-018-1259-3},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AouadS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HuangKK19,
author = {Chien{-}Chung Huang and
Naonori Kakimura and
Naoyuki Kamiyama},
title = {Exact and approximation algorithms for weighted matroid intersection},
journal = {Math. Program.},
volume = {177},
number = {1-2},
pages = {85--112},
year = {2019},
url = {https://doi.org/10.1007/s10107-018-1260-x},
doi = {10.1007/S10107-018-1260-X},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HuangKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/ZhaoWX19,
author = {Ming{-}Yang Zhao and
Huibin Wu and
Chunguang Xiong},
title = {Error analysis of {HDG} approximations for elliptic variational inequality:
obstacle problem},
journal = {Numer. Algorithms},
volume = {81},
number = {2},
pages = {445--463},
year = {2019},
url = {https://doi.org/10.1007/s11075-018-0556-5},
doi = {10.1007/S11075-018-0556-5},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/ZhaoWX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nm/DereichM19,
author = {Steffen Dereich and
Thomas M{\"{u}}ller{-}Gronbach},
title = {General multilevel adaptations for stochastic approximation algorithms
of Robbins-Monro and Polyak-Ruppert type},
journal = {Numerische Mathematik},
volume = {142},
number = {2},
pages = {279--328},
year = {2019},
url = {https://doi.org/10.1007/s00211-019-01024-y},
doi = {10.1007/S00211-019-01024-Y},
timestamp = {Mon, 29 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nm/DereichM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/MatsudaT19,
author = {Yusa Matsuda and
Satoshi Takahashi},
title = {A 4-approximation algorithm for k-prize collecting Steiner tree problems},
journal = {Optim. Lett.},
volume = {13},
number = {2},
pages = {341--348},
year = {2019},
url = {https://doi.org/10.1007/s11590-018-1367-2},
doi = {10.1007/S11590-018-1367-2},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/MatsudaT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pai/Duran-RosalGSH19,
author = {Antonio Manuel Dur{\'{a}}n{-}Rosal and
Pedro Antonio Guti{\'{e}}rrez and
Sancho Salcedo{-}Sanz and
C{\'{e}}sar Herv{\'{a}}s{-}Mart{\'{\i}}nez},
title = {Dynamical memetization in coral reef optimization algorithms for optimal
time series approximation},
journal = {Prog. Artif. Intell.},
volume = {8},
number = {2},
pages = {253--262},
year = {2019},
url = {https://doi.org/10.1007/s13748-019-00176-0},
doi = {10.1007/S13748-019-00176-0},
timestamp = {Sun, 10 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pai/Duran-RosalGSH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HarshaS19,
author = {Prahladh Harsha and
Srikanth Srinivasan},
title = {On polynomial approximations to {AC}},
journal = {Random Struct. Algorithms},
volume = {54},
number = {2},
pages = {289--303},
year = {2019},
url = {https://doi.org/10.1002/rsa.20786},
doi = {10.1002/RSA.20786},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HarshaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Huber19,
author = {Mark Huber},
title = {An optimal ({\unicode{1013}}, {\(\delta\)})-randomized approximation
scheme for the mean of random variables with bounded relative variance},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {356--370},
year = {2019},
url = {https://doi.org/10.1002/rsa.20839},
doi = {10.1002/RSA.20839},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Huber19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rss/AsahiroKM19,
author = {Yuichi Asahiro and
Tomohiro Kubo and
Eiji Miyano},
title = {Experimental Evaluation of Approximation and Heuristic Algorithms
for Maximum Distance-Bounded Subgraph Problems},
journal = {Rev. Socionetwork Strateg.},
volume = {13},
number = {2},
pages = {143--161},
year = {2019},
url = {https://doi.org/10.1007/s12626-019-00036-2},
doi = {10.1007/S12626-019-00036-2},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rss/AsahiroKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/DobrianHPA19,
author = {Florin Dobrian and
Mahantesh Halappanavar and
Alex Pothen and
Ahmed Al{-}Herz},
title = {A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite
Graphs},
journal = {{SIAM} J. Sci. Comput.},
volume = {41},
number = {1},
pages = {A566--A591},
year = {2019},
url = {https://doi.org/10.1137/17M1140029},
doi = {10.1137/17M1140029},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/DobrianHPA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Adjiashvili19,
author = {David Adjiashvili},
title = {Beating Approximation Factor Two for Weighted Tree Augmentation with
Bounded Costs},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {19:1--19:26},
year = {2019},
url = {https://doi.org/10.1145/3182395},
doi = {10.1145/3182395},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Adjiashvili19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FriggstadKRS19,
author = {Zachary Friggstad and
Kamyar Khodamoradi and
Mohsen Rezapour and
Mohammad R. Salavatipour},
title = {Approximation Schemes for Clustering with Outliers},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {26:1--26:26},
year = {2019},
url = {https://doi.org/10.1145/3301446},
doi = {10.1145/3301446},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FriggstadKRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HunkenschroderV19,
author = {Christoph Hunkenschr{\"{o}}der and
Santosh S. Vempala and
Adrian Vetta},
title = {A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph
Problem},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {55:1--55:28},
year = {2019},
url = {https://doi.org/10.1145/3341599},
doi = {10.1145/3341599},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/HunkenschroderV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PazS19,
author = {Ami Paz and
Gregory Schwartzman},
title = {A (2+{\(\epsilon\)})-Approximation for Maximum Weight Matching in
the Semi-streaming Model},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {18:1--18:15},
year = {2019},
url = {https://doi.org/10.1145/3274668},
doi = {10.1145/3274668},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/PazS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnn/GaoZWCYW19,
author = {Shangce Gao and
Mengchu Zhou and
Yirui Wang and
Jiujun Cheng and
Hanaki Yachi and
Jiahai Wang},
title = {Dendritic Neuron Model With Effective Learning Algorithms for Classification,
Approximation, and Prediction},
journal = {{IEEE} Trans. Neural Networks Learn. Syst.},
volume = {30},
number = {2},
pages = {601--614},
year = {2019},
url = {https://doi.org/10.1109/TNNLS.2018.2846646},
doi = {10.1109/TNNLS.2018.2846646},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnn/GaoZWCYW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/FengMTW19,
author = {Qilong Feng and
Xiangzhong Meng and
Guanlan Tan and
Jianxin Wang},
editor = {Ding{-}Zhu Du and
Lian Li and
Xiaoming Sun and
Jialin Zhang},
title = {A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling},
booktitle = {Algorithmic Aspects in Information and Management - 13th International
Conference, {AAIM} 2019, Beijing, China, August 6-8, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11640},
pages = {95--107},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-27195-4\_9},
doi = {10.1007/978-3-030-27195-4\_9},
timestamp = {Wed, 26 Apr 2023 14:16:14 +0200},
biburl = {https://dblp.org/rec/conf/aaim/FengMTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/JiangGZZ19,
author = {Haitao Jiang and
Jiong Guo and
Daming Zhu and
Binhai Zhu},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery
Problem},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.5},
doi = {10.4230/LIPICS.CPM.2019.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/JiangGZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/SaikiaK19,
author = {Parikshit Saikia and
Sushanta Karmakar},
editor = {R. C. Hansdah and
Dilip Krishnaswamy and
Nitin H. Vaidya},
title = {A simple 2(1-1/\emph{l}) factor distributed approximation algorithm
for steiner tree in the \emph{CONGEST} model},
booktitle = {Proceedings of the 20th International Conference on Distributed Computing
and Networking, {ICDCN} 2019, Bangalore, India, January 04-07, 2019},
pages = {41--50},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3288599.3288629},
doi = {10.1145/3288599.3288629},
timestamp = {Wed, 01 Sep 2021 12:22:37 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/SaikiaK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/motor/IlevIM19,
author = {Victor P. Il'ev and
Svetlana Il'eva and
Alexander Morshinin},
editor = {Michael Yu. Khachay and
Yury Kochetov and
Panos M. Pardalos},
title = {A 2-Approximation Algorithm for the Graph 2-Clustering Problem},
booktitle = {Mathematical Optimization Theory and Operations Research - 18th International
Conference, {MOTOR} 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11548},
pages = {295--308},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-22629-9\_21},
doi = {10.1007/978-3-030-22629-9\_21},
timestamp = {Fri, 01 Jul 2022 09:09:07 +0200},
biburl = {https://dblp.org/rec/conf/motor/IlevIM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/numta/KelmanovKP19,
author = {Alexander Kel'manov and
Sergey A. Khamidullin and
Anna Panasenko},
editor = {Yaroslav D. Sergeyev and
Dmitri E. Kvasov},
title = {2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted
2-Partitioning Problem of a Sequence},
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 = {386--393},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-40616-5\_34},
doi = {10.1007/978-3-030-40616-5\_34},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/numta/KelmanovKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rss/SharmaPDZKK19,
author = {Gokarna Sharma and
Pavan Poudel and
Ayan Dutta and
Vala Zeinali and
Tala Talaei Khoei and
Jong{-}Hoon Kim},
editor = {Antonio Bicchi and
Hadas Kress{-}Gazit and
Seth Hutchinson},
title = {A 2-Approximation Algorithm for the Online Tethered Coverage Problem},
booktitle = {Robotics: Science and Systems XV, University of Freiburg, Freiburg
im Breisgau, Germany, June 22-26, 2019},
year = {2019},
url = {https://doi.org/10.15607/RSS.2019.XV.025},
doi = {10.15607/RSS.2019.XV.025},
timestamp = {Tue, 18 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rss/SharmaPDZKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KotrbcikS19,
author = {Michal Kotrbc{\'{\i}}k and
Martin Skoviera},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a
Graph},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {14:1--14:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.14},
doi = {10.4230/OASICS.SOSA.2019.14},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/KotrbcikS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/OnoY19,
author = {Hirotaka Ono and
Hisato Yamanaka},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk
Graphs},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {379--391},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_30},
doi = {10.1007/978-3-030-10801-4\_30},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/OnoY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-05877,
author = {Ahmed Al{-}Herz and
Alex Pothen},
title = {A 2/3-Approximation Algorithm for Vertex-weighted Matching},
journal = {CoRR},
volume = {abs/1902.05877},
year = {2019},
url = {http://arxiv.org/abs/1902.05877},
eprinttype = {arXiv},
eprint = {1902.05877},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-05877.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-09662,
author = {Amir Belgi and
Zeev Nutov},
title = {An {\~{O}}(log\({}^{\mbox{2}}\)n)-approximation algorithm for 2-edge-connected
dominating set},
journal = {CoRR},
volume = {abs/1912.09662},
year = {2019},
url = {http://arxiv.org/abs/1912.09662},
eprinttype = {arXiv},
eprint = {1912.09662},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-09662.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimOPST18,
author = {Eun Jung Kim and
Sang{-}il Oum and
Christophe Paul and
Ignasi Sau and
Dimitrios M. Thilikos},
title = {An {FPT} 2-Approximation for Tree-Cut Decomposition},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {116--135},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0245-5},
doi = {10.1007/S00453-016-0245-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KimOPST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cys/AlvaradoSSM18,
author = {Sergio Alvarado and
Carlos Segura and
Oliver Sch{\"{u}}tze and
Sa{\'{u}}l Zapotecas Mart{\'{\i}}nez},
title = {The Gradient Subspace Approximation as Local Search Engine within
Evolutionary Multi-objective Optimization Algorithms},
journal = {Computaci{\'{o}}n y Sistemas},
volume = {22},
number = {2},
year = {2018},
url = {https://doi.org/10.13053/cys-22-2-2948},
doi = {10.13053/CYS-22-2-2948},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cys/AlvaradoSSM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bar-NoyPRV18,
author = {Amotz Bar{-}Noy and
David Peleg and
George Rabanca and
Ivo Vigan},
title = {Improved approximation algorithms for weighted 2-path partitions},
journal = {Discret. Appl. Math.},
volume = {239},
pages = {15--37},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.11.031},
doi = {10.1016/J.DAM.2017.11.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-NoyPRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bar-YehudaKR18,
author = {Reuven Bar{-}Yehuda and
Gilad Kutiel and
Dror Rawitz},
title = {1.5-approximation algorithm for the 2-Convex Recoloring problem},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {2--11},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.01.008},
doi = {10.1016/J.DAM.2017.01.008},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-YehudaKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/LiuH18,
author = {Pengcheng Liu and
Xiaohui Huang},
title = {Approximation algorithm for partial set multicover versus full set
multicover},
journal = {Discret. Math. Algorithms Appl.},
volume = {10},
number = {2},
pages = {1850026:1--1850026:9},
year = {2018},
url = {https://doi.org/10.1142/S179383091850026X},
doi = {10.1142/S179383091850026X},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/LiuH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ict-express/TarantinoMB18,
author = {Gianmaria Tarantino and
Stefania Monica and
Federico Bergenti},
title = {A probabilistic matrix factorization algorithm for approximation of
sparse matrices in natural language processing},
journal = {{ICT} Express},
volume = {4},
number = {2},
pages = {87--90},
year = {2018},
url = {https://doi.org/10.1016/j.icte.2018.04.005},
doi = {10.1016/J.ICTE.2018.04.005},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ict-express/TarantinoMB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieeejas/HuangLD18,
author = {Jun Huang and
Shihao Li and
Qiang Duan},
title = {Constructing multicast routing tree for inter-cloud data transmission:
an approximation algorithmic perspective},
journal = {{IEEE} {CAA} J. Autom. Sinica},
volume = {5},
number = {2},
pages = {514--522},
year = {2018},
url = {https://doi.org/10.1109/JAS.2017.7510460},
doi = {10.1109/JAS.2017.7510460},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieeejas/HuangLD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcsm/ShuQY18,
author = {Wenhao Shu and
Wenbin Qian and
Jun Yang},
title = {An efficient approximation algorithm for the extension facility location
problem on torus internetwork topology},
journal = {Int. J. Comput. Sci. Math.},
volume = {9},
number = {2},
pages = {189--196},
year = {2018},
url = {https://doi.org/10.1504/IJCSM.2018.10012785},
doi = {10.1504/IJCSM.2018.10012785},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcsm/ShuQY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijssmet/TrutaCB18,
author = {Traian Marius Truta and
Alina Campan and
Matthew Beckerich},
title = {Efficient Approximation Algorithms for Minimum Dominating Sets in
Social Networks},
journal = {Int. J. Serv. Sci. Manag. Eng. Technol.},
volume = {9},
number = {2},
pages = {1--32},
year = {2018},
url = {https://doi.org/10.4018/IJSSMET.2018040101},
doi = {10.4018/IJSSMET.2018040101},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijssmet/TrutaCB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ZhouZTHD18,
author = {Jiao Zhou and
Zhao Zhang and
Shaojie Tang and
Xiaohui Huang and
Ding{-}Zhu Du},
title = {Breaking the \emph{O}(ln \emph{n}) Barrier: An Enhanced Approximation
Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set},
journal = {{INFORMS} J. Comput.},
volume = {30},
number = {2},
pages = {225--235},
year = {2018},
url = {https://doi.org/10.1287/ijoc.2017.0775},
doi = {10.1287/IJOC.2017.0775},
timestamp = {Wed, 03 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/ZhouZTHD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AzarCL18,
author = {Yossi Azar and
Jaya Prakash Champati and
Ben Liang},
title = {2-Approximation algorithm for a generalization of scheduling on unrelated
parallel machines},
journal = {Inf. Process. Lett.},
volume = {139},
pages = {39--43},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.07.005},
doi = {10.1016/J.IPL.2018.07.005},
timestamp = {Tue, 13 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/AzarCL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/JiangLZZ18,
author = {Haitao Jiang and
Letu Qingge and
Daming Zhu and
Binhai Zhu},
title = {A 2-approximation algorithm for the contig-based genomic scaffold
filling problem},
journal = {J. Bioinform. Comput. Biol.},
volume = {16},
number = {6},
pages = {1850022:1--1850022:15},
year = {2018},
url = {https://doi.org/10.1142/S0219720018500221},
doi = {10.1142/S0219720018500221},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jbcb/JiangLZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanXDZ18,
author = {Lu Han and
Dachuan Xu and
Donglei Du and
Dongmei Zhang},
title = {A local search approximation algorithm for the uniform capacitated
k-facility location problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {409--423},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0179-0},
doi = {10.1007/S10878-017-0179-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanXDZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiangXDWZ18,
author = {Yanjun Jiang and
Dachuan Xu and
Donglei Du and
Chenchen Wu and
Dongmei Zhang},
title = {An approximation algorithm for soft capacitated k-facility location
problem},
journal = {J. Comb. Optim.},
volume = {35},
number = {2},
pages = {493--511},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0192-3},
doi = {10.1007/S10878-017-0192-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiangXDWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/WuXZZ18,
author = {Chenchen Wu and
Dachuan Xu and
Dongmei Zhang and
Peng Zhang},
title = {Approximation algorithms for the robust/soft-capacitated 2-level facility
location problems},
journal = {J. Glob. Optim.},
volume = {70},
number = {1},
pages = {207--222},
year = {2018},
url = {https://doi.org/10.1007/s10898-017-0566-1},
doi = {10.1007/S10898-017-0566-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/WuXZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Pia18,
author = {Alberto Del Pia},
title = {On approximation algorithms for concave mixed-integer quadratic programming},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {3--16},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1178-8},
doi = {10.1007/S10107-017-1178-8},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Pia18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CornelissenHMNR18,
author = {Kamiel Cornelissen and
Ruben Hoeksma and
Bodo Manthey and
N. S. Narayanaswamy and
C. S. Rahul and
Marten Waanders},
title = {Approximation Algorithms for Connected Graph Factors of Minimum Weight},
journal = {Theory Comput. Syst.},
volume = {62},
number = {2},
pages = {441--464},
year = {2018},
url = {https://doi.org/10.1007/s00224-016-9723-z},
doi = {10.1007/S00224-016-9723-Z},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CornelissenHMNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/JaklicK18,
author = {Gasper Jaklic and
Jernej Kozak},
title = {On parametric polynomial circle approximation},
journal = {Numer. Algorithms},
volume = {77},
number = {2},
pages = {433--450},
year = {2018},
url = {https://doi.org/10.1007/s11075-017-0322-0},
doi = {10.1007/S11075-017-0322-0},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/JaklicK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/KamraniJ18,
author = {Minoo Kamrani and
Nahid Jamshidi},
title = {Implicit Milstein method for stochastic differential equations via
the Wong-Zakai approximation},
journal = {Numer. Algorithms},
volume = {79},
number = {2},
pages = {357--374},
year = {2018},
url = {https://doi.org/10.1007/s11075-017-0440-8},
doi = {10.1007/S11075-017-0440-8},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/KamraniJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/ZhouZ18,
author = {Zhaojie Zhou and
Chenyang Zhang},
title = {Time-stepping discontinuous Galerkin approximation of optimal control
problem governed by time fractional diffusion equation},
journal = {Numer. Algorithms},
volume = {79},
number = {2},
pages = {437--455},
year = {2018},
url = {https://doi.org/10.1007/s11075-017-0445-3},
doi = {10.1007/S11075-017-0445-3},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/ZhouZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BorndorferK18,
author = {Ralf Bornd{\"{o}}rfer and
Marika Karbstein},
title = {An approximation algorithm for the Steiner connectivity problem},
journal = {Networks},
volume = {72},
number = {2},
pages = {174--181},
year = {2018},
url = {https://doi.org/10.1002/net.21809},
doi = {10.1002/NET.21809},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BorndorferK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/paapp/LinCG18,
author = {Jian (Denny) Lin and
Albert M. K. Cheng and
Gokhan Gercek},
title = {Approximation algorithms in partitioning real-time tasks with replications},
journal = {Int. J. Parallel Emergent Distributed Syst.},
volume = {33},
number = {2},
pages = {211--232},
year = {2018},
url = {https://doi.org/10.1080/17445760.2017.1307366},
doi = {10.1080/17445760.2017.1307366},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/paapp/LinCG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigpro/WijenayakeSI18,
author = {Chamith Wijenayake and
Jarryd Scutts and
Aleksandar Ignjatovic},
title = {Signal recovery algorithm for 2-level amplitude sampling using chromatic
signal approximations},
journal = {Signal Process.},
volume = {153},
pages = {143--152},
year = {2018},
url = {https://doi.org/10.1016/j.sigpro.2018.07.009},
doi = {10.1016/J.SIGPRO.2018.07.009},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigpro/WijenayakeSI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AhmadianBFJSS18,
author = {Sara Ahmadian and
Babak Behsaz and
Zachary Friggstad and
Amin Jorati and
Mohammad R. Salavatipour and
Chaitanya Swamy},
title = {Approximation Algorithms for Minimum-Load \emph{k}-Facility Location},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {2},
pages = {16:1--16:29},
year = {2018},
url = {https://doi.org/10.1145/3173047},
doi = {10.1145/3173047},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AhmadianBFJSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Anagnostopoulos18a,
author = {Aris Anagnostopoulos and
Fabrizio Grandoni and
Stefano Leonardi and
Andreas Wiese},
title = {A Mazing 2+{\unicode{1013}} Approximation for Unsplittable Flow on
a Path},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {4},
pages = {55:1--55:23},
year = {2018},
url = {https://doi.org/10.1145/3242769},
doi = {10.1145/3242769},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Anagnostopoulos18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/GaoFWC18,
author = {Xiaofeng Gao and
Jiahao Fan and
Fan Wu and
Guihai Chen},
title = {Approximation Algorithms for Sweep Coverage Problem With Multiple
Mobile Sensors},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {26},
number = {2},
pages = {990--1003},
year = {2018},
url = {http://doi.ieeecomputersociety.org/10.1109/TNET.2018.2815630},
doi = {10.1109/TNET.2018.2815630},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/GaoFWC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/twc/CuiGNLT18,
author = {Tao Cui and
Feifei Gao and
Arumugam Nallanathan and
Hai Lin and
Chintha Tellambura},
title = {Iterative Demodulation and Decoding Algorithm for 3GPP/LTE-A {MIMO-OFDM}
Using Distribution Approximation},
journal = {{IEEE} Trans. Wirel. Commun.},
volume = {17},
number = {2},
pages = {1331--1342},
year = {2018},
url = {https://doi.org/10.1109/TWC.2017.2777984},
doi = {10.1109/TWC.2017.2777984},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/twc/CuiGNLT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamaszekMP18,
author = {Anna Adamaszek and
Matthias Mnich and
Katarzyna Paluch},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {New Approximation Algorithms for (1, 2)-TSP},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.9},
doi = {10.4230/LIPICS.ICALP.2018.9},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AdamaszekMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuptaLL18,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Artur Czumaj},
title = {An {FPT} Algorithm Beating 2-Approximation for \emph{k}-Cut},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2821--2837},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.179},
doi = {10.1137/1.9781611975031.179},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuptaLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/CooperM18,
author = {Frances Cooper and
David F. Manlove},
editor = {Gianlorenzo D'Angelo},
title = {A 3/2-Approximation Algorithm for the Student-Project Allocation Problem},
booktitle = {17th International Symposium on Experimental Algorithms, {SEA} 2018,
June 27-29, 2018, L'Aquila, Italy},
series = {LIPIcs},
volume = {103},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SEA.2018.8},
doi = {10.4230/LIPICS.SEA.2018.8},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/CooperM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/tf/18/2018aam-2,
editor = {Teofilo F. Gonzalez},
title = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351235426},
doi = {10.1201/9781351235426},
isbn = {9781351235426},
timestamp = {Mon, 28 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/tf/18/2018aam-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02731,
author = {Frances Cooper and
David F. Manlove},
title = {A 3/2-approximation algorithm for the Student-Project Allocation problem},
journal = {CoRR},
volume = {abs/1804.02731},
year = {2018},
url = {http://arxiv.org/abs/1804.02731},
eprinttype = {arXiv},
eprint = {1804.02731},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-02731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08016,
author = {Florin Dobrian and
Mahantesh Halappanavar and
Alex Pothen and
Ahmed Al{-}Herz},
title = {A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite
Graphs},
journal = {CoRR},
volume = {abs/1804.08016},
year = {2018},
url = {http://arxiv.org/abs/1804.08016},
eprinttype = {arXiv},
eprint = {1804.08016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-07867,
author = {Anuj Rawat},
title = {A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree
3 Tree},
journal = {CoRR},
volume = {abs/1805.07867},
year = {2018},
url = {http://arxiv.org/abs/1805.07867},
eprinttype = {arXiv},
eprint = {1805.07867},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-07867.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-04651,
author = {Stephan Beyer and
Markus Chimani and
Joachim Spoerhase},
title = {A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected
Spanning Subgraphs},
journal = {CoRR},
volume = {abs/1808.04651},
year = {2018},
url = {http://arxiv.org/abs/1808.04651},
eprinttype = {arXiv},
eprint = {1808.04651},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-04651.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-08437,
author = {Daniel Lokshtanov and
Pranabendu Misra and
Joydeep Mukherjee and
Geevarghese Philip and
Fahad Panolan and
Saket Saurabh},
title = {A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments},
journal = {CoRR},
volume = {abs/1809.08437},
year = {2018},
url = {http://arxiv.org/abs/1809.08437},
eprinttype = {arXiv},
eprint = {1809.08437},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-08437.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-05916,
author = {Neil Olver and
Frans Schalekamp and
Suzanne van der Ster and
Leen Stougie and
Anke van Zuylen},
title = {A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest},
journal = {CoRR},
volume = {abs/1811.05916},
year = {2018},
url = {http://arxiv.org/abs/1811.05916},
eprinttype = {arXiv},
eprint = {1811.05916},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-05916.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ManurangsiM17,
author = {Pasin Manurangsi and
Dana Moshkovitz},
title = {Improved Approximation Algorithms for Projection Games},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {555--594},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0088-5},
doi = {10.1007/S00453-015-0088-5},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ManurangsiM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Solis-ObaBL17,
author = {Roberto Solis{-}Oba and
Paul S. Bonsma and
Stefanie Lowski},
title = {A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum
Number of Leaves},
journal = {Algorithmica},
volume = {77},
number = {2},
pages = {374--388},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0080-0},
doi = {10.1007/S00453-015-0080-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Solis-ObaBL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ci/GuptaDB17,
author = {Kavita Gupta and
Kusum Deep and
Jagdish Chand Bansal},
title = {Improving the Local Search Ability of Spider Monkey Optimization Algorithm
Using Quadratic Approximation for Unconstrained Optimization},
journal = {Comput. Intell.},
volume = {33},
number = {2},
pages = {210--240},
year = {2017},
url = {https://doi.org/10.1111/coin.12081},
doi = {10.1111/COIN.12081},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ci/GuptaDB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comsis/SladojevicACSL17,
author = {Srdjan Sladojevic and
Andras Anderla and
Dubravko Culibrk and
Darko Stefanovic and
Bojan Lalic},
title = {Integer arithmetic approximation of the hog algorithm used for pedestrian
detection},
journal = {Comput. Sci. Inf. Syst.},
volume = {14},
number = {2},
pages = {329--346},
year = {2017},
url = {https://doi.org/10.2298/CSIS160229011S},
doi = {10.2298/CSIS160229011S},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comsis/SladojevicACSL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LeungN17,
author = {Joseph Y.{-}T. Leung and
C. T. Ng},
title = {Fast approximation algorithms for uniform machine scheduling with
processing set restrictions},
journal = {Eur. J. Oper. Res.},
volume = {260},
number = {2},
pages = {507--513},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2017.01.013},
doi = {10.1016/J.EJOR.2017.01.013},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LeungN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/OronSS17,
author = {Daniel Oron and
Dvir Shabtay and
George Steiner},
title = {Approximation algorithms for the workload partition problem and applications
to scheduling with variable processing times},
journal = {Eur. J. Oper. Res.},
volume = {256},
number = {2},
pages = {384--391},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.06.062},
doi = {10.1016/J.EJOR.2016.06.062},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/OronSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/SinhaMD17,
author = {Ankur Sinha and
Pekka Malo and
Kalyanmoy Deb},
title = {Evolutionary algorithm for bilevel optimization using approximations
of the lower level optimal solution mapping},
journal = {Eur. J. Oper. Res.},
volume = {257},
number = {2},
pages = {395--411},
year = {2017},
url = {https://doi.org/10.1016/j.ejor.2016.08.027},
doi = {10.1016/J.EJOR.2016.08.027},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/SinhaMD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaoCHW17,
author = {Zhigang Cao and
Xujin Chen and
Xiaodong Hu and
Changjun Wang},
title = {Approximation algorithms for pricing with negative network externalities},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {681--712},
year = {2017},
url = {https://doi.org/10.1007/s10878-015-9988-1},
doi = {10.1007/S10878-015-9988-1},
timestamp = {Thu, 12 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CaoCHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RanZDZ17,
author = {Yingli Ran and
Zhao Zhang and
Hongwei Du and
Yuqing Zhu},
title = {Approximation algorithm for partial positive influence problem in
social network},
journal = {J. Comb. Optim.},
volume = {33},
number = {2},
pages = {791--802},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0005-0},
doi = {10.1007/S10878-016-0005-0},
timestamp = {Fri, 04 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RanZDZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/SteponaviceHSV17,
author = {Ingrida Steponavice and
Rob J. Hyndman and
Kate Smith{-}Miles and
Laura Villanova},
title = {Dynamic algorithm selection for pareto optimal set approximation},
journal = {J. Glob. Optim.},
volume = {67},
number = {1-2},
pages = {263--282},
year = {2017},
url = {https://doi.org/10.1007/s10898-016-0420-x},
doi = {10.1007/S10898-016-0420-X},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/SteponaviceHSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JegelkaB17,
author = {Stefanie Jegelka and
Jeff A. Bilmes},
title = {Graph cuts with interacting edge weights: examples, approximations,
and algorithms},
journal = {Math. Program.},
volume = {162},
number = {1-2},
pages = {241--282},
year = {2017},
url = {https://doi.org/10.1007/s10107-016-1038-y},
doi = {10.1007/S10107-016-1038-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JegelkaB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/MohantyK17,
author = {R. K. Mohanty and
Deepti Kaur},
title = {Numerov type variable mesh approximations for 1D unsteady quasi-linear
biharmonic problem: application to Kuramoto-Sivashinsky equation},
journal = {Numer. Algorithms},
volume = {74},
number = {2},
pages = {427--459},
year = {2017},
url = {https://doi.org/10.1007/s11075-016-0154-3},
doi = {10.1007/S11075-016-0154-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/MohantyK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CheungMSV17,
author = {Maurice Cheung and
Juli{\'{a}}n Mestre and
David B. Shmoys and
Jos{\'{e}} Verschae},
title = {A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling
Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {825--838},
year = {2017},
url = {https://doi.org/10.1137/16M1086819},
doi = {10.1137/16M1086819},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CheungMSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ByrkaPRST17,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Aravind Srinivasan and
Khoa Trinh},
title = {An Improved Approximation for \emph{k}-Median and Positive Correlation
in Budgeted Optimization},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {2},
pages = {23:1--23:31},
year = {2017},
url = {https://doi.org/10.1145/2981561},
doi = {10.1145/2981561},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ByrkaPRST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CzygrinowHSWW17,
author = {Andrzej Czygrinow and
Michal Hanckowiak and
Edyta Szymanska and
Wojciech Wawrzyniak and
Marcin Witkowski},
title = {Improved distributed local approximation algorithm for minimum 2-dominating
set in planar graphs},
journal = {Theor. Comput. Sci.},
volume = {662},
pages = {1--8},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.12.001},
doi = {10.1016/J.TCS.2016.12.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CzygrinowHSWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/CateKQT17,
author = {Balder ten Cate and
Phokion G. Kolaitis and
Kun Qian and
Wang{-}Chiew Tan},
title = {Approximation Algorithms for Schema-Mapping Discovery from Data Examples},
journal = {{ACM} Trans. Database Syst.},
volume = {42},
number = {2},
pages = {12:1--12:41},
year = {2017},
url = {https://doi.org/10.1145/3044712},
doi = {10.1145/3044712},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/CateKQT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/Zaghloul17,
author = {Mofreh R. Zaghloul},
title = {Algorithm 985: Simple, Efficient, and Relatively Accurate Approximation
for the Evaluation of the Faddeyeva Function},
journal = {{ACM} Trans. Math. Softw.},
volume = {44},
number = {2},
pages = {22:1--22:9},
year = {2017},
url = {https://doi.org/10.1145/3119904},
doi = {10.1145/3119904},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toms/Zaghloul17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ShiZMD17,
author = {Yishuo Shi and
Zhao Zhang and
Yuchang Mo and
Ding{-}Zhu Du},
title = {Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual
Backbone in Unit Disk Graphs},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {25},
number = {2},
pages = {925--933},
year = {2017},
url = {https://doi.org/10.1109/TNET.2016.2607723},
doi = {10.1109/TNET.2016.2607723},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/ShiZMD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tvt/ZhaoWWW17,
author = {Wentao Zhao and
Shaowei Wang and
Chonggang Wang and
Xiaobing Wu},
title = {Approximation Algorithms for Cell Planning in Heterogeneous Networks},
journal = {{IEEE} Trans. Veh. Technol.},
volume = {66},
number = {2},
pages = {1561--1572},
year = {2017},
url = {https://doi.org/10.1109/TVT.2016.2552487},
doi = {10.1109/TVT.2016.2552487},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tvt/ZhaoWWW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/XuCLLL017,
author = {Yao Xu and
Yong Chen and
Guohui Lin and
Tian Liu and
Taibo Luo and
Peng Zhang},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {A {(1.4} + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {66:1--66:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.66},
doi = {10.4230/LIPICS.ISAAC.2017.66},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/XuCLLL017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/ChenHW17,
author = {Zhi{-}Zhong Chen and
Youta Harada and
Lusheng Wang},
editor = {Zhipeng Cai and
Ovidiu Daescu and
Min Li},
title = {A New 2-Approximation Algorithm for rSPR Distance},
booktitle = {Bioinformatics Research and Applications - 13th International Symposium,
{ISBRA} 2017, Honolulu, HI, USA, May 29 - June 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10330},
pages = {128--139},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59575-7\_12},
doi = {10.1007/978-3-319-59575-7\_12},
timestamp = {Thu, 20 Aug 2020 15:58:55 +0200},
biburl = {https://dblp.org/rec/conf/isbra/ChenHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnejaMR17,
author = {Yash P. Aneja and
Asish Mukhopadhyay and
Md. Zamilur Rahman},
title = {A greedy approximation algorithm for the minimum (2, 2)-connected
dominating set problem},
journal = {CoRR},
volume = {abs/1705.09643},
year = {2017},
url = {http://arxiv.org/abs/1705.09643},
eprinttype = {arXiv},
eprint = {1705.09643},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AnejaMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FioriniGKS17,
author = {Samuel Fiorini and
Martin Gro{\ss} and
Jochen K{\"{o}}nemann and
Laura Sanit{\`{a}}},
title = {A 3/2-Approximation Algorithm for Tree Augmentation via Chv{\'{a}}tal-Gomory
Cuts},
journal = {CoRR},
volume = {abs/1702.05567},
year = {2017},
url = {http://arxiv.org/abs/1702.05567},
eprinttype = {arXiv},
eprint = {1702.05567},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FioriniGKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/XuCLL17,
author = {Yao Xu and
Yong Chen and
Taibo Luo and
Guohui Lin},
title = {A local search 2.917-approximation algorithm for duo-preservation
string mapping},
journal = {CoRR},
volume = {abs/1702.01877},
year = {2017},
url = {http://arxiv.org/abs/1702.01877},
eprinttype = {arXiv},
eprint = {1702.01877},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/XuCLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/XuCLL17a,
author = {Yao Xu and
Yong Chen and
Taibo Luo and
Guohui Lin},
title = {A {(1.4} + {\(\epsilon\)})-approximation algorithm for the 2-\{Max-Duo\}
problem},
journal = {CoRR},
volume = {abs/1702.06256},
year = {2017},
url = {http://arxiv.org/abs/1702.06256},
eprinttype = {arXiv},
eprint = {1702.06256},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/XuCLL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08488,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
title = {An {FPT} Algorithm Beating 2-Approximation for k-Cut},
journal = {CoRR},
volume = {abs/1710.08488},
year = {2017},
url = {http://arxiv.org/abs/1710.08488},
eprinttype = {arXiv},
eprint = {1710.08488},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HibiF16,
author = {Tomoya Hibi and
Toshihiro Fujito},
title = {Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {778--786},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9973-1},
doi = {10.1007/S00453-015-9973-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HibiF16.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/algorithmica/OualiMS16,
author = {Mourad El Ouali and
Peter Munstermann and
Anand Srivastav},
title = {Randomized Approximation for the Set Multicover Problem in Hypergraphs},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {574--588},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9962-9},
doi = {10.1007/S00453-014-9962-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/OualiMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/PageS16,
author = {Daniel R. Page and
Roberto Solis{-}Oba},
title = {A 3/2-Approximation Algorithm for the Graph Balancing Problem with
Two Weights},
journal = {Algorithms},
volume = {9},
number = {2},
pages = {38},
year = {2016},
url = {https://doi.org/10.3390/a9020038},
doi = {10.3390/A9020038},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/PageS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/LiuZXC16,
author = {Ming Liu and
Feifeng Zheng and
Yin{-}Feng Xu and
Chengbin Chu},
title = {Approximation algorithm for uniform quay crane scheduling at container
ports},
journal = {Discret. Math. Algorithms Appl.},
volume = {8},
number = {2},
pages = {1650018:1--1650018:9},
year = {2016},
url = {https://doi.org/10.1142/S179383091650018X},
doi = {10.1142/S179383091650018X},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/LiuZXC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/SchostS16,
author = {{\'{E}}ric Schost and
Pierre{-}Jean Spaenlehauer},
title = {A Quadratically Convergent Algorithm for Structured Low-Rank Approximation},
journal = {Found. Comput. Math.},
volume = {16},
number = {2},
pages = {457--492},
year = {2016},
url = {https://doi.org/10.1007/s10208-015-9256-x},
doi = {10.1007/S10208-015-9256-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/SchostS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ZhangSC16,
author = {Huanan Zhang and
Cong Shi and
Xiuli Chao},
title = {Technical Note - Approximation Algorithms for Perishable Inventory
Systems with Setup Costs},
journal = {Oper. Res.},
volume = {64},
number = {2},
pages = {432--440},
year = {2016},
url = {https://doi.org/10.1287/opre.2016.1485},
doi = {10.1287/OPRE.2016.1485},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ZhangSC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takazawa16,
author = {Kenjiro Takazawa},
title = {A 7/6-approximation algorithm for the minimum 2-edge connected subgraph
problem in bipartite cubic graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {550--553},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.011},
doi = {10.1016/J.IPL.2016.04.011},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Takazawa16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyL16,
author = {Julia Chuzhoy and
Shi Li},
title = {A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths
with Congestion 2},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {45:1--45:51},
year = {2016},
url = {https://doi.org/10.1145/2893472},
doi = {10.1145/2893472},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiangZL0J16,
author = {Dongyue Liang and
Zhao Zhang and
Xianliang Liu and
Wei Wang and
Yaolin Jiang},
title = {Approximation algorithms for minimum weight partial connected set
cover problem},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {696--712},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9782-5},
doi = {10.1007/S10878-014-9782-5},
timestamp = {Wed, 13 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiangZL0J16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OualiFS16,
author = {Mourad El Ouali and
Helena Fohlin and
Anand Srivastav},
title = {An approximation algorithm for the partial vertex cover problem in
hypergraphs},
journal = {J. Comb. Optim.},
volume = {31},
number = {2},
pages = {846--864},
year = {2016},
url = {https://doi.org/10.1007/s10878-014-9793-2},
doi = {10.1007/S10878-014-9793-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/OualiFS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BuyuktahtakinL16,
author = {I. Esra B{\"{u}}y{\"{u}}ktahtakin and
Ning Liu},
title = {Dynamic programming approximation algorithms for the capacitated lot-sizing
problem},
journal = {J. Glob. Optim.},
volume = {65},
number = {2},
pages = {231--259},
year = {2016},
url = {https://doi.org/10.1007/s10898-015-0349-5},
doi = {10.1007/S10898-015-0349-5},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BuyuktahtakinL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlp/BerghammerHS16,
author = {Rudolf Berghammer and
Peter H{\"{o}}fner and
Insa Stucke},
title = {Cardinality of relations and relational approximation algorithms},
journal = {J. Log. Algebraic Methods Program.},
volume = {85},
number = {2},
pages = {269--286},
year = {2016},
url = {https://doi.org/10.1016/j.jlamp.2015.12.001},
doi = {10.1016/J.JLAMP.2015.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jlp/BerghammerHS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/WadaF16,
author = {Takayuki Wada and
Yasumasa Fujisaki},
title = {Stopping Rules for Optimization Algorithms Based on Stochastic Approximation},
journal = {J. Optim. Theory Appl.},
volume = {169},
number = {2},
pages = {568--586},
year = {2016},
url = {https://doi.org/10.1007/s10957-015-0808-7},
doi = {10.1007/S10957-015-0808-7},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/WadaF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/ManciniBA16,
author = {Sara Mancini and
Francisco Bernal and
Juan A. Acebr{\'{o}}n},
title = {An Efficient Algorithm for Accelerating Monte Carlo Approximations
of the Solution to Boundary Value Problems},
journal = {J. Sci. Comput.},
volume = {66},
number = {2},
pages = {577--597},
year = {2016},
url = {https://doi.org/10.1007/s10915-015-0033-4},
doi = {10.1007/S10915-015-0033-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jscic/ManciniBA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Nagarajan016,
author = {Viswanath Nagarajan and
Cong Shi},
title = {Approximation algorithms for inventory problems with submodular or
routing costs},
journal = {Math. Program.},
volume = {160},
number = {1-2},
pages = {225--244},
year = {2016},
url = {https://doi.org/10.1007/s10107-016-0981-y},
doi = {10.1007/S10107-016-0981-Y},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Nagarajan016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MashreghiZ16,
author = {Ali Mashreghi and
Alireza Zarei},
title = {When Diameter Matters: Parameterized Approximation Algorithms for
Bounded Diameter Minimum Steiner Tree Problem},
journal = {Theory Comput. Syst.},
volume = {58},
number = {2},
pages = {287--303},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9615-7},
doi = {10.1007/S00224-015-9615-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MashreghiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Przybylowicz16,
author = {Pawel Przybylowicz},
title = {Optimal global approximation of stochastic differential equations
with additive Poisson noise},
journal = {Numer. Algorithms},
volume = {73},
number = {2},
pages = {323--348},
year = {2016},
url = {https://doi.org/10.1007/s11075-016-0097-8},
doi = {10.1007/S11075-016-0097-8},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Przybylowicz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pcs/Prokopenya16,
author = {Alexander N. Prokopenya},
title = {Approximation of a quantum algorithm for order finding},
journal = {Program. Comput. Softw.},
volume = {42},
number = {2},
pages = {90--98},
year = {2016},
url = {https://doi.org/10.1134/S0361768816020080},
doi = {10.1134/S0361768816020080},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pcs/Prokopenya16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonW16,
author = {Svante Janson and
Lutz Warnke},
title = {The lower tail: Poisson approximation revisited},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {219--246},
year = {2016},
url = {https://doi.org/10.1002/rsa.20590},
doi = {10.1002/RSA.20590},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodlaenderDDFLP16,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {A c\({}^{\mbox{k}}\) n 5-Approximation Algorithm for Treewidth},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {2},
pages = {317--378},
year = {2016},
url = {https://doi.org/10.1137/130947374},
doi = {10.1137/130947374},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BodlaenderDDFLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AustrinBG16,
author = {Per Austrin and
Siavosh Benabbas and
Konstantinos Georgiou},
title = {Better Balance by Being Biased: {A} 0.8776-Approximation for Max Bisection},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {2:1--2:27},
year = {2016},
url = {https://doi.org/10.1145/2907052},
doi = {10.1145/2907052},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AustrinBG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChuzhoyMVZ16,
author = {Julia Chuzhoy and
Yury Makarychev and
Aravindan Vijayaraghavan and
Yuan Zhou},
title = {Approximation Algorithms and Hardness of the \emph{k}-Route Cut Problem},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {1},
pages = {2:1--2:40},
year = {2016},
url = {https://doi.org/10.1145/2644814},
doi = {10.1145/2644814},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChuzhoyMVZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EfratFMPS16,
author = {Alon Efrat and
S{\'{a}}ndor P. Fekete and
Joseph S. B. Mitchell and
Valentin Polishchuk and
Jukka Suomela},
title = {Improved Approximation Algorithms for Relay Placement},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {20:1--20:28},
year = {2016},
url = {https://doi.org/10.1145/2814938},
doi = {10.1145/2814938},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EfratFMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KortsarzN16,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity
of a Graph from 1 to 2},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {23:1--23:20},
year = {2016},
url = {https://doi.org/10.1145/2786981},
doi = {10.1145/2786981},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KortsarzN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WuZW16,
author = {Di Wu and
Zhao Zhang and
Weili Wu},
title = {Approximation algorithm for the balanced 2-connected k-partition problem},
journal = {Theor. Comput. Sci.},
volume = {609},
pages = {627--638},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.02.001},
doi = {10.1016/J.TCS.2015.02.001},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WuZW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/Li0WR16,
author = {Shuhui Li and
Miao Song and
Peng{-}Jun Wan and
Shangping Ren},
title = {A 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive
Applications to Maximize Total Accrued Utility Value},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {27},
number = {7},
pages = {1864--1878},
year = {2016},
url = {https://doi.org/10.1109/TPDS.2015.2474360},
doi = {10.1109/TPDS.2015.2474360},
timestamp = {Thu, 07 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/Li0WR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tvlsi/HoY16,
author = {Yung{-}Hsiang Ho and
Chia{-}Yu Yao},
title = {A Fast-Acquisition All-Digital Delay-Locked Loop Using a Starting-Bit
Prediction Algorithm for the Successive-Approximation Register},
journal = {{IEEE} Trans. Very Large Scale Integr. Syst.},
volume = {24},
number = {2},
pages = {759--763},
year = {2016},
url = {https://doi.org/10.1109/TVLSI.2015.2407577},
doi = {10.1109/TVLSI.2015.2407577},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tvlsi/HoY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/BenkocziGT16,
author = {Robert Benkoczi and
Daya Ram Gaur and
Mark Thom},
editor = {Marek Chrobak and
Antonio Fern{\'{a}}ndez Anta and
Leszek Gasieniec and
Ralf Klasing},
title = {A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform
Sensors on a Line},
booktitle = {Algorithms for Sensor Systems - 12th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2016,
Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10050},
pages = {95--111},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-53058-1\_7},
doi = {10.1007/978-3-319-53058-1\_7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/BenkocziGT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/LyuU16,
author = {Yangdi Lyu and
Alper {\"{U}}ng{\"{o}}r},
editor = {Thomas C. Shermer},
title = {A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains},
booktitle = {Proceedings of the 28th Canadian Conference on Computational Geometry,
{CCCG} 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada},
pages = {161--167},
publisher = {Simon Fraser University, Vancouver, British Columbia, Canada},
year = {2016},
timestamp = {Thu, 12 Mar 2020 11:28:28 +0100},
biburl = {https://dblp.org/rec/conf/cccg/LyuU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BoriaCCPPQ16,
author = {Nicolas Boria and
Gianpiero Cabodi and
Paolo Camurati and
Marco Palena and
Paolo Pasini and
Stefano Quer},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String
Mapping Problem},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {11:1--11:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.11},
doi = {10.4230/LIPICS.CPM.2016.11},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BoriaCCPPQ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/SchalekampZS16,
author = {Frans Schalekamp and
Anke van Zuylen and
Suzanne van der Ster},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {70:1--70:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.70},
doi = {10.4230/LIPICS.ICALP.2016.70},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/SchalekampZS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/CohenMMP16,
author = {Johanne Cohen and
Khaled Maamra and
George Manoussakis and
Laurence Pilard},
editor = {Panagiota Fatourou and
Ernesto Jim{\'{e}}nez and
Fernando Pedone},
title = {Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation
Ratio 2/3},
booktitle = {20th International Conference on Principles of Distributed Systems,
{OPODIS} 2016, December 13-16, 2016, Madrid, Spain},
series = {LIPIcs},
volume = {70},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2016.11},
doi = {10.4230/LIPICS.OPODIS.2016.11},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/opodis/CohenMMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sarnoff/ChenCWHHS16,
author = {Shuo{-}Han Chen and
Tseng{-}Yi Chen and
Hsin{-}Wen Wei and
Tsan{-}sheng Hsu and
Chen{-}Hung Huang and
Wei{-}Kuan Shih},
title = {Improving the 3-star approximation algorithm for relay node placement
in wireless sensor network},
booktitle = {37th {IEEE} Sarnoff Symposium 2016, Newark, NJ, USA, September 19-21,
2016},
pages = {1--2},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/SARNOF.2016.7846724},
doi = {10.1109/SARNOF.2016.7846724},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sarnoff/ChenCWHHS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/siamcsc/KhanP16,
author = {Arif M. Khan and
Alex Pothen},
editor = {Assefaw Hadish Gebremedhin and
Erik G. Boman and
Bora U{\c{c}}ar},
title = {A New 3/2-Approximation Algorithm for the \emph{b}-Edge Cover Problem},
booktitle = {2016 Proceedings of the Seventh {SIAM} Workshop on Combinatorial Scientific
Computing, {CSC} 2016, Albuquerque, New Mexico, USA, October 10-12,
2016},
pages = {52--61},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974690.ch6},
doi = {10.1137/1.9781611974690.CH6},
timestamp = {Tue, 04 Jul 2017 08:59:39 +0200},
biburl = {https://dblp.org/rec/conf/siamcsc/KhanP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
editor = {Rasmus Pagh},
title = {Approximation Algorithms for Node-Weighted Prize-Collecting Steiner
Tree Problems on Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {2:1--2:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.2},
doi = {10.4230/LIPICS.SWAT.2016.2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenMW16,
author = {Zhi{-}Zhong Chen and
Eita Machida and
Lusheng Wang},
title = {A Cubic-Time 2-Approximation Algorithm for rSPR Distance},
journal = {CoRR},
volume = {abs/1609.04029},
year = {2016},
url = {http://arxiv.org/abs/1609.04029},
eprinttype = {arXiv},
eprint = {1609.04029},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChenMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenMMP16,
author = {Johanne Cohen and
Khaled Maamra and
George Manoussakis and
Laurence Pilard},
title = {The Mann et al. self-stabilizing 2/3-approximation matching algorithm
is sub-exponential},
journal = {CoRR},
volume = {abs/1604.08066},
year = {2016},
url = {http://arxiv.org/abs/1604.08066},
eprinttype = {arXiv},
eprint = {1604.08066},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenMMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenMMP16a,
author = {Johanne Cohen and
Khaled Ma{\^{a}}mra and
George Manoussakis and
Laurence Pilard},
title = {Polynomial self-stabilizing algorithm and proof for a 2/3-approximation
of a maximum matching},
journal = {CoRR},
volume = {abs/1611.06038},
year = {2016},
url = {http://arxiv.org/abs/1611.06038},
eprinttype = {arXiv},
eprint = {1611.06038},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenMMP16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LyuU16,
author = {Yangdi Lyu and
Alper {\"{U}}ng{\"{o}}r},
title = {A Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains},
journal = {CoRR},
volume = {abs/1605.03271},
year = {2016},
url = {http://arxiv.org/abs/1605.03271},
eprinttype = {arXiv},
eprint = {1605.03271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LyuU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Narayan16,
author = {Vishnu V. Narayan},
title = {A 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs
on graphs with minimum degree at least 3},
journal = {CoRR},
volume = {abs/1612.04790},
year = {2016},
url = {http://arxiv.org/abs/1612.04790},
eprinttype = {arXiv},
eprint = {1612.04790},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Narayan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Zehmakan16,
author = {Abdolahad Noori Zehmakan},
title = {Bin Packing Problem: {A} Linear Constant-Space 3/2-Approximation Algorithm},
journal = {CoRR},
volume = {abs/1610.08820},
year = {2016},
url = {http://arxiv.org/abs/1610.08820},
eprinttype = {arXiv},
eprint = {1610.08820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Zehmakan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiDXX15,
author = {Yu Li and
Donglei Du and
Naihua Xiu and
Dachuan Xu},
title = {Improved Approximation Algorithms for the Facility Location Problems
with Linear/Submodular Penalties},
journal = {Algorithmica},
volume = {73},
number = {2},
pages = {460--482},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9911-7},
doi = {10.1007/S00453-014-9911-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiDXX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Kirkpatrick15,
author = {David G. Kirkpatrick},
title = {An O(lg lg OPT)-Approximation Algorithm for Multi-guarding Galleries},
journal = {Discret. Comput. Geom.},
volume = {53},
number = {2},
pages = {327--343},
year = {2015},
url = {https://doi.org/10.1007/s00454-014-9656-8},
doi = {10.1007/S00454-014-9656-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Kirkpatrick15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AardalBGL15,
author = {Karen I. Aardal and
Pieter L. van den Berg and
Dion Gijswijt and
Shanfei Li},
title = {Approximation algorithms for hard capacitated k-facility location
problems},
journal = {Eur. J. Oper. Res.},
volume = {242},
number = {2},
pages = {358--368},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2014.10.011},
doi = {10.1016/J.EJOR.2014.10.011},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AardalBGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/XuR15,
author = {Zhou Xu and
Brian Rodrigues},
title = {A 3/2-Approximation Algorithm for the Multiple {TSP} with a Fixed
Number of Depots},
journal = {{INFORMS} J. Comput.},
volume = {27},
number = {4},
pages = {636--645},
year = {2015},
url = {https://doi.org/10.1287/ijoc.2015.0650},
doi = {10.1287/IJOC.2015.0650},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/XuR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GavalasKMPV15,
author = {Damianos Gavalas and
Charalampos Konstantopoulos and
Konstantinos Mastakas and
Grammati E. Pantziou and
Nikolaos Vathis},
title = {Approximation algorithms for the arc orienteering problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {313--315},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.10.003},
doi = {10.1016/J.IPL.2014.10.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GavalasKMPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/M15,
author = {Jagadish M},
title = {An approximation algorithm for the cutting-sticks problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {170--174},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.007},
doi = {10.1016/J.IPL.2014.09.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/M15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YazdiBMK15,
author = {Ehsan Najafi Yazdi and
Alireza Bagheri and
Zahra Moezkarimi and
Hamidreza Keshavarz},
title = {An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag
problem},
journal = {Inf. Process. Lett.},
volume = {115},
number = {6-8},
pages = {618--622},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.02.011},
doi = {10.1016/J.IPL.2015.02.011},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YazdiBMK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/WeiHLP15,
author = {Chia{-}Chen Wei and
Sun{-}Yuan Hsieh and
Chia{-}Wei Lee and
Sheng{-}Lung Peng},
title = {An improved approximation algorithm for the partial-terminal Steiner
tree problem with edge cost 1 or 2},
journal = {J. Discrete Algorithms},
volume = {35},
pages = {62--71},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.10.003},
doi = {10.1016/J.JDA.2015.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/WeiHLP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/WeiA15,
author = {Zhou Wei and
M. Montaz Ali},
title = {Convex mixed integer nonlinear programming problems and an outer approximation
algorithm},
journal = {J. Glob. Optim.},
volume = {63},
number = {2},
pages = {213--227},
year = {2015},
url = {https://doi.org/10.1007/s10898-015-0284-5},
doi = {10.1007/S10898-015-0284-5},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/WeiA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/WeiA15,
author = {Zhou Wei and
M. Montaz Ali},
title = {Outer Approximation Algorithm for One Class of Convex Mixed-Integer
Nonlinear Programming Problems with Partial Differentiability},
journal = {J. Optim. Theory Appl.},
volume = {167},
number = {2},
pages = {644--652},
year = {2015},
url = {https://doi.org/10.1007/s10957-015-0715-y},
doi = {10.1007/S10957-015-0715-Y},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/WeiA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CouetouxDW15,
author = {Basile Cou{\"{e}}toux and
James M. Davis and
David P. Williamson},
title = {A 3/2-approximation algorithm for some minimum-cost graph problems},
journal = {Math. Program.},
volume = {150},
number = {1},
pages = {19--34},
year = {2015},
url = {https://doi.org/10.1007/s10107-013-0727-z},
doi = {10.1007/S10107-013-0727-Z},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/CouetouxDW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HuangK15,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha},
title = {Improved approximation algorithms for two variants of the stable marriage
problem with ties},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {353--380},
year = {2015},
url = {https://doi.org/10.1007/s10107-015-0923-0},
doi = {10.1007/S10107-015-0923-0},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HuangK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Solis-ObaP15,
author = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {1--2},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9555-7},
doi = {10.1007/S00224-014-9555-7},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Solis-ObaP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/HaussermannG15,
author = {John Haussermann and
Robert A. Van Gorder},
title = {Efficient low-error analytical-numerical approximations for radial
solutions of nonlinear Laplace equations},
journal = {Numer. Algorithms},
volume = {70},
number = {2},
pages = {227--248},
year = {2015},
url = {https://doi.org/10.1007/s11075-014-9944-7},
doi = {10.1007/S11075-014-9944-7},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/HaussermannG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/SantosS15,
author = {Pedro Jorge Sousa dos Santos and
Susana Scheimberg},
title = {An outer approximation algorithm for equilibrium problems in Hilbert
spaces},
journal = {Optim. Methods Softw.},
volume = {30},
number = {2},
pages = {379--390},
year = {2015},
url = {https://doi.org/10.1080/10556788.2014.961019},
doi = {10.1080/10556788.2014.961019},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/SantosS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/BittnerB15,
author = {Kai Bittner and
Hans Georg Brachtendorf},
title = {Fast Algorithms for Adaptive Free Knot Spline Approximation Using
Nonuniform Biorthogonal Spline Wavelets},
journal = {{SIAM} J. Sci. Comput.},
volume = {37},
number = {2},
year = {2015},
url = {https://doi.org/10.1137/14095354X},
doi = {10.1137/14095354X},
timestamp = {Thu, 30 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/BittnerB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcas/JridiAM15,
author = {Maher Jridi and
Ayman Alfalou and
Pramod Kumar Meher},
title = {A Generalized Algorithm and Reconfigurable Architecture for Efficient
and Scalable Orthogonal Approximation of {DCT}},
journal = {{IEEE} Trans. Circuits Syst. {I} Regul. Pap.},
volume = {62-I},
number = {2},
pages = {449--457},
year = {2015},
url = {https://doi.org/10.1109/TCSI.2014.2360763},
doi = {10.1109/TCSI.2014.2360763},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcas/JridiAM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cis/LiZ15a,
author = {Jinquan Li and
Jinhua Zhang},
title = {A 2-Approximation Algorithm for the Single Machine Due Date Assignment
Scheduling Problem in Fuzzy Environment to Minimize the Total Costs},
booktitle = {11th International Conference on Computational Intelligence and Security,
{CIS} 2015, Shenzhen, China, December 19-20, 2015},
pages = {104--108},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/CIS.2015.33},
doi = {10.1109/CIS.2015.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cis/LiZ15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bar-NoyPRV15,
author = {Amotz Bar{-}Noy and
David Peleg and
George Rabanca and
Ivo Vigan},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Improved Approximation Algorithms for Weighted 2-Path Partitions},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {953--964},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_79},
doi = {10.1007/978-3-662-48350-3\_79},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/Bar-NoyPRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/PourhassanGN15,
author = {Mojgan Pourhassan and
Wanru Gao and
Frank Neumann},
editor = {Sara Silva and
Anna Isabel Esparcia{-}Alc{\'{a}}zar},
title = {Maintaining 2-Approximations for the Dynamic Vertex Cover Problem
Using Evolutionary Algorithms},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference,
{GECCO} 2015, Madrid, Spain, July 11-15, 2015},
pages = {903--910},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2739480.2754700},
doi = {10.1145/2739480.2754700},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/PourhassanGN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MomkeW15,
author = {Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {A (2+{\textbackslash}epsilon {)} {(} 2 + {\unicode{1013}} {)} -Approximation
Algorithm for the Storage Allocation Problem},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {973--984},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_79},
doi = {10.1007/978-3-662-47672-7\_79},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/MomkeW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Bar-YehudaKR15,
author = {Reuven Bar{-}Yehuda and
Gilad Kutiel and
Dror Rawitz},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {1.5-Approximation Algorithm for the 2-Convex Recoloring Problem},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {299--311},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_25},
doi = {10.1007/978-3-319-29516-9\_25},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Bar-YehudaKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KortsarzN15,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A simplified 1.5-approximation algorithm for augmenting edge-connectivity
of a graph from 1 to 2},
journal = {CoRR},
volume = {abs/1507.02799},
year = {2015},
url = {http://arxiv.org/abs/1507.02799},
eprinttype = {arXiv},
eprint = {1507.02799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KortsarzN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KotrbcikS15,
author = {Michal Kotrbc{\'{\i}}k and
Martin Skoviera},
title = {Simple greedy 2-approximation algorithm for the maximum genus of a
graph},
journal = {CoRR},
volume = {abs/1501.07460},
year = {2015},
url = {http://arxiv.org/abs/1501.07460},
eprinttype = {arXiv},
eprint = {1501.07460},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KotrbcikS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchalekampZS15,
author = {Frans Schalekamp and
Anke van Zuylen and
Suzanne van der Ster},
title = {A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest},
journal = {CoRR},
volume = {abs/1511.06000},
year = {2015},
url = {http://arxiv.org/abs/1511.06000},
eprinttype = {arXiv},
eprint = {1511.06000},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SchalekampZS15.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/algorithmica/ChenW14a,
author = {Danny Z. Chen and
Haitao Wang},
title = {Outlier Respecting Points Approximation},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {410--430},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9738-z},
doi = {10.1007/S00453-012-9738-Z},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenW14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KammerT14,
author = {Frank Kammer and
Torsten Tholey},
title = {Approximation Algorithms for Intersection Graphs},
journal = {Algorithmica},
volume = {68},
number = {2},
pages = {312--336},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9671-1},
doi = {10.1007/S00453-012-9671-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KammerT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhaniS14,
author = {M. Reza Khani and
Mohammad R. Salavatipour},
title = {Improved Approximation Algorithms for the Min-max Tree Cover and Bounded
Tree Cover Problems},
journal = {Algorithmica},
volume = {69},
number = {2},
pages = {443--460},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9740-5},
doi = {10.1007/S00453-012-9740-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhaniS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/Paluch14,
author = {Katarzyna E. Paluch},
title = {Faster and Simpler Approximation of Stable Matchings},
journal = {Algorithms},
volume = {7},
number = {2},
pages = {189--202},
year = {2014},
url = {https://doi.org/10.3390/a7020189},
doi = {10.3390/A7020189},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/Paluch14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/alr/KuoK14,
author = {Shyi{-}Shiun Kuo and
Chia{-}Nan Ko},
title = {Adaptive annealing learning algorithm-based robust wavelet neural
networks for function approximation with outliers},
journal = {Artif. Life Robotics},
volume = {19},
number = {2},
pages = {186--192},
year = {2014},
url = {https://doi.org/10.1007/s10015-014-0150-4},
doi = {10.1007/S10015-014-0150-4},
timestamp = {Fri, 27 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/alr/KuoK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/ImahoriMM14,
author = {Shinji Imahori and
Tomomi Matsui and
Ryuhei Miyashiro},
title = {A 2.75-approximation algorithm for the unconstrained traveling tournament
problem},
journal = {Ann. Oper. Res.},
volume = {218},
number = {1},
pages = {237--247},
year = {2014},
url = {https://doi.org/10.1007/s10479-012-1161-y},
doi = {10.1007/S10479-012-1161-Y},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/ImahoriMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LiGHL14,
author = {Jianping Li and
Yu Ge and
Shuai He and
Junran Lichen},
title = {Approximation algorithms for constructing some required structures
in digraphs},
journal = {Eur. J. Oper. Res.},
volume = {232},
number = {2},
pages = {307--314},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.07.033},
doi = {10.1016/J.EJOR.2013.07.033},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LiGHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/SrivastavaB14,
author = {Vaibhav Srivastava and
Francesco Bullo},
title = {Knapsack problems with sigmoid utilities: Approximation algorithms
via hybrid optimization},
journal = {Eur. J. Oper. Res.},
volume = {236},
number = {2},
pages = {488--498},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.12.035},
doi = {10.1016/J.EJOR.2013.12.035},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/SrivastavaB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/SachdevaV14,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Faster Algorithms via Approximation Theory},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {9},
number = {2},
pages = {125--210},
year = {2014},
url = {https://doi.org/10.1561/0400000065},
doi = {10.1561/0400000065},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/SachdevaV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/UrumaKTF14,
author = {Kazunori Uruma and
Katsumi Konishi and
Tomohiro Takahashi and
Toshihiro Furukawa},
title = {An Iterative Reweighted Least Squares Algorithm with Finite Series
Approximation for a Sparse Signal Recovery},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {97-D},
number = {2},
pages = {319--322},
year = {2014},
url = {https://doi.org/10.1587/transinf.E97.D.319},
doi = {10.1587/TRANSINF.E97.D.319},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/UrumaKTF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/LiT14,
author = {Yuchao Li and
Jianhua Tu},
title = {A 2-approximation algorithm for the vertex cover \emph{P}\({}_{\mbox{4}}\)
problem in cubic graphs},
journal = {Int. J. Comput. Math.},
volume = {91},
number = {10},
pages = {2103--2108},
year = {2014},
url = {https://doi.org/10.1080/00207160.2014.881476},
doi = {10.1080/00207160.2014.881476},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/LiT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijmor/KhobragadeVL14,
author = {N. W. Khobragade and
N. V. Vaidya and
Navneet K. Lamba},
title = {Approximation algorithm for optimal solution to the linear programming
problem},
journal = {Int. J. Math. Oper. Res.},
volume = {6},
number = {2},
pages = {139--154},
year = {2014},
url = {https://doi.org/10.1504/IJMOR.2014.059528},
doi = {10.1504/IJMOR.2014.059528},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijmor/KhobragadeVL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/CarlssonJL14,
author = {John Gunnar Carlsson and
Fan Jia and
Ying Li},
title = {An Approximation Algorithm for the Continuous k-Medians Problem in
a Convex Polygon},
journal = {{INFORMS} J. Comput.},
volume = {26},
number = {2},
pages = {280--289},
year = {2014},
url = {https://doi.org/10.1287/ijoc.2013.0564},
doi = {10.1287/IJOC.2013.0564},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/CarlssonJL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiLG14,
author = {Weidong Li and
Jianping Li and
Li Guan},
title = {Approximation algorithms for the ring loading problem with penalty
cost},
journal = {Inf. Process. Lett.},
volume = {114},
number = {1-2},
pages = {56--59},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2013.08.004},
doi = {10.1016/J.IPL.2013.08.004},
timestamp = {Tue, 14 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/LiLG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuDX14,
author = {Zi Xu and
Donglei Du and
Dachuan Xu},
title = {Improved approximation algorithms for the max-bisection and the disjoint
2-catalog segmentation problems},
journal = {J. Comb. Optim.},
volume = {27},
number = {2},
pages = {315--327},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9526-3},
doi = {10.1007/S10878-012-9526-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/XuDX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/AssariAD14,
author = {Pouria Assari and
Hojatollah Adibi and
Mehdi Dehghan},
title = {A meshless method based on the moving least squares {(MLS)} approximation
for the numerical solution of two-dimensional nonlinear integral equations
of the second kind on non-rectangular domains},
journal = {Numer. Algorithms},
volume = {67},
number = {2},
pages = {423--455},
year = {2014},
url = {https://doi.org/10.1007/s11075-013-9800-1},
doi = {10.1007/S11075-013-9800-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/AssariAD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/XuLLW14,
author = {Zhou Xu and
Xiaofan Lai and
Andrew Lim and
Fan Wang},
title = {An improved approximation algorithm for the capacitated {TSP} with
pickup and delivery on a tree},
journal = {Networks},
volume = {63},
number = {2},
pages = {179--195},
year = {2014},
url = {https://doi.org/10.1002/net.21535},
doi = {10.1002/NET.21535},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/XuLLW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BonsmaSW14,
author = {Paul S. Bonsma and
Jens Schulz and
Andreas Wiese},
title = {A Constant-Factor Approximation Algorithm for Unsplittable Flow on
Paths},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {2},
pages = {767--799},
year = {2014},
url = {https://doi.org/10.1137/120868360},
doi = {10.1137/120868360},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BonsmaSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CaragiannisKKP14,
author = {Ioannis Caragiannis and
Christos Kaklamanis and
Nikos Karanikolas and
Ariel D. Procaccia},
title = {Socially desirable approximations for dodgson's voting rule},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {2},
pages = {6:1--6:28},
year = {2014},
url = {https://doi.org/10.1145/2556950},
doi = {10.1145/2556950},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/CaragiannisKKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeraG0R14,
author = {Suman Kalyan Bera and
Shalmoli Gupta and
Amit Kumar and
Sambuddha Roy},
title = {Approximation algorithms for the partition vertex cover problem},
journal = {Theor. Comput. Sci.},
volume = {555},
pages = {2--8},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.04.006},
doi = {10.1016/J.TCS.2014.04.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeraG0R14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tgrs/LiuZXHL14,
author = {Jianhua Liu and
Jinfang Zhang and
Fanjiang Xu and
Zhijian Huang and
Yaping Li},
title = {Adaptive Algorithm for Automated Polygonal Approximation of High Spatial
Resolution Remote Sensing Imagery Segmentation Contours},
journal = {{IEEE} Trans. Geosci. Remote. Sens.},
volume = {52},
number = {2},
pages = {1099--1106},
year = {2014},
url = {https://doi.org/10.1109/TGRS.2013.2247407},
doi = {10.1109/TGRS.2013.2247407},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tgrs/LiuZXHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toit/HoeferKV14,
author = {Martin Hoefer and
Thomas Kesselheim and
Berthold V{\"{o}}cking},
title = {Approximation Algorithms for Secondary Spectrum Auctions},
journal = {{ACM} Trans. Internet Techn.},
volume = {14},
number = {2-3},
pages = {16:1--16:24},
year = {2014},
url = {https://doi.org/10.1145/2663496},
doi = {10.1145/2663496},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toit/HoeferKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/wpc/TangCLY14,
author = {Ling Tang and
Hao Chen and
Shaohua Lan and
Yan Yu},
title = {Approximation Algorithm for Joint Node Placement and Frequency Selection
in Bistatic Radar Sensor Networks},
journal = {Wirel. Pers. Commun.},
volume = {78},
number = {2},
pages = {1257--1276},
year = {2014},
url = {https://doi.org/10.1007/s11277-014-1816-x},
doi = {10.1007/S11277-014-1816-X},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/wpc/TangCLY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/WuZWH14,
author = {Di Wu and
Zhao Zhang and
Weili Wu and
Xiaohui Huang},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Approximation Algorithm for the Balanced 2-Connected Bipartition Problem},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {441--452},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_38},
doi = {10.1007/978-3-319-08783-2\_38},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/WuZWH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eucc/VuilleminPA14a,
author = {Pierre Vuillemin and
Charles Poussot{-}Vassal and
Daniel Alazard},
title = {Poles residues descent algorithm for optimal frequency-limited {\(\mathscr{H}\)}2
model approximation},
booktitle = {13th European Control Conference, {ECC} 2014, Strasbourg, France,
June 24-27, 2014},
pages = {1080--1085},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ECC.2014.6862152},
doi = {10.1109/ECC.2014.6862152},
timestamp = {Thu, 11 Feb 2021 14:14:57 +0100},
biburl = {https://dblp.org/rec/conf/eucc/VuilleminPA14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/intcompsymp/LinW14,
author = {Chen{-}Wan Lin and
Bang Ye Wu},
editor = {William Cheng{-}Chung Chu and
Han{-}Chieh Chao and
Stephen Jenn{-}Hwa Yang},
title = {A 2-approximation algorithm for the clustered minimum routing cost
tree problem},
booktitle = {Intelligent Systems and Applications - Proceedings of the International
Computer Symposium {(ICS)} held at Taichung, Taiwan, December 12-14,
2014},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {274},
pages = {3--10},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-484-8-3},
doi = {10.3233/978-1-61499-484-8-3},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/intcompsymp/LinW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DurocherFFM014,
author = {Stephane Durocher and
Omrit Filtser and
Robert Fraser and
Ali D. Mehrabi and
Saeed Mehrabi},
editor = {Alberto Pardo and
Alfredo Viola},
title = {A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries
with Sliding Cameras},
booktitle = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {294--305},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54423-1\_26},
doi = {10.1007/978-3-642-54423-1\_26},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/DurocherFFM014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fujito14,
author = {Toshihiro Fujito},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {On Matchings and b-Edge Dominating Sets: {A} 2-Approximation Algorithm
for the 3-Edge Dominating Set Problem},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {206--216},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_18},
doi = {10.1007/978-3-319-08404-6\_18},
timestamp = {Sun, 02 Jun 2019 21:15:18 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fujito14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Robenek13,
author = {Christina Robenek},
title = {Approximation Algorithms for 2-dimensional Packing and Related Scheduling
Problems},
school = {University of Kiel},
year = {2013},
url = {http://eldiss.uni-kiel.de/macau/receive/dissertation\_diss\_00011215},
urn = {urn:nbn:de:gbv:8-diss-112153},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Robenek13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigeIMN13,
author = {Uriel Feige and
Nicole Immorlica and
Vahab S. Mirrokni and
Hamid Nazerzadeh},
title = {{PASS} Approximation: {A} Framework for Analyzing and Designing Heuristics},
journal = {Algorithmica},
volume = {66},
number = {2},
pages = {450--478},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9646-2},
doi = {10.1007/S00453-012-9646-2},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigeIMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/XuXX13,
author = {Liang Xu and
Zhou Xu and
Dongsheng Xu},
title = {Exact and approximation algorithms for the min-max k-traveling salesmen
problem on a tree},
journal = {Eur. J. Oper. Res.},
volume = {227},
number = {2},
pages = {284--292},
year = {2013},
url = {https://doi.org/10.1016/j.ejor.2012.12.023},
doi = {10.1016/J.EJOR.2012.12.023},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/XuXX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/HiraishiK13,
author = {Kunihiko Hiraishi and
Koichi Kobayashi},
title = {An approximation algorithm for box abstraction of transition systems
on real state spaces},
journal = {Formal Methods Syst. Des.},
volume = {42},
number = {2},
pages = {175--192},
year = {2013},
url = {https://doi.org/10.1007/s10703-012-0175-z},
doi = {10.1007/S10703-012-0175-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/HiraishiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijnc/KusumotoYI13,
author = {Mitsuru Kusumoto and
Yuichi Yoshida and
Hiro Ito},
title = {Constant-Time Approximation Algorithms for the Optimum Branching Problem
on Sparse Graphs},
journal = {Int. J. Netw. Comput.},
volume = {3},
number = {2},
pages = {205--216},
year = {2013},
url = {http://www.ijnc.org/index.php/ijnc/article/view/63},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijnc/KusumotoYI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CaragiannisKK13,
author = {Ioannis Caragiannis and
Christos Kaklamanis and
Maria Kyropoulou},
title = {Tight approximation bounds for combinatorial frugal coverage algorithms},
journal = {J. Comb. Optim.},
volume = {26},
number = {2},
pages = {292--309},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9464-0},
doi = {10.1007/S10878-012-9464-0},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CaragiannisKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Nguyen13,
author = {Viet Hung Nguyen},
title = {A primal-dual approximation algorithm for the Asymmetric Prize-Collecting
{TSP}},
journal = {J. Comb. Optim.},
volume = {25},
number = {2},
pages = {265--278},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9501-z},
doi = {10.1007/S10878-012-9501-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Nguyen13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Weng13,
author = {Kerui Weng},
title = {Approximation algorithm for uniform bounded facility location problem},
journal = {J. Comb. Optim.},
volume = {26},
number = {2},
pages = {284--291},
year = {2013},
url = {https://doi.org/10.1007/s10878-012-9461-3},
doi = {10.1007/S10878-012-9461-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Weng13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mbec/WangCZLLB13,
author = {Xin Wang and
Xu Cao and
Bin Zhang and
Fei Liu and
Jianwen Luo and
Jing Bai},
title = {A hybrid reconstruction algorithm for fluorescence tomography using
Kirchhoff approximation and finite element method},
journal = {Medical Biol. Eng. Comput.},
volume = {51},
number = {1-2},
pages = {7--17},
year = {2013},
url = {https://doi.org/10.1007/s11517-012-0953-1},
doi = {10.1007/S11517-012-0953-1},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mbec/WangCZLLB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AggarwalLBGGGJ13,
author = {Ankit Aggarwal and
Anand Louis and
Manisha Bansal and
Naveen Garg and
Neelima Gupta and
Shubham Gupta and
Surabhi Jain},
title = {A 3-approximation algorithm for the facility location problem with
uniform capacities},
journal = {Math. Program.},
volume = {141},
number = {1-2},
pages = {527--547},
year = {2013},
url = {https://doi.org/10.1007/s10107-012-0565-4},
doi = {10.1007/S10107-012-0565-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AggarwalLBGGGJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/ChenLTAC13,
author = {Chang{-}Ming Chen and
Fawang Liu and
Ian W. Turner and
Vo Anh and
Y. Chen},
title = {Numerical approximation for a variable-order nonlinear reaction-subdiffusion
equation},
journal = {Numer. Algorithms},
volume = {63},
number = {2},
pages = {265--290},
year = {2013},
url = {https://doi.org/10.1007/s11075-012-9622-6},
doi = {10.1007/S11075-012-9622-6},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/ChenLTAC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/SegalI13,
author = {Ben Segal and
Mark A. Iwen},
title = {Improved sparse fourier approximation results: faster implementations
and stronger guarantees},
journal = {Numer. Algorithms},
volume = {63},
number = {2},
pages = {239--263},
year = {2013},
url = {https://doi.org/10.1007/s11075-012-9621-7},
doi = {10.1007/S11075-012-9621-7},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/SegalI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamco/VasudevanGBS13a,
author = {Ramanarayan Vasudevan and
Humberto Gonz{\'{a}}lez and
Ruzena Bajcsy and
S. Shankar Sastry},
title = {Consistent Approximations for the Optimal Control of Constrained Switched
Systems - Part 2: An Implementable Algorithm},
journal = {{SIAM} J. Control. Optim.},
volume = {51},
number = {6},
pages = {4484--4503},
year = {2013},
url = {https://doi.org/10.1137/120901507},
doi = {10.1137/120901507},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamco/VasudevanGBS13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/IshtevaAD13,
author = {Mariya Ishteva and
Pierre{-}Antoine Absil and
Paul Van Dooren},
title = {Jacobi Algorithm for the Best Low Multilinear Rank Approximation of
Symmetric Tensors},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {34},
number = {2},
pages = {651--672},
year = {2013},
url = {https://doi.org/10.1137/11085743X},
doi = {10.1137/11085743X},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/IshtevaAD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HochbaumL13,
author = {Dorit S. Hochbaum and
Asaf Levin},
title = {Approximation Algorithms for a Minimization Variant of the Order-Preserving
Submatrices and for Biclustering Problems},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {2},
pages = {19:1--19:12},
year = {2013},
url = {https://doi.org/10.1145/2438645.2438651},
doi = {10.1145/2438645.2438651},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/HochbaumL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KawarabayashiK13,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi},
title = {An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem
in Eulerian Planar Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {2},
pages = {16:1--16:13},
year = {2013},
url = {https://doi.org/10.1145/2438645.2438648},
doi = {10.1145/2438645.2438648},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KawarabayashiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CohenN13,
author = {Nachshon Cohen and
Zeev Nutov},
title = {A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity
augmentation of trees with constant radius},
journal = {Theor. Comput. Sci.},
volume = {489-490},
pages = {67--74},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.04.004},
doi = {10.1016/J.TCS.2013.04.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CohenN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FurerGK13,
author = {Martin F{\"{u}}rer and
Serge Gaspers and
Shiva Prasad Kasiviswanathan},
title = {An exponential time 2-approximation algorithm for bandwidth},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {23--31},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.03.024},
doi = {10.1016/J.TCS.2013.03.024},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FurerGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeJPC13,
author = {Jing (Selena) He and
Shouling Ji and
Yi Pan and
Zhipeng Cai},
title = {Approximation algorithms for load-balanced virtual backbone construction
in wireless sensor networks},
journal = {Theor. Comput. Sci.},
volume = {507},
pages = {2--16},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.11.020},
doi = {10.1016/J.TCS.2012.11.020},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeJPC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiDXX13,
author = {Yu Li and
Donglei Du and
Naihua Xiu and
Dachuan Xu},
title = {A combinatorial 2.375-approximation algorithm for the facility location
problem with submodular penalties},
journal = {Theor. Comput. Sci.},
volume = {476},
pages = {109--117},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.11.037},
doi = {10.1016/J.TCS.2012.11.037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiDXX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmc/TiwariDT13,
author = {Ravi Tiwari and
Thang N. Dinh and
My T. Thai},
title = {On Centralized and Localized Approximation Algorithms for Interference-Aware
Broadcast Scheduling},
journal = {{IEEE} Trans. Mob. Comput.},
volume = {12},
number = {2},
pages = {233--247},
year = {2013},
url = {https://doi.org/10.1109/TMC.2011.270},
doi = {10.1109/TMC.2011.270},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tmc/TiwariDT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tomacs/CorffF13,
author = {Sylvain Le Corff and
Gersende Fort},
title = {Convergence of a Particle-Based Approximation of the Block Online
Expectation Maximization Algorithm},
journal = {{ACM} Trans. Model. Comput. Simul.},
volume = {23},
number = {1},
pages = {2:1--2:22},
year = {2013},
url = {https://doi.org/10.1145/2414416.2414418},
doi = {10.1145/2414416.2414418},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tomacs/CorffF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcit/BhattaS13,
author = {Bijaya Kishor Bhatta and
D. Pushparaj Shetty},
editor = {Chittaranjan Hota and
Pradip K. Srimani},
title = {A Parallel 2-Approximation NC-Algorithm for Range Assignment Problem
in Packet Radio Networks},
booktitle = {Distributed Computing and Internet Technology, 9th International Conference,
{ICDCIT} 2013, Bhubaneswar, India, February 5-8, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7753},
pages = {137--144},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36071-8\_10},
doi = {10.1007/978-3-642-36071-8\_10},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/icdcit/BhattaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TongCWXXGL13,
author = {Weitian Tong and
Zhi{-}Zhong Chen and
Lusheng Wang and
Yinfeng Xu and
Jiuping Xu and
Randy Goebel and
Guohui Lin},
title = {An approximation algorithm for the Bandpass-2 problem},
journal = {CoRR},
volume = {abs/1307.7089},
year = {2013},
url = {http://arxiv.org/abs/1307.7089},
eprinttype = {arXiv},
eprint = {1307.7089},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/TongCWXXGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-7055,
author = {Zhihan Gao},
title = {An LP-based 3/2-approximation algorithm for the graphic s-t path {TSP}},
journal = {CoRR},
volume = {abs/1304.7055},
year = {2013},
url = {http://arxiv.org/abs/1304.7055},
eprinttype = {arXiv},
eprint = {1304.7055},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-7055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/advor/BouznifG12,
author = {Marwane Bouznif and
Rodolphe Giroudeau},
title = {Erratum to "Inapproximability and Polynomial-Time Approximation Algorithm
for {UET} Tasks on Structured Processor Networks"},
journal = {Adv. Oper. Res.},
volume = {2012},
pages = {543215:1--543215:2},
year = {2012},
url = {https://doi.org/10.1155/2012/543215},
doi = {10.1155/2012/543215},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/advor/BouznifG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AazamiCJ12,
author = {Ashkan Aazami and
Joseph Cheriyan and
Krishnam Raju Jampani},
title = {Approximation Algorithms and Hardness Results for Packing Element-Disjoint
Steiner Trees in Planar Graphs},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {425--456},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9540-3},
doi = {10.1007/S00453-011-9540-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AazamiCJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalES12,
author = {Pankaj K. Agarwal and
Esther Ezra and
Micha Sharir},
title = {Near-Linear Approximation Algorithms for Geometric Hitting Sets},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {1--25},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9517-2},
doi = {10.1007/S00453-011-9517-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalES12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanKL12,
author = {Piotr Berman and
Marek Karpinski and
Andrzej Lingas},
title = {Exact and Approximation Algorithms for Geometric and Capacitated Set
Cover Problems},
journal = {Algorithmica},
volume = {64},
number = {2},
pages = {295--310},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9591-5},
doi = {10.1007/S00453-011-9591-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchinBBNOSW12,
author = {Kevin Buchin and
Maike Buchin and
Jaroslaw Byrka and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Rodrigo I. Silveira and
Alexander Wolff},
title = {Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter
Tractability},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {309--332},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9456-3},
doi = {10.1007/S00453-010-9456-3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchinBBNOSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CatusseCNV12,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Minimum Manhattan Network Problem in Normed Planes with Polygonal
Balls: {A} Factor 2.5 Approximation Algorithm},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {551--567},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9560-z},
doi = {10.1007/S00453-011-9560-Z},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CatusseCNV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuLX12,
author = {Donglei Du and
Ruixing Lu and
Dachuan Xu},
title = {A Primal-Dual Approximation Algorithm for the Facility Location Problem
with Submodular Penalties},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {191--200},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9526-1},
doi = {10.1007/S00453-011-9526-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DuLX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinLS12,
author = {Leah Epstein and
Asaf Levin and
Rob van Stee},
title = {Approximation Schemes for Packing Splittable Items with Cardinality
Constraints},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {102--129},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9445-6},
doi = {10.1007/S00453-010-9445-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhullerKM12,
author = {Samir Khuller and
Yoo{-}Ah Kim and
Azarakhsh Malekian},
title = {Improved Approximation Algorithms for Data Migration},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {347--362},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9534-1},
doi = {10.1007/S00453-011-9534-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhullerKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arima/NGuessanZM12,
author = {Assi N'Guessan and
Ibrahim Sidi Zakari and
Abdallah Mkhadri},
title = {A mixture of local and quadratic approximation variable selection
algorithm in nonconcave penalized regression},
journal = {{ARIMA} J.},
volume = {16},
pages = {2},
year = {2012},
url = {https://doi.org/10.46298/arima.1962},
doi = {10.46298/ARIMA.1962},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arima/NGuessanZM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cad/CarnicerDP12,
author = {Jes{\'{u}}s M. Carnicer and
Jorge Delgado and
Juan Manuel Pe{\~{n}}a},
title = {Progressive iteration approximation and the geometric algorithm},
journal = {Comput. Aided Des.},
volume = {44},
number = {2},
pages = {143--145},
year = {2012},
url = {https://doi.org/10.1016/j.cad.2011.01.018},
doi = {10.1016/J.CAD.2011.01.018},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cad/CarnicerDP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/ChanH12,
author = {Timothy M. Chan and
Sariel Har{-}Peled},
title = {Approximation Algorithms for Maximum Independent Set of Pseudo-Disks},
journal = {Discret. Comput. Geom.},
volume = {48},
number = {2},
pages = {373--392},
year = {2012},
url = {https://doi.org/10.1007/s00454-012-9417-5},
doi = {10.1007/S00454-012-9417-5},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/ChanH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijbpscm/Al-AraidahSBD12,
author = {Omar Al{-}Araidah and
Khaleel Abu Shgair and
Wafa Batayneh and
Ali Diabat},
title = {Efficient approximation of melting temperature in simulated annealing
algorithms applied to Chebyshev travelling salesman problem},
journal = {Int. J. Bus. Perform. Supply Chain Model.},
volume = {4},
number = {2},
pages = {145--163},
year = {2012},
url = {https://doi.org/10.1504/IJBPSCM.2012.048304},
doi = {10.1504/IJBPSCM.2012.048304},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijbpscm/Al-AraidahSBD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/LingasWZ12,
author = {Andrzej Lingas and
Agnieszka Wasylewicz and
Pawel Zylinski},
title = {Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem},
journal = {Int. J. Comput. Geom. Appl.},
volume = {22},
number = {2},
pages = {103--142},
year = {2012},
url = {https://doi.org/10.1142/S021819591250001X},
doi = {10.1142/S021819591250001X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/LingasWZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/JeannotST12,
author = {Emmanuel Jeannot and
Erik Saule and
Denis Trystram},
title = {Optimizing performance and reliability on heterogeneous parallel systems:
Approximation algorithms and heuristics},
journal = {J. Parallel Distributed Comput.},
volume = {72},
number = {2},
pages = {268--280},
year = {2012},
url = {https://doi.org/10.1016/j.jpdc.2011.11.003},
doi = {10.1016/J.JPDC.2011.11.003},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/JeannotST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/ThielenW12,
author = {Clemens Thielen and
Stephan Westphal},
title = {Approximation algorithms for {TTP(2)}},
journal = {Math. Methods Oper. Res.},
volume = {76},
number = {1},
pages = {1--20},
year = {2012},
url = {https://doi.org/10.1007/s00186-012-0387-4},
doi = {10.1007/S00186-012-0387-4},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/ThielenW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeviSS12,
author = {Retsef Levi and
David B. Shmoys and
Chaitanya Swamy},
title = {LP-based approximation algorithms for capacitated facility location},
journal = {Math. Program.},
volume = {131},
number = {1-2},
pages = {365--379},
year = {2012},
url = {https://doi.org/10.1007/s10107-010-0380-8},
doi = {10.1007/S10107-010-0380-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LeviSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nca/YehH12,
author = {Wei{-}Chang Yeh and
Tsung{-}Jung Hsieh},
title = {Artificial bee colony algorithm-neural networks for S-system models
of biochemical networks approximation},
journal = {Neural Comput. Appl.},
volume = {21},
number = {2},
pages = {365--375},
year = {2012},
url = {https://doi.org/10.1007/s00521-010-0435-z},
doi = {10.1007/S00521-010-0435-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nca/YehH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/NagarajanR12,
author = {Viswanath Nagarajan and
R. Ravi},
title = {Approximation algorithms for distance constrained vehicle routing
problems},
journal = {Networks},
volume = {59},
number = {2},
pages = {209--214},
year = {2012},
url = {https://doi.org/10.1002/net.20435},
doi = {10.1002/NET.20435},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/NagarajanR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/NottTL12a,
author = {David J. Nott and
Minh{-}Ngoc Tran and
Chenlei Leng},
title = {Variational approximation for heteroscedastic linear models and matching
pursuit algorithms},
journal = {Stat. Comput.},
volume = {22},
number = {2},
pages = {497--512},
year = {2012},
url = {https://doi.org/10.1007/s11222-011-9243-2},
doi = {10.1007/S11222-011-9243-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sac/NottTL12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/Uschmajew12,
author = {Andr{\'{e}} Uschmajew},
title = {Local Convergence of the Alternating Least Squares Algorithm for Canonical
Tensor Approximation},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {33},
number = {2},
pages = {639--652},
year = {2012},
url = {https://doi.org/10.1137/110843587},
doi = {10.1137/110843587},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/Uschmajew12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Fujito12,
author = {Toshihiro Fujito},
title = {How to trim a {MST:} {A} 2-Approximation algorithm for minimum cost-tree
cover},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {2},
pages = {16:1--16:11},
year = {2012},
url = {https://doi.org/10.1145/2151171.2151179},
doi = {10.1145/2151171.2151179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Fujito12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/ShenG12,
author = {Hong Shen and
Longkun Guo},
title = {Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner
Minimal Networks},
journal = {{IEEE} Trans. Computers},
volume = {61},
number = {7},
pages = {954--968},
year = {2012},
url = {https://doi.org/10.1109/TC.2011.123},
doi = {10.1109/TC.2011.123},
timestamp = {Wed, 20 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/ShenG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ChenW12,
author = {Zhi{-}Zhong Chen and
Lusheng Wang},
editor = {Guohui Lin},
title = {An Improved Approximation Algorithm for the Bandpass-2 Problem},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {188--199},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_17},
doi = {10.1007/978-3-642-31770-5\_17},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/ChenW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DavisW12,
author = {James M. Davis and
David P. Williamson},
editor = {Leah Epstein and
Paolo Ferragina},
title = {A Dual-Fitting {\textdollar}{\textbackslash}frac\{3\}\{2\}{\textdollar}
-Approximation Algorithm for Some Minimum-Cost Graph Problems},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {373--382},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_33},
doi = {10.1007/978-3-642-33090-2\_33},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DavisW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyL12,
author = {Julia Chuzhoy and
Shi Li},
title = {A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths
with Congestion 2},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {233--242},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.54},
doi = {10.1109/FOCS.2012.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Chan12,
author = {Timothy M. Chan},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Combinatorial Geometry and Approximation Algorithms},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {2},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_2},
doi = {10.1007/978-3-642-35261-4\_2},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Chan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/WuM12,
author = {Hui Wu and
Sabbir Mahmud},
editor = {Robert Bestak and
Lukas Kencl and
Li Erran Li and
Joerg Widmer and
Hao Yin},
title = {A 2-Approximation Algorithm for Optimal Deployment of k Base Stations
in WSNs},
booktitle = {{NETWORKING} 2012 - 11th International {IFIP} {TC} 6 Networking Conference,
Prague, Czech Republic, May 21-25, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7290},
pages = {378--391},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30054-7\_30},
doi = {10.1007/978-3-642-30054-7\_30},
timestamp = {Fri, 18 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/networking/WuM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Jansen12,
author = {Klaus Jansen},
editor = {Guy E. Blelloch and
Maurice Herlihy},
title = {A\({}_{\mbox{(3/2+{\(\epsilon\)})}}\) approximation algorithm for
scheduling moldable and non-moldable parallel tasks},
booktitle = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},
pages = {224--235},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2312005.2312048},
doi = {10.1145/2312005.2312048},
timestamp = {Wed, 21 Nov 2018 11:16:54 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Jansen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ward12,
author = {Justin Ward},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {A (k+3)/2-approximation algorithm for monotone submodular k-set packing
and general k-exchange systems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {42--53},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.42},
doi = {10.4230/LIPICS.STACS.2012.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Ward12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/CzygrinowHSW12,
author = {Andrzej Czygrinow and
Michal Hanckowiak and
Edyta Szymanska and
Wojciech Wawrzyniak},
editor = {Marcos K. Aguilera},
title = {Distributed 2-Approximation Algorithm for the Semi-matching Problem},
booktitle = {Distributed Computing - 26th International Symposium, {DISC} 2012,
Salvador, Brazil, October 16-18, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7611},
pages = {210--222},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33651-5\_15},
doi = {10.1007/978-3-642-33651-5\_15},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/CzygrinowHSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1272,
author = {Julia Chuzhoy and
Shi Li},
title = {A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths
with Congestion 2},
journal = {CoRR},
volume = {abs/1208.1272},
year = {2012},
url = {http://arxiv.org/abs/1208.1272},
eprinttype = {arXiv},
eprint = {1208.1272},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-5907,
title = {Choose Outsiders First: a mean 2-approximation random algorithm for
covering problems},
journal = {CoRR},
volume = {abs/1208.5907},
year = {2012},
note = {Withdrawn.},
url = {http://arxiv.org/abs/1208.5907},
eprinttype = {arXiv},
eprint = {1208.5907},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-5907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlthausCEKM11,
author = {Ernst Althaus and
Stefan Canzar and
Khaled M. Elbassioni and
Andreas Karrenbauer and
Juli{\'{a}}n Mestre},
title = {Approximation Algorithms for the Interval Constrained Coloring Problem},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {342--361},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9406-0},
doi = {10.1007/S00453-010-9406-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlthausCEKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElbassioniKMMS11,
author = {Khaled M. Elbassioni and
Erik Krohn and
Domagoj Matijevic and
Juli{\'{a}}n Mestre and
Domagoj Severdija},
title = {Improved Approximations for Guarding 1.5-Dimensional Terrains},
journal = {Algorithmica},
volume = {60},
number = {2},
pages = {451--463},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9358-4},
doi = {10.1007/S00453-009-9358-4},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElbassioniKMMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KowalikM11,
author = {Lukasz Kowalik and
Marcin Mucha},
title = {35/44-approximation for Asymmetric Maximum {TSP} with Triangle Inequality},
journal = {Algorithmica},
volume = {59},
number = {2},
pages = {240--255},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9306-3},
doi = {10.1007/S00453-009-9306-3},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KowalikM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/asc/TsaiHCG11,
author = {Jinn{-}Tsong Tsai and
Wen{-}Hsien Ho and
Jyh{-}Horng Chou and
Ching{-}Yi Guo},
title = {Optimal approximation of linear systems using Taguchi-sliding-based
differential evolution algorithm},
journal = {Appl. Soft Comput.},
volume = {11},
number = {2},
pages = {2007--2016},
year = {2011},
url = {https://doi.org/10.1016/j.asoc.2010.06.016},
doi = {10.1016/J.ASOC.2010.06.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/asc/TsaiHCG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/asc/YingLLL11,
author = {Kuo{-}Ching Ying and
Shih{-}Wei Lin and
Zne{-}Jung Lee and
I{-}Lin Lee},
title = {A novel function approximation based on robust fuzzy regression algorithm
model and particle swarm optimization},
journal = {Appl. Soft Comput.},
volume = {11},
number = {2},
pages = {1820--1826},
year = {2011},
url = {https://doi.org/10.1016/j.asoc.2010.05.028},
doi = {10.1016/J.ASOC.2010.05.028},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/asc/YingLLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/chinaf/JiangZ11,
author = {Haitao Jiang and
Daming Zhu},
title = {A 14/11-approximation algorithm for sorting by short block-moves},
journal = {Sci. China Inf. Sci.},
volume = {54},
number = {2},
pages = {279--292},
year = {2011},
url = {https://doi.org/10.1007/s11432-010-4131-5},
doi = {10.1007/S11432-010-4131-5},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/chinaf/JiangZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/IwaikawaKM11,
author = {Yutaka Iwaikawa and
Naoyuki Kamiyama and
Tomomi Matsui},
title = {Improved Approximation Algorithms for Firefighter Problem on Trees},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {94-D},
number = {2},
pages = {196--199},
year = {2011},
url = {https://doi.org/10.1587/transinf.E94.D.196},
doi = {10.1587/TRANSINF.E94.D.196},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/IwaikawaKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/CvetkovicMM11,
author = {Aleksandar S. Cvetkovic and
Gradimir V. Milovanovic and
Marjan M. Matejic},
title = {Rational algorithm for quadratic Christoffel modification and applications
to the constrained \emph{L} \({}^{\mbox{2}}\)-approximation},
journal = {Int. J. Comput. Math.},
volume = {88},
number = {14},
pages = {3012--3025},
year = {2011},
url = {https://doi.org/10.1080/00207160.2011.565335},
doi = {10.1080/00207160.2011.565335},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/CvetkovicMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijmmsc/MarinoCYLL11,
author = {Giuseppe Marino and
Vittorio Colao and
Yonghong Yao and
Genaro L{\'{o}}pez{-}Acedo and
Enrique Llorens{-}Fuster},
title = {Fixed-Point Theory, Variational Inequalities, and Its Approximation
Algorithms},
journal = {Int. J. Math. Math. Sci.},
volume = {2011},
pages = {182024:1--182024:2},
year = {2011},
url = {https://doi.org/10.1155/2011/182024},
doi = {10.1155/2011/182024},
timestamp = {Tue, 11 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijmmsc/MarinoCYLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/TruongR11,
author = {Van{-}Anh Truong and
Robin O. Roundy},
title = {Multidimensional Approximation Algorithms for Capacity-Expansion Problems},
journal = {Oper. Res.},
volume = {59},
number = {2},
pages = {313--327},
year = {2011},
url = {https://doi.org/10.1287/opre.1100.0892},
doi = {10.1287/OPRE.1100.0892},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/TruongR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EvenKN11,
author = {Guy Even and
Guy Kortsarz and
Zeev Nutov},
title = {A 1.5-approximation algorithm for augmenting edge-connectivity of
a graph from 1 to 2},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {296--300},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.010},
doi = {10.1016/J.IPL.2010.12.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EvenKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TuZ11,
author = {Jianhua Tu and
Wenli Zhou},
title = {A factor 2 approximation algorithm for the vertex cover P\({}_{\mbox{3}}\)
problem},
journal = {Inf. Process. Lett.},
volume = {111},
number = {14},
pages = {683--686},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.04.009},
doi = {10.1016/J.IPL.2011.04.009},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TuZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/MartinhonP11,
author = {Carlos A. J. Martinhon and
F{\'{a}}bio Protti},
title = {An improved derandomized approximation algorithm for the max-controlled
set problem},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {45},
number = {2},
pages = {181--196},
year = {2011},
url = {https://doi.org/10.1051/ita/2011006},
doi = {10.1051/ITA/2011006},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/MartinhonP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsw/LiHX11,
author = {Hengwu Li and
Huijian Han and
Zhenzhong Xu},
title = {Approximation Algorithm and Scheme for {RNA} Maximum Weighted Stacking},
journal = {J. Softw.},
volume = {6},
number = {2},
pages = {233--240},
year = {2011},
url = {https://doi.org/10.4304/jsw.6.2.233-240},
doi = {10.4304/JSW.6.2.233-240},
timestamp = {Tue, 15 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsw/LiHX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mcs/SabelfeldM11,
author = {Karl K. Sabelfeld and
N. S. Mozartova},
title = {Sparsified Randomization algorithms for low rank approximations and
applications to integral equations and inhomogeneous random field
simulation},
journal = {Math. Comput. Simul.},
volume = {82},
number = {2},
pages = {295--317},
year = {2011},
url = {https://doi.org/10.1016/j.matcom.2011.08.002},
doi = {10.1016/J.MATCOM.2011.08.002},
timestamp = {Wed, 04 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mcs/SabelfeldM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlc/Zheng11,
author = {Songfeng Zheng},
title = {Gradient descent algorithms for quantile regression with smooth approximation},
journal = {Int. J. Mach. Learn. Cybern.},
volume = {2},
number = {3},
pages = {191--207},
year = {2011},
url = {https://doi.org/10.1007/s13042-011-0031-2},
doi = {10.1007/S13042-011-0031-2},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlc/Zheng11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/So11,
author = {Anthony Man{-}Cho So},
title = {Deterministic approximation algorithms for sphere constrained homogeneous
polynomial optimization problems},
journal = {Math. Program.},
volume = {129},
number = {2},
pages = {357--382},
year = {2011},
url = {https://doi.org/10.1007/s10107-011-0464-0},
doi = {10.1007/S10107-011-0464-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/So11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KellererK11,
author = {Hans Kellerer and
Vladimir Kotov},
title = {A 3/2-approximation algorithm for 3/2-partitioning},
journal = {Oper. Res. Lett.},
volume = {39},
number = {5},
pages = {359--362},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.06.005},
doi = {10.1016/J.ORL.2011.06.005},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KellererK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WangDGX11,
author = {Zhen Wang and
Donglei Du and
Adriana Felicia Gabor and
Dachuan Xu},
title = {Erratum to: "An approximation algorithm for the k-level stochastic
facility location problem" [Oper. Res. Lett. 38(2010) 386-389]},
journal = {Oper. Res. Lett.},
volume = {39},
number = {2},
pages = {160--161},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2010.12.001},
doi = {10.1016/J.ORL.2010.12.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/WangDGX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ChatterjeeD11,
author = {Shirshendu Chatterjee and
Rick Durrett},
title = {Persistence of activity in threshold contact processes, an "Annealed
approximation" of random Boolean networks},
journal = {Random Struct. Algorithms},
volume = {39},
number = {2},
pages = {228--246},
year = {2011},
url = {https://doi.org/10.1002/rsa.20357},
doi = {10.1002/RSA.20357},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ChatterjeeD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArcherBHK11,
author = {Aaron Archer and
MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Improved Approximation Algorithms for Prize-Collecting Steiner Tree
and {TSP}},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {309--332},
year = {2011},
url = {https://doi.org/10.1137/090771429},
doi = {10.1137/090771429},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArcherBHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BonsmaZ11,
author = {Paul S. Bonsma and
Florian Zickfeld},
title = {A 3/2-Approximation Algorithm for Finding Spanning Trees with Many
Leaves in Cubic Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {4},
pages = {1652--1666},
year = {2011},
url = {https://doi.org/10.1137/100801251},
doi = {10.1137/100801251},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BonsmaZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakaravarthyPRAM11,
author = {Venkatesan T. Chakaravarthy and
Vinayaka Pandit and
Sambuddha Roy and
Pranjal Awasthi and
Mukesh K. Mohania},
title = {Decision trees for entity identification: Approximation algorithms
and hardness results},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {2},
pages = {15:1--15:22},
year = {2011},
url = {https://doi.org/10.1145/1921659.1921661},
doi = {10.1145/1921659.1921661},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChakaravarthyPRAM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Jacobs11,
author = {Tobias Jacobs},
title = {Constant factor approximations for the hotlink assignment problem},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {2},
pages = {16:1--16:19},
year = {2011},
url = {https://doi.org/10.1145/1921659.1921662},
doi = {10.1145/1921659.1921662},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Jacobs11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/HickeyBCMZ11,
author = {Glenn Hickey and
Mathieu Blanchette and
Paz Carmi and
Anil Maheshwari and
Norbert Zeh},
title = {An Approximation Algorithm for the Noah's Ark Problem with Random
Feature Loss},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {2},
pages = {551--556},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2010.37},
doi = {10.1109/TCBB.2010.37},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/HickeyBCMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ManneMPT11,
author = {Fredrik Manne and
Morten Mjelde and
Laurence Pilard and
S{\'{e}}bastien Tixeuil},
title = {A self-stabilizing 2/3-approximation algorithm for the maximum matching
problem},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5515--5526},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.019},
doi = {10.1016/J.TCS.2011.05.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ManneMPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TurauH11,
author = {Volker Turau and
Bernd Hauck},
title = {A fault-containing self-stabilizing {(3} - 2/(Delta+1))-approximation
algorithm for vertex cover in anonymous networks},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {33},
pages = {4361--4371},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.010},
doi = {10.1016/J.TCS.2010.11.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TurauH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TurauH11a,
author = {Volker Turau and
Bernd Hauck},
title = {A new analysis of a self-stabilizing maximum weight matching algorithm
with approximation ratio 2},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {40},
pages = {5527--5540},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.11.032},
doi = {10.1016/J.TCS.2010.11.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TurauH11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CohenN11,
author = {Nachshon Cohen and
Zeev Nutov},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {A {(1} + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity
Augmentation of Trees with Constant Radius},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {147--157},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_13},
doi = {10.1007/978-3-642-22935-0\_13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CohenN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fuzzIEEE/ChangL11,
author = {Feng{-}Yu Chang and
Ching{-}Hung Lee},
title = {Interval type-2 recurrent fuzzy neural system desing via stable simultaneous
perturbation stochastic approximation algorithm},
booktitle = {{FUZZ-IEEE} 2011, {IEEE} International Conference on Fuzzy Systems,
Taipei, Taiwan, 27-30 June, 2011, Proceedings},
pages = {2155--2162},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/FUZZY.2011.6007489},
doi = {10.1109/FUZZY.2011.6007489},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/fuzzIEEE/ChangL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/StaufferMRG11,
author = {Gautier Stauffer and
Guillaume Massonnet and
Christophe Rapine and
Jean{-}Philippe Gayon},
editor = {Dana Randall},
title = {A simple and fast 2-approximation algorithms for the one-warehouse
multi-retailers problem},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {67--79},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.6},
doi = {10.1137/1.9781611973082.6},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/StaufferMRG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiK11,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Breaking o(n\({}^{\mbox{1/2}}\))-approximation algorithms for the
edge-disjoint paths problem with congestion two},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {81--88},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993648},
doi = {10.1145/1993636.1993648},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-0260,
author = {Ekow J. Otoo and
Ali Pinar and
Doron Rotem},
title = {A Linear Approximation Algorithm for 2-Dimensional Vector Packing},
journal = {CoRR},
volume = {abs/1103.0260},
year = {2011},
url = {http://arxiv.org/abs/1103.0260},
eprinttype = {arXiv},
eprint = {1103.0260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-0260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-4983,
author = {Justin Ward},
title = {A {\textdollar}(k + 3)/2{\textdollar}-approximation algorithm for
monotone submodular maximization over a {\textdollar}k{\textdollar}-exchange
system},
journal = {CoRR},
volume = {abs/1108.4983},
year = {2011},
url = {http://arxiv.org/abs/1108.4983},
eprinttype = {arXiv},
eprint = {1108.4983},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-4983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-0620,
author = {Shinji Imahori and
Tomomi Matsui and
Ryuhei Miyashiro},
title = {A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament
Problem},
journal = {CoRR},
volume = {abs/1110.0620},
year = {2011},
url = {http://arxiv.org/abs/1110.0620},
eprinttype = {arXiv},
eprint = {1110.0620},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-0620.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CaiH10,
author = {Liming Cai and
Xiuzhen Huang},
title = {Fixed-Parameter Approximation: Conceptual Framework and Approximability
Results},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {398--412},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9223-x},
doi = {10.1007/S00453-008-9223-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CaiH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiedrichJPT10,
author = {Florian Diedrich and
Klaus Jansen and
Fanny Pascual and
Denis Trystram},
title = {Approximation Algorithms for Scheduling with Reservations},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {391--404},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9271-2},
doi = {10.1007/S00453-008-9271-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiedrichJPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HongN10a,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {478--497},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9277-4},
doi = {10.1007/S00453-009-9277-4},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HongN10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kovacs10,
author = {Annam{\'{a}}ria Kov{\'{a}}cs},
title = {New Approximation Bounds for Lpt Scheduling},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {413--433},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9224-9},
doi = {10.1007/S00453-008-9224-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kovacs10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LinYX10,
author = {Mingen Lin and
Yang Yang and
Jinhui Xu},
title = {Improved Approximation Algorithms for Maximum Resource Bin Packing
and Lazy Bin Covering Problems},
journal = {Algorithmica},
volume = {57},
number = {2},
pages = {232--251},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9202-2},
doi = {10.1007/S00453-008-9202-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LinYX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NagarajanR10,
author = {Viswanath Nagarajan and
R. Ravi},
title = {Approximation Algorithms for Requirement Cut on Graphs},
journal = {Algorithmica},
volume = {56},
number = {2},
pages = {198--213},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9171-5},
doi = {10.1007/S00453-008-9171-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NagarajanR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/TanahashiC10,
author = {Ruka Tanahashi and
Zhi{-}Zhong Chen},
title = {A Deterministic Approximation Algorithm for Maximum 2-Path Packing},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {93-D},
number = {2},
pages = {241--249},
year = {2010},
url = {https://doi.org/10.1587/transinf.E93.D.241},
doi = {10.1587/TRANSINF.E93.D.241},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/TanahashiC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AhmedDLLMR10,
author = {Mustaq Ahmed and
Sandip Das and
Sachin Lodha and
Anna Lubiw and
Anil Maheshwari and
Sasanka Roy},
title = {Approximation algorithms for shortest descending paths in terrains},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {214--230},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.05.001},
doi = {10.1016/J.JDA.2009.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AhmedDLLMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ClearyJ10,
author = {Sean Cleary and
Katherine St. John},
title = {A Linear-Time Approximation Algorithm for Rotation Distance},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {385--390},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00212},
doi = {10.7155/JGAA.00212},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ClearyJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BigiFZ10,
author = {Giancarlo Bigi and
Antonio Frangioni and
Qinghua Zhang},
title = {Outer approximation algorithms for canonical {DC} problems},
journal = {J. Glob. Optim.},
volume = {46},
number = {2},
pages = {163--189},
year = {2010},
url = {https://doi.org/10.1007/s10898-009-9415-1},
doi = {10.1007/S10898-009-9415-1},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BigiFZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mldm/SongR10,
author = {Mingjun Song and
Sanguthevar Rajasekaran},
title = {Fast Algorithms for Constant Approximation k-Means Clustering},
journal = {Trans. Mach. Learn. Data Min.},
volume = {3},
number = {2},
pages = {67--79},
year = {2010},
url = {http://www.ibai-publishing.org/journal/issue\_mldm/2010\_october/mldm\_3\_2\_67-79.php},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mldm/SongR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HeLZ10,
author = {Simai He and
Zhening Li and
Shuzhong Zhang},
title = {Approximation algorithms for homogeneous polynomial optimization with
quadratic constraints},
journal = {Math. Program.},
volume = {125},
number = {2},
pages = {353--383},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0409-z},
doi = {10.1007/S10107-010-0409-Z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/HeLZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MahjoubM10,
author = {Ali Ridha Mahjoub and
S. Thomas McCormick},
title = {Max Flow and Min Cut with bounded-length paths: complexity, algorithms,
and approximation},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {271--284},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0366-6},
doi = {10.1007/S10107-010-0366-6},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MahjoubM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Berzins10,
author = {Martin Berzins},
title = {Nonlinear data-bounded polynomial approximations and their applications
in {ENO} methods},
journal = {Numer. Algorithms},
volume = {55},
number = {2-3},
pages = {171--189},
year = {2010},
url = {https://doi.org/10.1007/s11075-010-9395-8},
doi = {10.1007/S11075-010-9395-8},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Berzins10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/CuytY10,
author = {Annie A. M. Cuyt and
Xianglan Yang},
title = {A practical error formula for multivariate rational interpolation
and approximation},
journal = {Numer. Algorithms},
volume = {55},
number = {2-3},
pages = {233--243},
year = {2010},
url = {https://doi.org/10.1007/s11075-010-9380-2},
doi = {10.1007/S11075-010-9380-2},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/CuytY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/RathinamS10,
author = {Sivakumar Rathinam and
Raja Sengupta},
title = {3/2-approximation algorithm for two variants of a 2-depot Hamiltonian
path problem},
journal = {Oper. Res. Lett.},
volume = {38},
number = {1},
pages = {63--68},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2009.10.001},
doi = {10.1016/J.ORL.2009.10.001},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/RathinamS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RaviS10,
author = {R. Ravi and
Amitabh Sinha},
title = {Approximation Algorithms for Multicommodity Facility Location Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {2},
pages = {538--551},
year = {2010},
url = {https://doi.org/10.1137/080732857},
doi = {10.1137/080732857},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RaviS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/IwamaMY10,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Hiroki Yanagisawa},
title = {Approximation algorithms for the sex-equal stable marriage problem},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {1},
pages = {2:1--2:17},
year = {2010},
url = {https://doi.org/10.1145/1868237.1868239},
doi = {10.1145/1868237.1868239},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/IwamaMY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/Jiang10,
author = {Minghui Jiang},
title = {Approximation Algorithms for Predicting {RNA} Secondary Structures
with Arbitrary Pseudoknots},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {7},
number = {2},
pages = {323--332},
year = {2010},
url = {https://doi.org/10.1109/TCBB.2008.109},
doi = {10.1109/TCBB.2008.109},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/Jiang10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BougeretDJOT10,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Otte and
Denis Trystram},
editor = {Pasqua D'Ambra and
Mario Rosario Guarracino and
Domenico Talia},
title = {A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling},
booktitle = {Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference,
Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6271},
pages = {157--167},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15277-1\_16},
doi = {10.1007/978-3-642-15277-1\_16},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/BougeretDJOT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BermanKZ10,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete
Graphs with Edge Lengths 1 and 2},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {15--24},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_4},
doi = {10.1007/978-3-642-17517-6\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BermanKZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/XuR10,
author = {Zhou Xu and
Brian Rodrigues},
editor = {Haim Kaplan},
title = {A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling
Salesman Problem},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {127--138},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_13},
doi = {10.1007/978-3-642-13731-0\_13},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/XuR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KarrenbauerR10,
author = {Andreas Karrenbauer and
Thomas Rothvo{\ss}},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling
of Implicit-Deadline Tasks},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {166--177},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_15},
doi = {10.1007/978-3-642-18318-8\_15},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KarrenbauerR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CatusseCNV10,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Minimum Manhattan network problem in normed planes with polygonal
balls: a factor 2.5 approximation algorithm},
journal = {CoRR},
volume = {abs/1004.5517},
year = {2010},
url = {http://arxiv.org/abs/1004.5517},
eprinttype = {arXiv},
eprint = {1004.5517},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CatusseCNV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-3036,
author = {Marek Adamczyk},
title = {Greedy algorithm for stochastic matching is a 2-approximation},
journal = {CoRR},
volume = {abs/1007.3036},
year = {2010},
url = {http://arxiv.org/abs/1007.3036},
eprinttype = {arXiv},
eprint = {1007.3036},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-3036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/SuscaBM09,
author = {Sara Susca and
Francesco Bullo and
Sonia Mart{\'{\i}}nez},
title = {Gradient algorithms for polygonal approximation of convex contours},
journal = {Autom.},
volume = {45},
number = {2},
pages = {510--516},
year = {2009},
url = {https://doi.org/10.1016/j.automatica.2008.08.020},
doi = {10.1016/J.AUTOMATICA.2008.08.020},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/SuscaBM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaburinCGGP09,
author = {Alexey Baburin and
Federico Della Croce and
Edward Gimadi and
Y. V. Glazkov and
Vangelis Th. Paschos},
title = {Approximation algorithms for the 2-peripatetic salesman problem with
edge weights 1 and 2},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {1988--1992},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.025},
doi = {10.1016/J.DAM.2008.06.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaburinCGGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/HassinLR09,
author = {Refael Hassin and
Asaf Levin and
Shlomi Rubinstein},
title = {Approximation algorithms for maximum latency and partial cycle cover},
journal = {Discret. Optim.},
volume = {6},
number = {2},
pages = {197--205},
year = {2009},
url = {https://doi.org/10.1016/j.disopt.2008.12.003},
doi = {10.1016/J.DISOPT.2008.12.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/HassinLR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/WangKWTW09,
author = {Wei Wang and
Donghyun Kim and
James Willson and
Bhavani Thuraisingham and
Weili Wu},
title = {A Better Approximation for Minimum Average Routing Path Clustering
Problem in 2-d Underwater Sensor Networks},
journal = {Discret. Math. Algorithms Appl.},
volume = {1},
number = {2},
pages = {175--192},
year = {2009},
url = {https://doi.org/10.1142/S1793830909000142},
doi = {10.1142/S1793830909000142},
timestamp = {Wed, 29 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/WangKWTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LingXX09,
author = {Ai{-}Fan Ling and
Cheng{-}Xian Xu and
Feng{-}Min Xu},
title = {A discrete filled function algorithm embedded with continuous approximation
for solving max-cut problems},
journal = {Eur. J. Oper. Res.},
volume = {197},
number = {2},
pages = {519--531},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.07.026},
doi = {10.1016/J.EJOR.2008.07.026},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LingXX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/SakamotoMKS09,
author = {Hiroshi Sakamoto and
Shirou Maruyama and
Takuya Kida and
Shinichi Shimozono},
title = {A Space-Saving Approximation Algorithm for Grammar-Based Compression},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {92-D},
number = {2},
pages = {158--165},
year = {2009},
url = {https://doi.org/10.1587/transinf.E92.D.158},
doi = {10.1587/TRANSINF.E92.D.158},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/SakamotoMKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/ElbassioniFS09,
author = {Khaled M. Elbassioni and
Aleksei V. Fishkin and
Ren{\'{e}} Sitters},
title = {Approximation Algorithms for the Euclidean Traveling Salesman Problem
with Discrete and Continuous Neighborhoods},
journal = {Int. J. Comput. Geom. Appl.},
volume = {19},
number = {2},
pages = {173--193},
year = {2009},
url = {https://doi.org/10.1142/S0218195909002897},
doi = {10.1142/S0218195909002897},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/ElbassioniFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijidss/DeepD09,
author = {Kusum Deep and
Kedar Nath Das},
title = {Performance improvement of real coded genetic algorithm with Quadratic
Approximation based hybridisation},
journal = {Int. J. Intell. Def. Support Syst.},
volume = {2},
number = {4},
pages = {319--334},
year = {2009},
url = {https://doi.org/10.1504/IJIDSS.2009.031415},
doi = {10.1504/IJIDSS.2009.031415},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijidss/DeepD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/SelvarajahS09,
author = {Esaignani Selvarajah and
George Steiner},
title = {Approximation Algorithms for the Supplier's Supply Chain Scheduling
Problem to Minimize Delivery and Inventory Holding Costs},
journal = {Oper. Res.},
volume = {57},
number = {2},
pages = {426--438},
year = {2009},
url = {https://doi.org/10.1287/opre.1080.0622},
doi = {10.1287/OPRE.1080.0622},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/SelvarajahS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/XavierM09,
author = {Eduardo C. Xavier and
Fl{\'{a}}vio Keidi Miyazawa},
title = {A note on dual approximation algorithms for class constrained bin
packing problems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {43},
number = {2},
pages = {239--248},
year = {2009},
url = {https://doi.org/10.1051/ita:2008027},
doi = {10.1051/ITA:2008027},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/XavierM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ZhangLL09,
author = {Tongquan Zhang and
Weidong Li and
Jianping Li},
title = {An improved approximation algorithm for the {ATSP} with parameterized
triangle inequality},
journal = {J. Algorithms},
volume = {64},
number = {2-3},
pages = {74--78},
year = {2009},
url = {https://doi.org/10.1016/j.jalgor.2008.10.002},
doi = {10.1016/J.JALGOR.2008.10.002},
timestamp = {Tue, 14 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ZhangLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Kacem09,
author = {Imed Kacem},
title = {Approximation algorithms for the makespan minimization with positive
tails on a single machine with a fixed non-availability interval},
journal = {J. Comb. Optim.},
volume = {17},
number = {2},
pages = {117--133},
year = {2009},
url = {https://doi.org/10.1007/s10878-007-9102-4},
doi = {10.1007/S10878-007-9102-4},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Kacem09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/JothiR09,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Improved approximation algorithms for the single-sink buy-at-bulk
network design problems},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {249--255},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.003},
doi = {10.1016/J.JDA.2008.12.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/JothiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HongN09,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {New Approximation to the One-sided Radial Crossing Minimization},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {179--196},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00182},
doi = {10.7155/JGAA.00182},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HongN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/IshtevaLAH09,
author = {Mariya Ishteva and
Lieven De Lathauwer and
Pierre{-}Antoine Absil and
Sabine Van Huffel},
title = {Differential-geometric Newton method for the best rank-(\emph{R}\({}_{\mbox{1}}\),
\emph{R}\({}_{\mbox{2}}\), \emph{R}\({}_{\mbox{3}}\)) approximation
of tensors},
journal = {Numer. Algorithms},
volume = {51},
number = {2},
pages = {179--194},
year = {2009},
url = {https://doi.org/10.1007/s11075-008-9251-2},
doi = {10.1007/S11075-008-9251-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/IshtevaLAH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/PengL09,
author = {Zhuo{-}hua Peng and
Jin{-}wang Liu},
title = {The generalized bisymmetric solutions of the matrix equation \emph{A}
\({}_{\mbox{1}}\) \emph{X} \({}_{\mbox{1}}\) \emph{B} \({}_{\mbox{1}}\)
+ \emph{A} \({}_{\mbox{2}}\) \emph{X} \({}_{\mbox{2}}\) \emph{B} \({}_{\mbox{2}}\)
+ + \emph{A} \({}_{\mbox{ \emph{l} }}\) \emph{X} \({}_{\mbox{ \emph{l}
}}\) \emph{B} \({}_{\mbox{ \emph{l} }}\) = \emph{C} and its optimal
approximation},
journal = {Numer. Algorithms},
volume = {50},
number = {2},
pages = {127--144},
year = {2009},
url = {https://doi.org/10.1007/s11075-008-9220-9},
doi = {10.1007/S11075-008-9220-9},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/PengL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EngelsM09,
author = {Christian Engels and
Bodo Manthey},
title = {Average-case approximation ratio of the 2-opt algorithm for the {TSP}},
journal = {Oper. Res. Lett.},
volume = {37},
number = {2},
pages = {83--84},
year = {2009},
url = {https://doi.org/10.1016/j.orl.2008.12.002},
doi = {10.1016/J.ORL.2008.12.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/EngelsM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoenigMMT09,
author = {Sven Koenig and
Joseph S. B. Mitchell and
Apurva Mudgal and
Craig A. Tovey},
title = {A Near-Tight Approximation Algorithm for the Robot Localization Problem},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {461--490},
year = {2009},
url = {https://doi.org/10.1137/070682885},
doi = {10.1137/070682885},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KoenigMMT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BerryPGN09,
author = {Vincent Berry and
Christophe Paul and
Sylvain Guillemot and
Fran{\c{c}}ois Nicolas},
title = {Linear time 3-approximation for the {MAST} problem},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {23:1--23:18},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497299},
doi = {10.1145/1497290.1497299},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BerryPGN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenFKN09,
author = {Guy Even and
Jon Feldman and
Guy Kortsarz and
Zeev Nutov},
title = {A 1.8 approximation algorithm for augmenting edge-connectivity of
a graph from 1 to 2},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {21:1--21:17},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497297},
doi = {10.1145/1497290.1497297},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EvenFKN09.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/talg/RabaniS09,
author = {Yuval Rabani and
Gabriel Scalosub},
title = {Bicriteria approximation tradeoff for the node-cost budget problem},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {19:1--19:14},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497295},
doi = {10.1145/1497290.1497295},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/RabaniS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeinLMS09,
author = {Wolfgang W. Bein and
Lawrence L. Larmore and
Linda Morales and
Ivan Hal Sudborough},
title = {A quadratic time 2-approximation algorithm for block sorting},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {711--717},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.022},
doi = {10.1016/J.TCS.2008.10.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeinLMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tomacs/PasupathyS09,
author = {Raghu Pasupathy and
Bruce W. Schmeiser},
title = {Retrospective-approximation algorithms for the multidimensional stochastic
root-finding problem},
journal = {{ACM} Trans. Model. Comput. Simul.},
volume = {19},
number = {2},
pages = {5:1--5:36},
year = {2009},
url = {https://doi.org/10.1145/1502787.1502788},
doi = {10.1145/1502787.1502788},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tomacs/PasupathyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/twc/HongP09,
author = {Chi{-}Yao Hong and
Ai{-}Chun Pang},
title = {3-Approximation algorithm for joint routing and link scheduling in
wireless relay networks},
journal = {{IEEE} Trans. Wirel. Commun.},
volume = {8},
number = {2},
pages = {856--861},
year = {2009},
url = {https://doi.org/10.1109/TWC.2009.071193},
doi = {10.1109/TWC.2009.071193},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/twc/HongP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amcc/YadlapalliRD09,
author = {Sai Krishna Yadlapalli and
Sivakumar Rathinam and
Swaroop Darbha},
title = {An approximation algorithm for a 2-Depot, heterogeneous vehicle routing
problem},
booktitle = {American Control Conference, {ACC} 2009. St. Louis, Missouri, USA,
June 10-12, 2009},
pages = {1730--1735},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ACC.2009.5160738},
doi = {10.1109/ACC.2009.5160738},
timestamp = {Fri, 03 Dec 2021 13:02:58 +0100},
biburl = {https://dblp.org/rec/conf/amcc/YadlapalliRD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/McDermid09,
author = {Eric McDermid},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {A 3/2-Approximation Algorithm for General Stable Marriage},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {689--700},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_57},
doi = {10.1007/978-3-642-02927-1\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/McDermid09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FurerGK09,
author = {Martin F{\"{u}}rer and
Serge Gaspers and
Shiva Prasad Kasiviswanathan},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {An Exponential Time 2-Approximation Algorithm for Bandwidth},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {173--184},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_14},
doi = {10.1007/978-3-642-11269-0\_14},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/FurerGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdcat/XuS09,
author = {Shihong Xu and
Hong Shen},
title = {A Distributed ({\(\vert\)}R{\(\vert\)}, 2)-Approximation Algorithm
for Fault-Tolerant Facility Location},
booktitle = {2009 International Conference on Parallel and Distributed Computing,
Applications and Technologies, {PDCAT} 2009, Higashi Hiroshima, Japan,
8-11 December 2009},
pages = {72--79},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/PDCAT.2009.16},
doi = {10.1109/PDCAT.2009.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pdcat/XuS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanKZ09,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {1.25-Approximation Algorithm for Steiner Tree Problem with Distances
1 and 2},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {86--97},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_8},
doi = {10.1007/978-3-642-03367-4\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanKZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AstrandFPRSU09,
author = {Matti {\AA}strand and
Patrik Flor{\'{e}}en and
Valentin Polishchuk and
Joel Rybicki and
Jukka Suomela and
Jara Uitto},
editor = {Idit Keidar},
title = {A Local 2-Approximation Algorithm for the Vertex Cover Problem},
booktitle = {Distributed Computing, 23rd International Symposium, {DISC} 2009,
Elche, Spain, September 23-25, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5805},
pages = {191--205},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04355-0\_21},
doi = {10.1007/978-3-642-04355-0\_21},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AstrandFPRSU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-2265,
author = {Rolf Harren and
Rob van Stee},
title = {An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing},
journal = {CoRR},
volume = {abs/0903.2265},
year = {2009},
url = {http://arxiv.org/abs/0903.2265},
eprinttype = {arXiv},
eprint = {0903.2265},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-2265.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-1953,
author = {Martin F{\"{u}}rer and
Serge Gaspers and
Shiva Prasad Kasiviswanathan},
title = {An Exponential Time 2-Approximation Algorithm for Bandwidth},
journal = {CoRR},
volume = {abs/0906.1953},
year = {2009},
url = {http://arxiv.org/abs/0906.1953},
eprinttype = {arXiv},
eprint = {0906.1953},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-1953.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoM08,
author = {Minkyoung Cho and
David M. Mount},
title = {Improved Approximation Bounds for Planar Point Pattern Matching},
journal = {Algorithmica},
volume = {50},
number = {2},
pages = {175--207},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9059-9},
doi = {10.1007/S00453-007-9059-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChoM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/IwamaMY08,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Naoya Yamauchi},
title = {A (2-\emph{c}(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage
Problem},
journal = {Algorithmica},
volume = {51},
number = {3},
pages = {342--356},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9101-y},
doi = {10.1007/S00453-007-9101-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/IwamaMY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/DehghanH08,
author = {Mehdi Dehghan and
Masoud Hajarian},
title = {An iterative algorithm for the reflexive solutions of the generalized
coupled Sylvester matrix equations and its optimal approximation},
journal = {Appl. Math. Comput.},
volume = {202},
number = {2},
pages = {571--588},
year = {2008},
url = {https://doi.org/10.1016/j.amc.2008.02.035},
doi = {10.1016/J.AMC.2008.02.035},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/DehghanH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/PeiraviK08,
author = {Ali Peiravi and
Hossein Tolooei Kheibari},
title = {A fast algorithm for connectivity graph approximation using modified
Manhattan distance in dynamic networks},
journal = {Appl. Math. Comput.},
volume = {201},
number = {1-2},
pages = {319--332},
year = {2008},
url = {https://doi.org/10.1016/j.amc.2007.12.026},
doi = {10.1016/J.AMC.2007.12.026},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/PeiraviK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ec/WannerGTF08,
author = {Elizabeth F. Wanner and
Frederico G. Guimar{\~{a}}es and
Ricardo H. C. Takahashi and
Peter J. Fleming},
title = {Local Search with Quadratic Approximations into Memetic Algorithms
for Optimization with Multiple Criteria},
journal = {Evol. Comput.},
volume = {16},
number = {2},
pages = {185--224},
year = {2008},
url = {https://doi.org/10.1162/evco.2008.16.2.185},
doi = {10.1162/EVCO.2008.16.2.185},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ec/WannerGTF08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/icga/FangGK08,
author = {Haw{-}ren Fang and
James Glenn and
Clyde P. Kruskal},
title = {Retrograde Approximation Algorithms for Jeopardy Stochastic Games},
journal = {J. Int. Comput. Games Assoc.},
volume = {31},
number = {2},
pages = {77--96},
year = {2008},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/icga/FangGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/HamaneI08,
author = {Ryoso Hamane and
Toshiya Itoh},
title = {Improved Approximation Algorithms for Item Pricing with Bounded Degree
and Valuation},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {91-D},
number = {2},
pages = {187--199},
year = {2008},
url = {https://doi.org/10.1093/ietisy/e91-d.2.187},
doi = {10.1093/IETISY/E91-D.2.187},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/HamaneI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijwmip/Balazs08,
author = {P{\'{e}}ter Bal{\'{a}}zs},
title = {Hilbert-Schmidt Operators and Frames - Classification, Best Approximation
by Multipliers and Algorithms},
journal = {Int. J. Wavelets Multiresolution Inf. Process.},
volume = {6},
number = {2},
pages = {315--330},
year = {2008},
url = {https://doi.org/10.1142/S0219691308002379},
doi = {10.1142/S0219691308002379},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijwmip/Balazs08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ziegler08,
author = {Valentin Ziegler},
title = {Approximation algorithms for restricted Bayesian network structures},
journal = {Inf. Process. Lett.},
volume = {108},
number = {2},
pages = {60--63},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.03.015},
doi = {10.1016/J.IPL.2008.03.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ziegler08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/KuoSW08,
author = {Frances Y. Kuo and
Ian H. Sloan and
Henryk Wozniakowski},
title = {Lattice rule algorithms for multivariate approximation in the average
case setting},
journal = {J. Complex.},
volume = {24},
number = {2},
pages = {283--323},
year = {2008},
url = {https://doi.org/10.1016/j.jco.2006.10.006},
doi = {10.1016/J.JCO.2006.10.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/KuoSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HasanJC08,
author = {Mohammad Khairul Hasan and
Hyunwoo Jung and
Kyung{-}Yong Chwa},
title = {Approximation algorithms for connected facility location problems},
journal = {J. Comb. Optim.},
volume = {16},
number = {2},
pages = {155--172},
year = {2008},
url = {https://doi.org/10.1007/s10878-007-9130-0},
doi = {10.1007/S10878-007-9130-0},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HasanJC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CaramiaS08,
author = {Massimiliano Caramia and
Antonino Sgalambro},
title = {On the approximation of the single source k-splittable flow problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {277--289},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.03.001},
doi = {10.1016/J.JDA.2007.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CaramiaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ChenTW08,
author = {Zhi{-}Zhong Chen and
Ruka Tanahashi and
Lusheng Wang},
title = {An improved approximation algorithm for maximum edge 2-coloring in
simple graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {205--215},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.08.002},
doi = {10.1016/J.JDA.2007.08.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ChenTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MonnotT08,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
title = {Approximation results for the weighted P\({}_{\mbox{4}}\) partition
problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {299--312},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.006},
doi = {10.1016/J.JDA.2007.01.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MonnotT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/LavaultV08,
author = {Christian Lavault and
Mario Valencia{-}Pabon},
title = {A distributed approximation algorithm for the minimum degree minimum
weight spanning trees},
journal = {J. Parallel Distributed Comput.},
volume = {68},
number = {2},
pages = {200--208},
year = {2008},
url = {https://doi.org/10.1016/j.jpdc.2007.07.005},
doi = {10.1016/J.JPDC.2007.07.005},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/LavaultV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/KrumkeSVW08,
author = {Sven Oliver Krumke and
Sleman Saliba and
Tjark Vredeveld and
Stephan Westphal},
title = {Approximation algorithms for a vehicle routing problem},
journal = {Math. Methods Oper. Res.},
volume = {68},
number = {2},
pages = {333--359},
year = {2008},
url = {https://doi.org/10.1007/s00186-008-0224-y},
doi = {10.1007/S00186-008-0224-Y},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/KrumkeSVW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeviJN08,
author = {Retsef Levi and
Ganesh Janakiraman and
Mahesh Nagarajan},
title = {A 2-Approximation Algorithm for Stochastic Inventory Control Models
with Lost Sales},
journal = {Math. Oper. Res.},
volume = {33},
number = {2},
pages = {351--374},
year = {2008},
url = {https://doi.org/10.1287/moor.1070.0285},
doi = {10.1287/MOOR.1070.0285},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LeviJN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeviLS08,
author = {Retsef Levi and
Andrea Lodi and
Maxim Sviridenko},
title = {Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing
Problem via Flow-Cover Inequalities},
journal = {Math. Oper. Res.},
volume = {33},
number = {2},
pages = {461--474},
year = {2008},
url = {https://doi.org/10.1287/moor.1070.0305},
doi = {10.1287/MOOR.1070.0305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LeviLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/neco/IhmeMP08,
author = {Matthias Ihme and
Alison L. Marsden and
Heinz Pitsch},
title = {Generation of Optimal Artificial Neural Networks Using a Pattern Search
Algorithm: Application to Approximation of Chemical Systems},
journal = {Neural Comput.},
volume = {20},
number = {2},
pages = {573--601},
year = {2008},
url = {https://doi.org/10.1162/neco.2007.08-06-316},
doi = {10.1162/NECO.2007.08-06-316},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/neco/IhmeMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Scutella08,
author = {Maria Grazia Scutell{\`{a}}},
title = {The maximum congested cut problem and its robust counterpart: Exact
and approximation algorithms for the single and the multicommodity
case},
journal = {Networks},
volume = {51},
number = {2},
pages = {102--112},
year = {2008},
url = {https://doi.org/10.1002/net.20205},
doi = {10.1002/NET.20205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Scutella08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LaszloM08,
author = {Michael J. Laszlo and
Sumitra Mukherjee},
title = {An approximation algorithm for network design problems with downwards-monotone
demand functions},
journal = {Optim. Lett.},
volume = {2},
number = {2},
pages = {171--175},
year = {2008},
url = {https://doi.org/10.1007/s11590-007-0051-8},
doi = {10.1007/S11590-007-0051-8},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LaszloM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KasperskiZ08,
author = {Adam Kasperski and
Pawel Zielinski},
title = {A 2-approximation algorithm for interval data minmax regret sequencing
problems with the total flow time criterion},
journal = {Oper. Res. Lett.},
volume = {36},
number = {3},
pages = {343--344},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.11.004},
doi = {10.1016/J.ORL.2007.11.004},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KasperskiZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kellerer08,
author = {Hans Kellerer},
title = {An approximation algorithm for identical parallel machine scheduling
with resource dependent processing times},
journal = {Oper. Res. Lett.},
volume = {36},
number = {2},
pages = {157--159},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.08.001},
doi = {10.1016/J.ORL.2007.08.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kellerer08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KrumkeSSW08,
author = {Sven Oliver Krumke and
Anne Schwahn and
Rob van Stee and
Stephan Westphal},
title = {A monotone approximation algorithm for scheduling with precedence
constraints},
journal = {Oper. Res. Lett.},
volume = {36},
number = {2},
pages = {247--249},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.05.003},
doi = {10.1016/J.ORL.2007.05.003},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KrumkeSSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeHL08,
author = {Uriel Feige and
MohammadTaghi Hajiaghayi and
James R. Lee},
title = {Improved Approximation Algorithms for Minimum Weight Vertex Separators},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {2},
pages = {629--657},
year = {2008},
url = {https://doi.org/10.1137/05064299X},
doi = {10.1137/05064299X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeigeHL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChawlaGR08,
author = {Shuchi Chawla and
Anupam Gupta and
Harald R{\"{a}}cke},
title = {Embeddings of negative-type metrics and an improved approximation
to generalized sparsest cut},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {2},
pages = {22:1--22:18},
year = {2008},
url = {https://doi.org/10.1145/1361192.1361199},
doi = {10.1145/1361192.1361199},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChawlaGR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SandersS08,
author = {Peter Sanders and
David Steurer},
title = {An asymptotic approximation scheme for multigraph edge coloring},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {2},
pages = {21:1--21:24},
year = {2008},
url = {https://doi.org/10.1145/1361192.1361198},
doi = {10.1145/1361192.1361198},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/SandersS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/BordewichS08,
author = {Magnus Bordewich and
Charles Semple},
title = {Nature Reserve Selection Problem: {A} Tight Approximation Algorithm},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {5},
number = {2},
pages = {275--280},
year = {2008},
url = {https://doi.org/10.1109/TCBB.2007.70252},
doi = {10.1109/TCBB.2007.70252},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/BordewichS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GuhaH08,
author = {Sudipto Guha and
Boulos Harb},
title = {Approximation Algorithms for Wavelet Transform Coding of Data Streams},
journal = {{IEEE} Trans. Inf. Theory},
volume = {54},
number = {2},
pages = {811--830},
year = {2008},
url = {https://doi.org/10.1109/TIT.2007.913569},
doi = {10.1109/TIT.2007.913569},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GuhaH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/GuoSZ08,
author = {Zeyu Guo and
He Sun and
Hong Zhu},
editor = {Rudolf Fleischer and
Jinhui Xu},
title = {A Fast 2-Approximation Algorithm for the Minimum Manhattan Network
Problem},
booktitle = {Algorithmic Aspects in Information and Management, 4th International
Conference, {AAIM} 2008, Shanghai, China, June 23-25, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5034},
pages = {212--223},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68880-8\_21},
doi = {10.1007/978-3-540-68880-8\_21},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/GuoSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LouZ08,
author = {Xiaowen Lou and
Daming Zhu},
editor = {Xiaodong Hu and
Jie Wang},
title = {A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned
Circular Permutations},
booktitle = {Computing and Combinatorics, 14th Annual International Conference,
{COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5092},
pages = {331--341},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69733-6\_33},
doi = {10.1007/978-3-540-69733-6\_33},
timestamp = {Tue, 10 Dec 2019 14:59:33 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/LouZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenT08,
author = {Klaus Jansen and
Ralf Th{\"{o}}le},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Approximation Algorithms for Scheduling Parallel Jobs: Breaking the
Approximation Ratio of 2},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {234--245},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_20},
doi = {10.1007/978-3-540-70575-8\_20},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnc/WangZZL08,
author = {Qi Wang and
Xiuheng Zhao and
Xiaowei Zheng and
Xiaoshan Liu},
editor = {Maozu Guo and
Liang Zhao and
Lipo Wang},
title = {A 2-Approximation Algorithm for Weighted Directed Hypergraph Embedding
in a cycle},
booktitle = {Fourth International Conference on Natural Computation, {ICNC} 2008,
Jinan, Shandong, China, 18-20 October 2008, Volume 6},
pages = {377--381},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/ICNC.2008.241},
doi = {10.1109/ICNC.2008.241},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnc/WangZZL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BonsmaZ08,
author = {Paul S. Bonsma and
Florian Zickfeld},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {A 3/2-Approximation Algorithm for Finding Spanning Trees with Many
Leaves in Cubic Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {66--77},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_7},
doi = {10.1007/978-3-540-92248-3\_7},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/BonsmaZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/asc/Mazbic-KulmaS08,
author = {Barbara Mazbic{-}Kulma and
Krzysztof Sep},
editor = {Marek Kurzynski and
Edward Puchala and
Michal Wozniak and
Andrzej Zolnierek},
title = {Some Approximation Algorithms for Minimum Vertex Cover in a Hypergraph},
booktitle = {Computer Recognition Systems 2},
series = {Advances in Soft Computing},
volume = {45},
pages = {250--257},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-75175-5\_31},
doi = {10.1007/978-3-540-75175-5\_31},
timestamp = {Thu, 07 Nov 2019 15:14:22 +0100},
biburl = {https://dblp.org/rec/series/asc/Mazbic-KulmaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/Chiou07,
author = {Suh{-}Wen Chiou},
title = {A combinatorial approximation algorithm for supply chain network flow
problem},
journal = {Appl. Math. Comput.},
volume = {186},
number = {2},
pages = {1526--1536},
year = {2007},
url = {https://doi.org/10.1016/j.amc.2006.07.144},
doi = {10.1016/J.AMC.2006.07.144},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/Chiou07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/HouD07,
author = {Zai{-}En Hou and
Fu{-}Jian Duan},
title = {The approximation algorithm for solving a sort of non-smooth programming},
journal = {Appl. Math. Comput.},
volume = {186},
number = {2},
pages = {1511--1519},
year = {2007},
url = {https://doi.org/10.1016/j.amc.2006.06.129},
doi = {10.1016/J.AMC.2006.06.129},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/HouD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/YaoC07,
author = {Ming{-}Jong Yao and
Weng{-}Ming Chu},
title = {A new approximation algorithm for obtaining the probability distribution
function for project completion time},
journal = {Comput. Math. Appl.},
volume = {54},
number = {2},
pages = {282--295},
year = {2007},
url = {https://doi.org/10.1016/j.camwa.2007.01.036},
doi = {10.1016/J.CAMWA.2007.01.036},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cma/YaoC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/PengS07,
author = {Chao Peng and
Hong Shen},
title = {A New Approximation Algorithm for Computing 2-Restricted Disjoint
Paths},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {90-D},
number = {2},
pages = {465--472},
year = {2007},
url = {https://doi.org/10.1093/ietisy/e90-d.2.465},
doi = {10.1093/IETISY/E90-D.2.465},
timestamp = {Thu, 18 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicet/PengS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsnet/JangWK07,
author = {In Sock Jang and
Xiaodong Wang and
Vikram Krishnamurthy},
title = {Discrete stochastic approximation algorithms for design of optimal
sensor fusion rules},
journal = {Int. J. Sens. Networks},
volume = {2},
number = {3/4},
pages = {211--217},
year = {2007},
url = {https://doi.org/10.1504/IJSNET.2007.013201},
doi = {10.1504/IJSNET.2007.013201},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijsnet/JangWK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Cabello07,
author = {Sergio Cabello},
title = {Approximation algorithms for spreading points},
journal = {J. Algorithms},
volume = {62},
number = {2},
pages = {49--73},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.06.009},
doi = {10.1016/J.JALGOR.2004.06.009},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Cabello07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/Ben-David07,
author = {Shai Ben{-}David},
title = {A framework for statistical clustering with constant time approximation
algorithms for \emph{K}-median and \emph{K}-means clustering},
journal = {Mach. Learn.},
volume = {66},
number = {2-3},
pages = {243--257},
year = {2007},
url = {https://doi.org/10.1007/s10994-006-0587-3},
doi = {10.1007/S10994-006-0587-3},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/Ben-David07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/GuptaRS07,
author = {Anupam Gupta and
R. Ravi and
Amitabh Sinha},
title = {{LP} Rounding Approximation Algorithms for Stochastic Network Design},
journal = {Math. Oper. Res.},
volume = {32},
number = {2},
pages = {345--364},
year = {2007},
url = {https://doi.org/10.1287/moor.1060.0237},
doi = {10.1287/MOOR.1060.0237},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/GuptaRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeviPRS07,
author = {Retsef Levi and
Martin P{\'{a}}l and
Robin Roundy and
David B. Shmoys},
title = {Approximation Algorithms for Stochastic Inventory Control Models},
journal = {Math. Oper. Res.},
volume = {32},
number = {2},
pages = {284--302},
year = {2007},
url = {https://doi.org/10.1287/moor.1060.0205},
doi = {10.1287/MOOR.1060.0205},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LeviPRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/XuX07,
author = {Guang Xu and
Jinhui Xu},
title = {Constant Approximation Algorithms for Rectangle Stabbing and Related
Problems},
journal = {Theory Comput. Syst.},
volume = {40},
number = {2},
pages = {187--204},
year = {2007},
url = {https://doi.org/10.1007/s00224-005-1273-8},
doi = {10.1007/S00224-005-1273-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/XuX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/PennR07,
author = {Michal Penn and
Stas Rozenfeld},
title = {Approximation algorithm for the group Steiner network problem},
journal = {Networks},
volume = {49},
number = {2},
pages = {160--167},
year = {2007},
url = {https://doi.org/10.1002/net.20151},
doi = {10.1002/NET.20151},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/PennR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajS07,
author = {Artur Czumaj and
Christian Sohler},
title = {Sublinear-time approximation algorithms for clustering via random
sampling},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {226--256},
year = {2007},
url = {https://doi.org/10.1002/rsa.20157},
doi = {10.1002/RSA.20157},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Vondrak07,
author = {Jan Vondr{\'{a}}k},
title = {Shortest-path metric approximation for random subgraphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {95--104},
year = {2007},
url = {https://doi.org/10.1002/rsa.20150},
doi = {10.1002/RSA.20150},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Vondrak07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/ZhuGP07,
author = {Hongtu Zhu and
Minggao Gu and
Bradley S. Peterson},
title = {Maximum likelihood from spatial random effects models via the stochastic
approximation expectation maximization algorithm},
journal = {Stat. Comput.},
volume = {17},
number = {2},
pages = {163--177},
year = {2007},
url = {https://doi.org/10.1007/s11222-006-9012-9},
doi = {10.1007/S11222-006-9012-9},
timestamp = {Wed, 25 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sac/ZhuGP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumCKLMM07,
author = {Avrim Blum and
Shuchi Chawla and
David R. Karger and
Terran Lane and
Adam Meyerson and
Maria Minkoff},
title = {Approximation Algorithms for Orienteering and Discounted-Reward {TSP}},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {653--670},
year = {2007},
url = {https://doi.org/10.1137/050645464},
doi = {10.1137/050645464},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumCKLMM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MossR07,
author = {Anna Moss and
Yuval Rabani},
title = {Approximation Algorithms for Constrained Node Weighted Steiner Tree
Problems},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {460--481},
year = {2007},
url = {https://doi.org/10.1137/S0097539702420474},
doi = {10.1137/S0097539702420474},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MossR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MounieRT07,
author = {Gregory Mounie and
Christophe Rapine and
Denis Trystram},
title = {A 3/2-Approximation Algorithm for Scheduling Independent Monotonic
Malleable Tasks},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {401--412},
year = {2007},
url = {https://doi.org/10.1137/S0097539701385995},
doi = {10.1137/S0097539701385995},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MounieRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PalettaP07,
author = {Giuseppe Paletta and
Paolamaria Pietramala},
title = {A New Approximation Algorithm for the Nonpreemptive Scheduling of
Independent Jobs on Identical Parallel Processors},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {2},
pages = {313--328},
year = {2007},
url = {https://doi.org/10.1137/050634657},
doi = {10.1137/050634657},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PalettaP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BecchettiKLP07,
author = {Luca Becchetti and
Jochen K{\"{o}}nemann and
Stefano Leonardi and
Martin P{\'{a}}l},
title = {Sharing the cost more efficiently: Improved approximation for multicommodity
rent-or-buy},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {2},
pages = {23},
year = {2007},
url = {https://doi.org/10.1145/1240233.1240246},
doi = {10.1145/1240233.1240246},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BecchettiKLP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GairingMW07,
author = {Martin Gairing and
Burkhard Monien and
Andreas Woclaw},
title = {A faster combinatorial approximation algorithm for scheduling unrelated
parallel machines},
journal = {Theor. Comput. Sci.},
volume = {380},
number = {1-2},
pages = {87--99},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.056},
doi = {10.1016/J.TCS.2007.02.056},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GairingMW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tan07,
author = {Xuehou Tan},
title = {A linear-time 2-approximation algorithm for the watchman route problem
for simple polygons},
journal = {Theor. Comput. Sci.},
volume = {384},
number = {1},
pages = {92--103},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.05.021},
doi = {10.1016/J.TCS.2007.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tan07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/BroshLS07,
author = {Eli Brosh and
Asaf Levin and
Yuval Shavitt},
title = {Approximation and heuristic algorithms for minimum-delay application-layer
multicast trees},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {15},
number = {2},
pages = {473--484},
year = {2007},
url = {http://doi.acm.org/10.1145/1279660.1279678},
doi = {10.1145/1279660.1279678},
timestamp = {Tue, 23 Oct 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/BroshLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/FunkeKKLS07,
author = {Stefan Funke and
Alexander Kesselman and
Fabian Kuhn and
Zvi Lotker and
Michael Segal},
title = {Improved approximation algorithms for connected sensor cover},
journal = {Wirel. Networks},
volume = {13},
number = {2},
pages = {153--164},
year = {2007},
url = {https://doi.org/10.1007/s11276-006-3724-9},
doi = {10.1007/S11276-006-3724-9},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/winet/FunkeKKLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/ChenT07,
author = {Zhi{-}Zhong Chen and
Ruka Tanahashi},
editor = {Ming{-}Yang Kao and
Xiang{-}Yang Li},
title = {An Improved Approximation Algorithm for Maximum Edge 2-Coloring in
Simple Graphs},
booktitle = {Algorithmic Aspects in Information and Management, Third International
Conference, {AAIM} 2007, Portland, OR, USA, June 6-8, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4508},
pages = {27--36},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72870-2\_3},
doi = {10.1007/978-3-540-72870-2\_3},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/ChenT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/FuCA07,
author = {Bin Fu and
Zhixiang Chen and
Mahdi Abdelguerfi},
editor = {Ming{-}Yang Kao and
Xiang{-}Yang Li},
title = {An Almost Linear Time 2.8334-Approximation Algorithm for the Disc
Covering Problem},
booktitle = {Algorithmic Aspects in Information and Management, Third International
Conference, {AAIM} 2007, Portland, OR, USA, June 6-8, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4508},
pages = {317--326},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72870-2\_30},
doi = {10.1007/978-3-540-72870-2\_30},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/FuCA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/WengCWC07,
author = {Hsien{-}Cheng Weng and
Hope Chan and
Eric Hsiao{-}Kuang Wu and
Gen{-}Huey Chen},
title = {A 2-Approximation Double-Tree Algorithm for Correlated Data Gathering
in Wireless Sensor Networks},
booktitle = {Proceedings of the Global Communications Conference, 2007. {GLOBECOM}
'07, Washington, DC, USA, 26-30 November 2007},
pages = {898--902},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/GLOCOM.2007.173},
doi = {10.1109/GLOCOM.2007.173},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/WengCWC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/ChenLT07,
author = {Yen Hung Chen and
Gwo{-}Liang Liao and
Chuan Yi Tang},
editor = {Osvaldo Gervasi and
Marina L. Gavrilova},
title = {Approximation Algorithms for 2-Source Minimum Routing Cost \emph{k}
-Tree Problems},
booktitle = {Computational Science and Its Applications - {ICCSA} 2007, International
Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings.
Part {III}},
series = {Lecture Notes in Computer Science},
volume = {4707},
pages = {520--533},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74484-9\_45},
doi = {10.1007/978-3-540-74484-9\_45},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/ChenLT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ShmoysS07,
author = {David B. Shmoys and
Mauro Sozio},
editor = {Matteo Fischetti and
David P. Williamson},
title = {Approximation Algorithms for 2-Stage Stochastic Scheduling Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 12th International
{IPCO} Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4513},
pages = {145--157},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72792-7\_12},
doi = {10.1007/978-3-540-72792-7\_12},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ShmoysS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/KrumkeMNR07,
author = {Sven Oliver Krumke and
Peter Merz and
Tim Nonner and
Katharina Rupp},
editor = {Eduardo Tovar and
Philippas Tsigas and
Hac{\`{e}}ne Fouchal},
title = {Distributed Approximation Algorithms for Finding 2-Edge-Connected
Subgraphs},
booktitle = {Principles of Distributed Systems, 11th International Conference,
{OPODIS} 2007, Guadeloupe, French West Indies, December 17-20, 2007.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4878},
pages = {159--173},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77096-1\_12},
doi = {10.1007/978-3-540-77096-1\_12},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/opodis/KrumkeMNR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AgeevP07,
author = {Alexander A. Ageev and
Artem V. Pyatkin},
editor = {Christos Kaklamanis and
Martin Skutella},
title = {A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman
Problem},
booktitle = {Approximation and Online Algorithms, 5th International Workshop, {WAOA}
2007, Eilat, Israel, October 11-12, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4927},
pages = {103--115},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77918-6\_9},
doi = {10.1007/978-3-540-77918-6\_9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AgeevP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-3335,
author = {Qiaoming Han and
Abraham P. Punnen and
Yinyu Ye},
title = {A polynomial time {\textdollar}{\textbackslash}frac 3 2{\textdollar}
-approximation algorithm for the vertex cover problem on a class of
graphs},
journal = {CoRR},
volume = {abs/0712.3335},
year = {2007},
url = {http://arxiv.org/abs/0712.3335},
eprinttype = {arXiv},
eprint = {0712.3335},
timestamp = {Sun, 18 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-3335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GlazkovBGCP06,
author = {Yury Glazkov and
Alexey Baburin and
Edward Gimadi and
Federico Della Croce and
Vangelis Th. Paschos},
title = {Approximation algorithms for 2-Peripathetic Salesman Problem with
edge weights 1 and 2},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {35--36},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.043},
doi = {10.1016/J.ENDM.2006.08.043},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GlazkovBGCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KongS06,
author = {Nan Kong and
Andrew J. Schaefer},
title = {A factor 1/2 approximation algorithm for two-stage stochastic matching
problems},
journal = {Eur. J. Oper. Res.},
volume = {172},
number = {3},
pages = {740--746},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2004.10.011},
doi = {10.1016/J.EJOR.2004.10.011},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KongS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fac/SubramaniT06,
author = {K. Subramani and
C. Tauras},
title = {An approximation algorithm for state minimization in 2-MDFAs},
journal = {Formal Aspects Comput.},
volume = {18},
number = {4},
pages = {421--431},
year = {2006},
url = {https://doi.org/10.1007/s00165-006-0005-4},
doi = {10.1007/S00165-006-0005-4},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fac/SubramaniT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HartmanS06,
author = {Tzvika Hartman and
Ron Shamir},
title = {A simpler and faster 1.5-approximation algorithm for sorting by transpositions},
journal = {Inf. Comput.},
volume = {204},
number = {2},
pages = {275--290},
year = {2006},
url = {https://doi.org/10.1016/j.ic.2005.09.002},
doi = {10.1016/J.IC.2005.09.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HartmanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/IwamaMO06,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Kazuya Okamoto},
title = {A {(2} - \emph{c}log \emph{N}/\emph{N})-Approximation Algorithm for
the Stable Marriage Problem},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {89-D},
number = {8},
pages = {2380--2387},
year = {2006},
url = {https://doi.org/10.1093/ietisy/e89-d.8.2380},
doi = {10.1093/IETISY/E89-D.8.2380},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/IwamaMO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ZhengOW06,
author = {Hua Zheng and
Shingo Omura and
Koichi Wada},
title = {An Approximation Algorithm for Minimum Certificate Dispersal Problems},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {89-A},
number = {2},
pages = {551--558},
year = {2006},
url = {https://doi.org/10.1093/ietfec/e89-a.2.551},
doi = {10.1093/IETFEC/E89-A.2.551},
timestamp = {Mon, 22 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicet/ZhengOW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tan06a,
author = {Xuehou Tan},
title = {A 2-approximation algorithm for the zookeeper's problem},
journal = {Inf. Process. Lett.},
volume = {100},
number = {5},
pages = {183--187},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.06.005},
doi = {10.1016/J.IPL.2006.06.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tan06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jat/Hofinger06,
author = {Andreas Hofinger},
title = {Nonlinear function approximation: Computing smooth solutions with
an adaptive greedy algorithm},
journal = {J. Approx. Theory},
volume = {143},
number = {2},
pages = {159--175},
year = {2006},
url = {https://doi.org/10.1016/j.jat.2006.03.016},
doi = {10.1016/J.JAT.2006.03.016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jat/Hofinger06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FleischerJW06,
author = {Lisa Fleischer and
Kamal Jain and
David P. Williamson},
title = {Iterative rounding 2-approximation algorithms for minimum-cost vertex
connectivity problems},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {5},
pages = {838--867},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.05.006},
doi = {10.1016/J.JCSS.2005.05.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FleischerJW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bar-YehudaY06,
author = {Reuven Bar{-}Yehuda and
Irad Yavneh},
title = {A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {123--139},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00121},
doi = {10.7155/JGAA.00121},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Bar-YehudaY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DemangeEW06,
author = {Marc Demange and
T{\'{\i}}naz Ekim and
Dominique de Werra},
title = {On the approximation of Min Split-coloring and Min Cocoloring},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {297--315},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00129},
doi = {10.7155/JGAA.00129},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DemangeEW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AroraK06,
author = {Sanjeev Arora and
George Karakostas},
title = {A 2 + \emph{epsilon} approximation algorithm for the \emph{k}-MST
problem},
journal = {Math. Program.},
volume = {107},
number = {3},
pages = {491--504},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0693-1},
doi = {10.1007/S10107-005-0693-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/AroraK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/RapunS06,
author = {Mar{\'{\i}}a{-}Luisa Rap{\'{u}}n and
Francisco{-}Javier Sayas},
title = {Boundary integral approximation of a heat-diffusion problem in time-harmonic
regime},
journal = {Numer. Algorithms},
volume = {41},
number = {2},
pages = {127--160},
year = {2006},
url = {https://doi.org/10.1007/s11075-005-9002-6},
doi = {10.1007/S11075-005-9002-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/RapunS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FariasR06,
author = {Vivek F. Farias and
Benjamin Van Roy},
title = {Approximation algorithms for dynamic resource allocation},
journal = {Oper. Res. Lett.},
volume = {34},
number = {2},
pages = {180--190},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.02.006},
doi = {10.1016/J.ORL.2005.02.006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FariasR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Pisaruk06,
author = {Nicolai N. Pisaruk},
title = {A 2-approximation algorithm for the network substitution problem},
journal = {Oper. Res. Lett.},
volume = {34},
number = {1},
pages = {94--96},
year = {2006},
url = {https://doi.org/10.1016/j.orl.2005.03.005},
doi = {10.1016/J.ORL.2005.03.005},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Pisaruk06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MahdianYZ06,
author = {Mohammad Mahdian and
Yinyu Ye and
Jiawei Zhang},
title = {Approximation Algorithms for Metric Facility Location Problems},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {2},
pages = {411--432},
year = {2006},
url = {https://doi.org/10.1137/S0097539703435716},
doi = {10.1137/S0097539703435716},
timestamp = {Thu, 12 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MahdianYZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/Jansen06,
author = {Klaus Jansen},
title = {Approximation Algorithm for the Mixed Fractional Packing and Covering
Problem},
journal = {{SIAM} J. Optim.},
volume = {17},
number = {2},
pages = {331--352},
year = {2006},
url = {https://doi.org/10.1137/030601570},
doi = {10.1137/030601570},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/Jansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/SwamyS06,
author = {Chaitanya Swamy and
David B. Shmoys},
title = {Approximation algorithms for 2-stage stochastic optimization problems},
journal = {{SIGACT} News},
volume = {37},
number = {1},
pages = {33--46},
year = {2006},
url = {https://doi.org/10.1145/1122480.1122493},
doi = {10.1145/1122480.1122493},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/SwamyS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FeigenbaumIMNSW06,
author = {Joan Feigenbaum and
Yuval Ishai and
Tal Malkin and
Kobbi Nissim and
Martin J. Strauss and
Rebecca N. Wright},
title = {Secure multiparty computation of approximations},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {435--472},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159900},
doi = {10.1145/1159892.1159900},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FeigenbaumIMNSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansenZ06,
author = {Klaus Jansen and
Hu Zhang},
title = {An approximation algorithm for scheduling malleable tasks under general
precedence constraints},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {416--434},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159899},
doi = {10.1145/1159892.1159899},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/JansenZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Johnson06,
author = {David S. Johnson},
title = {The NP-completeness column: The many limits on approximation},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {473--489},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159901},
doi = {10.1145/1159892.1159901},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Johnson06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DeckerLM06,
author = {Thomas Decker and
Thomas L{\"{u}}cking and
Burkhard Monien},
title = {A 5/4-approximation algorithm for scheduling identical malleable tasks},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {226--240},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.012},
doi = {10.1016/J.TCS.2006.05.012},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DeckerLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrystaL06,
author = {Piotr Krysta and
Krzysztof Lorys},
title = {Efficient approximation algorithms for the achromatic number},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {150--171},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.007},
doi = {10.1016/J.TCS.2006.05.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrystaL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cluster/FujimotoH06,
author = {Noriyuki Fujimoto and
Kenichi Hagihara},
title = {A 2-Approximation Algorithm for Scheduling Independent Tasks onto
a Uniform Parallel Machine and its Extension to a Computational Grid},
booktitle = {Proceedings of the 2006 {IEEE} International Conference on Cluster
Computing, September 25-28, 2006, Barcelona, Spain},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CLUSTR.2006.311905},
doi = {10.1109/CLUSTR.2006.311905},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cluster/FujimotoH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/SwamyS06,
author = {Chaitanya Swamy and
David B. Shmoys},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Approximation Algorithms for 2-Stage Stochastic Optimization Problems},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {5--19},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_3},
doi = {10.1007/11944836\_3},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/SwamyS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Fujito06,
author = {Toshihiro Fujito},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {How to Trim an {MST:} {A} 2-Approximation Algorithm for Minimum Cost
Tree Cover},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {431--442},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_38},
doi = {10.1007/11786986\_38},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Fujito06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanK06,
author = {Piotr Berman and
Marek Karpinski},
title = {8/7-approximation algorithm for (1, 2)-TSP},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {641--648},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109627},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Tan06,
author = {Xuehou Tan},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Linear-Time 2-Approximation Algorithm for the Watchman Route Problem},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {181--191},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_17},
doi = {10.1007/11750321\_17},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Tan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/Val05,
author = {Alvaro del Val},
title = {First order {LUB} approximations: characterization and algorithms},
journal = {Artif. Intell.},
volume = {162},
number = {1-2},
pages = {7--48},
year = {2005},
url = {https://doi.org/10.1016/j.artint.2004.01.003},
doi = {10.1016/J.ARTINT.2004.01.003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/Val05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KarpinskiMOZ05,
author = {Marek Karpinski and
Ion I. Mandoiu and
Alexander Olshevsky and
Alexander Zelikovsky},
title = {Improved Approximation Algorithms for the Quality of Service Multicast
Tree Problem},
journal = {Algorithmica},
volume = {42},
number = {2},
pages = {109--120},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1133-y},
doi = {10.1007/S00453-004-1133-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KarpinskiMOZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/EspelageW05,
author = {Wolfgang Espelage and
Egon Wanke},
title = {A linear time approximation algorithm for movement minimization in
conveyor flow shop processing},
journal = {Eur. J. Oper. Res.},
volume = {160},
number = {2},
pages = {485--500},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.07.011},
doi = {10.1016/J.EJOR.2003.07.011},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/EspelageW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GeismarDS05,
author = {H. Neil Geismar and
Milind Dawande and
Chelliah Sriskandarajah},
title = {Approximation algorithms for k},
journal = {Eur. J. Oper. Res.},
volume = {162},
number = {2},
pages = {291--309},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.09.013},
doi = {10.1016/J.EJOR.2003.09.013},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/GeismarDS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/MashimaTW05,
author = {Toshiya Mashima and
Satoshi Taoka and
Toshimasa Watanabe},
title = {A 2-Approximation Algorithm to (\emph{k} + 1)-Edge-Connect a Specified
Set of Vertices in a \emph{k}-Edge-Connected Graph},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {88-A},
number = {5},
pages = {1290--1300},
year = {2005},
url = {https://doi.org/10.1093/ietfec/e88-a.5.1290},
doi = {10.1093/IETFEC/E88-A.5.1290},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/MashimaTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JansenMS05,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
title = {Approximation algorithms for flexible job shop problems},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {2},
pages = {361--379},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003030},
doi = {10.1142/S0129054105003030},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/JansenMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenOW05,
author = {Zhi{-}Zhong Chen and
Yuusuke Okamoto and
Lusheng Wang},
title = {Improved deterministic approximation algorithms for Max {TSP}},
journal = {Inf. Process. Lett.},
volume = {95},
number = {2},
pages = {333--342},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.03.011},
doi = {10.1016/J.IPL.2005.03.011},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ChenOW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CzumajHLN05,
author = {Artur Czumaj and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Andrzej Lingas and
Johan Nilsson},
title = {Approximation algorithms for optimization problems in graphs with
superlogarithmic treewidth},
journal = {Inf. Process. Lett.},
volume = {94},
number = {2},
pages = {49--53},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2004.12.017},
doi = {10.1016/J.IPL.2004.12.017},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CzumajHLN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Nagamochi05,
author = {Hiroshi Nagamochi},
title = {A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation
in a connected graph},
journal = {J. Algorithms},
volume = {56},
number = {2},
pages = {77--95},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2005.01.008},
doi = {10.1016/J.JALGOR.2005.01.008},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Nagamochi05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JagerS05,
author = {Gerold J{\"{a}}ger and
Anand Srivastav},
title = {Improved Approximation Algorithms for Maximum Graph Partitioning Problems},
journal = {J. Comb. Optim.},
volume = {10},
number = {2},
pages = {133--167},
year = {2005},
url = {https://doi.org/10.1007/s10878-005-2269-7},
doi = {10.1007/S10878-005-2269-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JagerS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Sakamoto05,
author = {Hiroshi Sakamoto},
title = {A fully linear-time approximation algorithm for grammar-based compression},
journal = {J. Discrete Algorithms},
volume = {3},
number = {2-4},
pages = {416--430},
year = {2005},
url = {https://doi.org/10.1016/j.jda.2004.08.016},
doi = {10.1016/J.JDA.2004.08.016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Sakamoto05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChudakW05,
author = {Fabi{\'{a}}n A. Chudak and
David P. Williamson},
title = {Improved approximation algorithms for capacitated facility location
problems},
journal = {Math. Program.},
volume = {102},
number = {2},
pages = {207--222},
year = {2005},
url = {https://doi.org/10.1007/s10107-004-0524-9},
doi = {10.1007/S10107-004-0524-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ChudakW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mssp/WangZB05,
author = {Dali Wang and
Ali Zilouchian and
Ying Bai},
title = {An Algorithm for Balanced Approximation and Model Reduction of 2-D
Separable-in-Denominator Filters},
journal = {Multidimens. Syst. Signal Process.},
volume = {16},
number = {4},
pages = {439--461},
year = {2005},
url = {https://doi.org/10.1007/s11045-005-4128-1},
doi = {10.1007/S11045-005-4128-1},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mssp/WangZB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/FordT05,
author = {Judith M. Ford and
Eugene E. Tyrtyshnikov},
title = {Solving linear systems using wavelet compression combined with Kronecker
product approximation},
journal = {Numer. Algorithms},
volume = {40},
number = {2},
pages = {125--135},
year = {2005},
url = {https://doi.org/10.1007/s11075-005-1524-4},
doi = {10.1007/S11075-005-1524-4},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/FordT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Woeginger05,
author = {Gerhard J. Woeginger},
title = {Combinatorial approximation algorithms: a comparative review},
journal = {Oper. Res. Lett.},
volume = {33},
number = {2},
pages = {210--215},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.03.010},
doi = {10.1016/J.ORL.2004.03.010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Woeginger05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Zhang05,
author = {Guochuan Zhang},
title = {A 3-approximation algorithm for two-dimensional bin packing},
journal = {Oper. Res. Lett.},
volume = {33},
number = {2},
pages = {121--126},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.04.004},
doi = {10.1016/J.ORL.2004.04.004},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Zhang05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JothiR05,
author = {Raja Jothi and
Balaji Raghavachari},
title = {Approximation algorithms for the capacitated minimum spanning tree
problem and its variants in network design},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {2},
pages = {265--282},
year = {2005},
url = {https://doi.org/10.1145/1103963.1103967},
doi = {10.1145/1103963.1103967},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/JothiR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/BerryPS05,
author = {Michael W. Berry and
Shakhina A. Pulatova and
G. W. Stewart},
title = {Algorithm 844: Computing sparse reduced-rank approximations to sparse
matrices},
journal = {{ACM} Trans. Math. Softw.},
volume = {31},
number = {2},
pages = {252--269},
year = {2005},
url = {https://doi.org/10.1145/1067967.1067972},
doi = {10.1145/1067967.1067972},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toms/BerryPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FischerG05,
author = {Johannes Fischer and
Simon W. Ginzinger},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {A 2-Approximation Algorithm for Sorting by Prefix Reversals},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {415--425},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_38},
doi = {10.1007/11561071\_38},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/FischerG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BeinLMS05,
author = {Wolfgang W. Bein and
Lawrence L. Larmore and
Linda Morales and
Ivan Hal Sudborough},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {A Faster and Simpler 2-Approximation Algorithm for Block Sorting},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {115--124},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_11},
doi = {10.1007/11537311\_11},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BeinLMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/IwamaMY05,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Naoya Yamauchi},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage
Problem},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {902--914},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_90},
doi = {10.1007/11602613\_90},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/IwamaMY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SwamyS05,
author = {Chaitanya Swamy and
David B. Shmoys},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/72},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SwamyS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-069,
author = {Piotr Berman and
Marek Karpinski},
title = {8/7-Approximation Algorithm for (1,2)-TSP},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-069}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-069/index.html},
eprinttype = {ECCC},
eprint = {TR05-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArkinHRS04,
author = {Esther M. Arkin and
Refael Hassin and
Shlomi Rubinstein and
Maxim Sviridenko},
title = {Approximations for Maximum Transportation with Permutable Supply Vector
and Other Capacitated Star Packing Problems},
journal = {Algorithmica},
volume = {39},
number = {2},
pages = {175--187},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1087-0},
doi = {10.1007/S00453-004-1087-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArkinHRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/Sahai04a,
author = {Ashok Sahai},
title = {An iterative algorithm for improved approximation by Bernstein's operator
using statistical perspective},
journal = {Appl. Math. Comput.},
volume = {149},
number = {2},
pages = {327--335},
year = {2004},
url = {https://doi.org/10.1016/S0096-3003(03)00081-X},
doi = {10.1016/S0096-3003(03)00081-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/Sahai04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KanungoMNPSW04,
author = {Tapas Kanungo and
David M. Mount and
Nathan S. Netanyahu and
Christine D. Piatko and
Ruth Silverman and
Angela Y. Wu},
title = {A local search approximation algorithm for k-means clustering},
journal = {Comput. Geom.},
volume = {28},
number = {2-3},
pages = {89--112},
year = {2004},
url = {https://doi.org/10.1016/j.comgeo.2004.03.003},
doi = {10.1016/J.COMGEO.2004.03.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/KanungoMNPSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Minoux04,
author = {Michel Minoux},
title = {Polynomial approximation schemes and exact algorithms for optimum
curve segmentation problems},
journal = {Discret. Appl. Math.},
volume = {144},
number = {1-2},
pages = {158--172},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.05.003},
doi = {10.1016/J.DAM.2004.05.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Minoux04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NagamochiO04,
author = {Hiroshi Nagamochi and
Kohei Okada},
title = {A faster 2-approximation algorithm for the minmax p-traveling salesmen
problem on a tree},
journal = {Discret. Appl. Math.},
volume = {140},
number = {1-3},
pages = {103--114},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2003.06.001},
doi = {10.1016/J.DAM.2003.06.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NagamochiO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Tan04,
author = {Xuehou Tan},
title = {Approximation algorithms for the watchman route and zookeeper's problems},
journal = {Discret. Appl. Math.},
volume = {136},
number = {2-3},
pages = {363--376},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00451-7},
doi = {10.1016/S0166-218X(03)00451-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Tan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/WuCMS04,
author = {Xiaodong Wu and
Danny Z. Chen and
James J. Mason and
Steven R. Schmid},
title = {Efficient approximation algorithms for pairwise data clustering and
applications},
journal = {Int. J. Comput. Geom. Appl.},
volume = {14},
number = {1-2},
pages = {85--104},
year = {2004},
url = {https://doi.org/10.1142/S0218195904001378},
doi = {10.1142/S0218195904001378},
timestamp = {Fri, 26 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijcga/WuCMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijig/SarkarSS04,
author = {Biswajit Sarkar and
Lokendra Kumar Singh and
Debranjan Sarkar},
title = {A Genetic Algorithm-Based Approach For Detection Of Significant Vertices
For Polygonal Approximation Of Digital Curves},
journal = {Int. J. Image Graph.},
volume = {4},
number = {2},
pages = {223--239},
year = {2004},
url = {https://doi.org/10.1142/S0219467804001385},
doi = {10.1142/S0219467804001385},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijig/SarkarSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FujitoD04,
author = {Toshihiro Fujito and
Takashi Doi},
title = {A 2-approximation {NC} algorithm for connected vertex cover and tree
cover},
journal = {Inf. Process. Lett.},
volume = {90},
number = {2},
pages = {59--63},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.01.011},
doi = {10.1016/J.IPL.2004.01.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FujitoD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KlasingL04,
author = {Ralf Klasing and
Christian Laforest},
title = {Hardness results and approximation algorithms of k-tuple domination
in graphs},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {75--83},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.004},
doi = {10.1016/J.IPL.2003.10.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KlasingL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AzarERW04,
author = {Yossi Azar and
Leah Epstein and
Yossi Richter and
Gerhard J. Woeginger},
title = {All-norm approximation algorithms},
journal = {J. Algorithms},
volume = {52},
number = {2},
pages = {120--133},
year = {2004},
url = {https://doi.org/10.1016/j.jalgor.2004.02.003},
doi = {10.1016/J.JALGOR.2004.02.003},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AzarERW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Vishwanathan04,
author = {Sundar Vishwanathan},
title = {An approximation algorithm for finding long paths in Hamiltonian graphs},
journal = {J. Algorithms},
volume = {50},
number = {2},
pages = {246--256},
year = {2004},
url = {https://doi.org/10.1016/S0196-6774(03)00093-2},
doi = {10.1016/S0196-6774(03)00093-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Vishwanathan04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinJ04,
author = {Guohui Lin and
Tao Jiang},
title = {A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {183--194},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031419.12290.2b},
doi = {10.1023/B:JOCO.0000031419.12290.2B},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DemaineHNRT04,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Approximation algorithms for classes of graphs excluding single-crossing
graphs as minors},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {166--195},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.12.001},
doi = {10.1016/J.JCSS.2003.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DemaineHNRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GoemansW04,
author = {Michel X. Goemans and
David P. Williamson},
title = {Approximation algorithms for M\({}_{\mbox{AX}}\)-3-C\({}_{\mbox{UT}}\)
and other problems via complex semidefinite programming},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {2},
pages = {442--470},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.07.012},
doi = {10.1016/J.JCSS.2003.07.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GoemansW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GasieniecJL04,
author = {Leszek Gasieniec and
Jesper Jansson and
Andrzej Lingas},
title = {Approximation algorithms for Hamming clustering problems},
journal = {J. Discrete Algorithms},
volume = {2},
number = {2},
pages = {289--301},
year = {2004},
url = {https://doi.org/10.1016/S1570-8667(03)00079-0},
doi = {10.1016/S1570-8667(03)00079-0},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/GasieniecJL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jvcir/Yin04,
author = {Peng{-}Yeng Yin},
title = {A discrete particle swarm algorithm for optimal polygonal approximation
of digital curves},
journal = {J. Vis. Commun. Image Represent.},
volume = {15},
number = {2},
pages = {241--260},
year = {2004},
url = {https://doi.org/10.1016/j.jvcir.2003.12.001},
doi = {10.1016/J.JVCIR.2003.12.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jvcir/Yin04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/monet/HuangRS04,
author = {Hai Huang and
Andr{\'{e}}a W. Richa and
Michael Segal},
title = {Approximation Algorithms for the Mobile Piercing Set Problem with
Applications to Clustering in Ad-Hoc Networks},
journal = {Mob. Networks Appl.},
volume = {9},
number = {2},
pages = {151--161},
year = {2004},
url = {https://doi.org/10.1023/B:MONE.0000013626.53247.1c},
doi = {10.1023/B:MONE.0000013626.53247.1C},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/monet/HuangRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuKR04,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
title = {Approximation Algorithms for the 0-Extension Problem},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {358--372},
year = {2004},
url = {https://doi.org/10.1137/S0097539701395978},
doi = {10.1137/S0097539701395978},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CalinescuKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Tadic04,
author = {Vladislav B. Tadic},
title = {On the almost sure rate of convergence of linear stochastic approximation
algorithms},
journal = {{IEEE} Trans. Inf. Theory},
volume = {50},
number = {2},
pages = {401--409},
year = {2004},
url = {https://doi.org/10.1109/TIT.2003.821971},
doi = {10.1109/TIT.2003.821971},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/Tadic04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Paluch04,
author = {Katarzyna E. Paluch},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {A 2(1/8)-Approximation Algorithm for Rectangle Tiling},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {1054--1065},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_88},
doi = {10.1007/978-3-540-27836-8\_88},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Paluch04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IwamaMO04,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Kazuya Okamoto},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {349--361},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_30},
doi = {10.1007/978-3-540-27810-8\_30},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/IwamaMO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuFKZ03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Howard J. Karloff and
Alexander Zelikovsky},
title = {A New Approximation Algorithm for Finding Heavy Planar Subgraphs},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {179--205},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1020-3},
doi = {10.1007/S00453-002-1020-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuFKZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AgarwalPV03,
author = {Pankaj K. Agarwal and
Cecilia Magdalena Procopiuc and
Kasturi R. Varadarajan},
title = {A (1+)-approximation algorithm for 2-line-center},
journal = {Comput. Geom.},
volume = {26},
number = {2},
pages = {119--128},
year = {2003},
url = {https://doi.org/10.1016/S0925-7721(03)00017-8},
doi = {10.1016/S0925-7721(03)00017-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AgarwalPV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KarunoN03,
author = {Yoshiyuki Karuno and
Hiroshi Nagamochi},
title = {2-Approximation algorithms for the multi-vehicle scheduling problem
on a path with release and handling times},
journal = {Discret. Appl. Math.},
volume = {129},
number = {2-3},
pages = {433--447},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00596-6},
doi = {10.1016/S0166-218X(02)00596-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KarunoN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Pisaruk03,
author = {Nicolai N. Pisaruk},
title = {A fully combinatorial 2-approximation algorithm for precedence-constrained
scheduling a single machine to minimize average weighted completion
time},
journal = {Discret. Appl. Math.},
volume = {131},
number = {3},
pages = {655--663},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(03)00334-2},
doi = {10.1016/S0166-218X(03)00334-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Pisaruk03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZhaoNI03,
author = {Liang Zhao and
Hiroshi Nagamochi and
Toshihide Ibaraki},
title = {A primal-dual approximation algorithm for the survivable network design
problem in hypergraphs},
journal = {Discret. Appl. Math.},
volume = {126},
number = {2-3},
pages = {275--289},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00201-9},
doi = {10.1016/S0166-218X(02)00201-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ZhaoNI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/deds/NedicB03,
author = {Angelia Nedic and
Dimitri P. Bertsekas},
title = {Least Squares Policy Evaluation Algorithms with Linear Function Approximation},
journal = {Discret. Event Dyn. Syst.},
volume = {13},
number = {1-2},
pages = {79--110},
year = {2003},
url = {https://doi.org/10.1023/A:1022192903948},
doi = {10.1023/A:1022192903948},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/deds/NedicB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Varpaaniemi03,
author = {Kimmo Varpaaniemi},
title = {Towards Ambitious Approximation Algorithms in Stubborn Set Optimization},
journal = {Fundam. Informaticae},
volume = {54},
number = {2-3},
pages = {279--294},
year = {2003},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi54-2-3-13},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Varpaaniemi03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/CapraraKP03,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy},
title = {A 3/4-Approximation Algorithm for Multiple Subset Sum},
journal = {J. Heuristics},
volume = {9},
number = {2},
pages = {99--111},
year = {2003},
url = {https://doi.org/10.1023/A:1022584312032},
doi = {10.1023/A:1022584312032},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/heuristics/CapraraKP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieiceta/TamuraTW03,
author = {Makoto Tamura and
Satoshi Taoka and
Toshimasa Watanabe},
title = {A 2-Approximation Algorithm 2-\emph{ABIS} for 2-Vertex-Connectivity
Augmentation of Specified Vertices in a Graph},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {86-A},
number = {4},
pages = {822--828},
year = {2003},
url = {http://search.ieice.org/bin/summary.php?id=e86-a\_4\_822},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/TamuraTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GaurGK03,
author = {Daya Ram Gaur and
Arvind Gupta and
Ramesh Krishnamurti},
title = {A 5/3-approximation algorithm for scheduling vehicles on a path with
release and handling times},
journal = {Inf. Process. Lett.},
volume = {86},
number = {2},
pages = {87--91},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00474-X},
doi = {10.1016/S0020-0190(02)00474-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GaurGK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AgarwalP03,
author = {Pankaj K. Agarwal and
Cecilia Magdalena Procopiuc},
title = {Approximation algorithms for projective clustering},
journal = {J. Algorithms},
volume = {46},
number = {2},
pages = {115--139},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(02)00295-X},
doi = {10.1016/S0196-6774(02)00295-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AgarwalP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanDM03,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
title = {Approximation algorithms for {MAX-MIN} tiling},
journal = {J. Algorithms},
volume = {47},
number = {2},
pages = {122--134},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00015-4},
doi = {10.1016/S0196-6774(03)00015-4},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanDM03.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/jal/DengLZZ03,
author = {Xiaotie Deng and
Guojun Li and
Wenan Zang and
Yi Zhou},
title = {A 2-approximation algorithm for path coloring on a restricted class
of trees of rings},
journal = {J. Algorithms},
volume = {47},
number = {1},
pages = {1--13},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00003-8},
doi = {10.1016/S0196-6774(03)00003-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/DengLZZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GuhaMM03,
author = {Sudipto Guha and
Adam Meyerson and
Kamesh Munagala},
title = {A constant factor approximation algorithm for the fault-tolerant facility
location problem},
journal = {J. Algorithms},
volume = {48},
number = {2},
pages = {429--440},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00056-7},
doi = {10.1016/S0196-6774(03)00056-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GuhaMM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Allasia03,
author = {Giampietro Allasia},
title = {Simultaneous Interpolation and Approximation by a Class of Multivariate
Positive Operators},
journal = {Numer. Algorithms},
volume = {34},
number = {2-4},
pages = {147--158},
year = {2003},
url = {https://doi.org/10.1023/B:NUMA.0000005359.72118.b6},
doi = {10.1023/B:NUMA.0000005359.72118.B6},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Allasia03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KellererK03,
author = {Hans Kellerer and
Vladimir Kotov},
title = {An approximation algorithm with absolute worst-case performance ratio
2 for two-dimensional vector packing},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {35--41},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00173-6},
doi = {10.1016/S0167-6377(02)00173-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KellererK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/Rosin03,
author = {Paul L. Rosin},
title = {Assessing the behaviour of polygonal approximation algorithms},
journal = {Pattern Recognit.},
volume = {36},
number = {2},
pages = {505--518},
year = {2003},
url = {https://doi.org/10.1016/S0031-3203(02)00076-6},
doi = {10.1016/S0031-3203(02)00076-6},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pr/Rosin03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scp/BerghammerR03,
author = {Rudolf Berghammer and
Florian Reuter},
title = {A linear approximation algorithm for bin packing with absolute approximation
factor 3/2},
journal = {Sci. Comput. Program.},
volume = {48},
number = {1},
pages = {67--80},
year = {2003},
url = {https://doi.org/10.1016/S0167-6423(03)00011-X},
doi = {10.1016/S0167-6423(03)00011-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scp/BerghammerR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LewensteinS03,
author = {Moshe Lewenstein and
Maxim Sviridenko},
title = {A 5/8 Approximation Algorithm for the Maximum Asymmetric {TSP}},
journal = {{SIAM} J. Discret. Math.},
volume = {17},
number = {2},
pages = {237--248},
year = {2003},
url = {https://doi.org/10.1137/S0895480102402861},
doi = {10.1137/S0895480102402861},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LewensteinS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Masum03,
author = {Hassan Masum},
title = {Review of Algorithmics for hard problems: introduction to combinatorial
optimization, randomization, approximation, and heuristics by Juraj
Hromkovic. Springer 2001},
journal = {{SIGACT} News},
volume = {34},
number = {2},
pages = {6--8},
year = {2003},
url = {https://doi.org/10.1145/882116.882121},
doi = {10.1145/882116.882121},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Masum03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigpro/DrioliR03,
author = {Carlo Drioli and
Davide Rocchesso},
title = {Orthogonal least squares algorithm for the approximation of a map
and its derivatives with a {RBF} network},
journal = {Signal Process.},
volume = {83},
number = {2},
pages = {283--296},
year = {2003},
url = {https://doi.org/10.1016/S0165-1684(02)00397-3},
doi = {10.1016/S0165-1684(02)00397-3},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigpro/DrioliR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LorysP03,
author = {Krzysztof Lorys and
Katarzyna E. Paluch},
title = {New approximation algorithm for {RTILE} problem},
journal = {Theor. Comput. Sci.},
volume = {303},
number = {2-3},
pages = {517--537},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00504-2},
doi = {10.1016/S0304-3975(02)00504-2},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LorysP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Hofmeister03,
author = {Thomas Hofmeister},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {An Approximation Algorithm for {MAX-2-SAT} with Cardinality Constraint},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {301--312},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_29},
doi = {10.1007/978-3-540-39658-1\_29},
timestamp = {Sun, 02 Jun 2019 21:14:37 +0200},
biburl = {https://dblp.org/rec/conf/esa/Hofmeister03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NagamochiO03,
author = {Hiroshi Nagamochi and
Kohei Okada},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Polynomial Time 2-Approximation Algorithms for the Minmax Subtree
Cover Problem},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {138--147},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_16},
doi = {10.1007/978-3-540-24587-2\_16},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/NagamochiO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/TaokaMW03,
author = {Satoshi Taoka and
Toshiya Mashima and
Toshimasa Watanabe},
title = {A 2-approximation algorithm {FSA+1} to (lambda+1)-edge-connect a specified
set of vertices in a lambda-edge-connected graph},
booktitle = {Proceedings of the 2003 International Symposium on Circuits and Systems,
{ISCAS} 2003, Bangkok, Thailand, May 25-28, 2003},
pages = {236--239},
publisher = {{IEEE}},
year = {2003},
url = {https://doi.org/10.1109/ISCAS.2003.1204999},
doi = {10.1109/ISCAS.2003.1204999},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/iscas/TaokaMW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/MahdianYZ03,
author = {Mohammad Mahdian and
Yingyu Ye and
Jiawei Zhang},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {A 2-Approximation Algorithm for the Soft-Capacitated Facility Location
Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {129--140},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_12},
doi = {10.1007/978-3-540-45198-3\_12},
timestamp = {Fri, 13 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/random/MahdianYZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JothiRV03,
author = {Raja Jothi and
Balaji Raghavachari and
Subramanian Varadarajan},
title = {A 5/4-approximation algorithm for minimum 2-edge-connectivity},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {725--734},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644227},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/JothiRV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AgarwalP02,
author = {Pankaj K. Agarwal and
Cecilia Magdalena Procopiuc},
title = {Exact and Approximation Algorithms for Clustering},
journal = {Algorithmica},
volume = {33},
number = {2},
pages = {201--226},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0110-y},
doi = {10.1007/S00453-001-0110-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgarwalP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndrewsZ02,
author = {Matthew Andrews and
Lisa Zhang},
title = {Approximation Algorithms for Access Network Design},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {197--215},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0968-3},
doi = {10.1007/S00453-002-0968-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BasovV02,
author = {Ivan Basov and
Alek Vainshtein},
title = {Approximation algorithms for multi-parameter graph optimization problems},
journal = {Discret. Appl. Math.},
volume = {119},
number = {1-2},
pages = {129--138},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00269-4},
doi = {10.1016/S0166-218X(01)00269-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BasovV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BlokhL02,
author = {David Blokh and
Eugene Levner},
title = {An approximation algorithm with performance guarantees for the maximum
traveling salesman problem on special matrices},
journal = {Discret. Appl. Math.},
volume = {119},
number = {1-2},
pages = {139--148},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00270-0},
doi = {10.1016/S0166-218X(01)00270-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BlokhL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FujitoN02,
author = {Toshihiro Fujito and
Hiroshi Nagamochi},
title = {A 2-approximation algorithm for the minimum weight edge dominating
set problem},
journal = {Discret. Appl. Math.},
volume = {118},
number = {3},
pages = {199--207},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(00)00383-8},
doi = {10.1016/S0166-218X(00)00383-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FujitoN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GutinY02a,
author = {Gregory Z. Gutin and
Anders Yeo},
title = {Polynomial approximation algorithms for the {TSP} and the {QAP} with
a factorial domination number},
journal = {Discret. Appl. Math.},
volume = {119},
number = {1-2},
pages = {107--116},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00267-0},
doi = {10.1016/S0166-218X(01)00267-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GutinY02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LepereMT02,
author = {Renaud Lep{\`{e}}re and
Gr{\'{e}}gory Mouni{\'{e}} and
Denis Trystram},
title = {An approximation algorithm for scheduling trees of malleable tasks},
journal = {Eur. J. Oper. Res.},
volume = {142},
number = {2},
pages = {242--249},
year = {2002},
url = {https://doi.org/10.1016/S0377-2217(02)00264-3},
doi = {10.1016/S0377-2217(02)00264-3},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LepereMT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/WolffTX02,
author = {Alexander Wolff and
Michael Thon and
Yin{-}Feng Xu},
title = {A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling},
journal = {Int. J. Comput. Geom. Appl.},
volume = {12},
number = {4},
pages = {269--282},
year = {2002},
url = {https://doi.org/10.1142/S0218195902000888},
doi = {10.1142/S0218195902000888},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/WolffTX02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/VredeveldH02,
author = {Tjark Vredeveld and
Cor A. J. Hurkens},
title = {Experimental Comparison of Approximation Algorithms for Scheduling
Unrelated Parallel Machines},
journal = {{INFORMS} J. Comput.},
volume = {14},
number = {2},
pages = {175--189},
year = {2002},
url = {https://doi.org/10.1287/ijoc.14.2.175.119},
doi = {10.1287/IJOC.14.2.175.119},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/VredeveldH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Eidenbenz02,
author = {Stephan J. Eidenbenz},
title = {Approximation algorithms for terrain guarding},
journal = {Inf. Process. Lett.},
volume = {82},
number = {2},
pages = {99--105},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00255-1},
doi = {10.1016/S0020-0190(01)00255-1},
timestamp = {Wed, 11 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Eidenbenz02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominL02,
author = {Fedor V. Fomin and
Andrzej Lingas},
title = {Approximation algorithms for time-dependent orienteering},
journal = {Inf. Process. Lett.},
volume = {83},
number = {2},
pages = {57--62},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00313-1},
doi = {10.1016/S0020-0190(01)00313-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FominL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isafm/DasS02,
author = {Sanjiv R. Das and
Rangarajan K. Sundaram},
title = {An approximation algorithm for optimal consumption/investment problems},
journal = {Intell. Syst. Account. Finance Manag.},
volume = {11},
number = {2},
pages = {55--69},
year = {2002},
url = {https://doi.org/10.1002/isaf.213},
doi = {10.1002/ISAF.213},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isafm/DasS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderF02,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
title = {Approximation of pathwidth of outerplanar graphs},
journal = {J. Algorithms},
volume = {43},
number = {2},
pages = {190--200},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00001-9},
doi = {10.1016/S0196-6774(02)00001-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Damian-IordacheP02,
author = {Mirela Damian{-}Iordache and
Sriram V. Pemmaraju},
title = {A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle
Graphs},
journal = {J. Algorithms},
volume = {42},
number = {2},
pages = {255--276},
year = {2002},
url = {https://doi.org/10.1006/jagm.2001.1206},
doi = {10.1006/JAGM.2001.1206},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Damian-IordacheP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FeigeKL02,
author = {Uriel Feige and
Marek Karpinski and
Michael Langberg},
title = {Improved approximation of Max-Cut on graphs of bounded degree},
journal = {J. Algorithms},
volume = {43},
number = {2},
pages = {201--219},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00005-6},
doi = {10.1016/S0196-6774(02)00005-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FeigeKL02.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/QueyranneS02,
author = {Maurice Queyranne and
Maxim Sviridenko},
title = {A (2+epsilon)-approximation algorithm for the generalized preemptive
open shop problem with minsum objective},
journal = {J. Algorithms},
volume = {45},
number = {2},
pages = {202--212},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00251-1},
doi = {10.1016/S0196-6774(02)00251-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/QueyranneS02.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/jcss/BazganST02,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
title = {Efficient Approximation Algorithms for the {SUBSET-SUMS} {EQUALITY}
Problem},
journal = {J. Comput. Syst. Sci.},
volume = {64},
number = {2},
pages = {160--170},
year = {2002},
url = {https://doi.org/10.1006/jcss.2001.1784},
doi = {10.1006/JCSS.2001.1784},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BazganST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Strauss02,
author = {Hans Strauss},
title = {Approximation with Constraints by Conditionally Positive Definite
Functions},
journal = {Numer. Algorithms},
volume = {30},
number = {2},
pages = {185--198},
year = {2002},
url = {https://doi.org/10.1023/A:1016023310994},
doi = {10.1023/A:1016023310994},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Strauss02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/ZhuL02,
author = {Hong{-}Tu Zhu and
Sik{-}Yum Lee},
title = {Analysis of generalized linear mixed models via a stochastic approximation
algorithm with Markov chain Monte-Carlo method},
journal = {Stat. Comput.},
volume = {12},
number = {2},
pages = {175--183},
year = {2002},
url = {https://doi.org/10.1023/A:1014890720461},
doi = {10.1023/A:1014890720461},
timestamp = {Wed, 25 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sac/ZhuL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BecchettiIM02,
author = {Luca Becchetti and
Miriam Di Ianni and
Alberto Marchetti{-}Spaccamela},
title = {Approximation algorithms for routing and call scheduling in all-optical
chains and rings},
journal = {Theor. Comput. Sci.},
volume = {287},
number = {2},
pages = {429--448},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00255-9},
doi = {10.1016/S0304-3975(01)00255-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BecchettiIM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GalluccioP02,
author = {Anna Galluccio and
Guido Proietti},
editor = {Prosenjit Bose and
Pat Morin},
title = {A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation},
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 = {150--162},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_14},
doi = {10.1007/3-540-36136-7\_14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GalluccioP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Jain01,
author = {Kamal Jain},
title = {A Factor 2 Approximation Algorithm for the Generalized Steiner Network
Problem},
journal = {Comb.},
volume = {21},
number = {1},
pages = {39--60},
year = {2001},
url = {https://doi.org/10.1007/s004930170004},
doi = {10.1007/S004930170004},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Jain01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KashyrskikhPS01,
author = {K. N. Kashyrskikh and
Chris N. Potts and
Sergey V. Sevastianov},
title = {A 3/2-approximation algorithm for two-machine flow-shop sequencing
subject to release dates},
journal = {Discret. Appl. Math.},
volume = {114},
number = {1-3},
pages = {255--271},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00374-7},
doi = {10.1016/S0166-218X(00)00374-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KashyrskikhPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainV01,
author = {Kamal Jain and
Vijay V. Vazirani},
title = {Approximation algorithms for metric facility location and \emph{k}-Median
problems using the primal-dual schema and Lagrangian relaxation},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {274--296},
year = {2001},
url = {https://doi.org/10.1145/375827.375845},
doi = {10.1145/375827.375845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanDMR01,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan and
Suneeta Ramaswami},
title = {Efficient Approximation Algorithms for Tiling and Packing Problems
with Rectangles},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {443--470},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1188},
doi = {10.1006/JAGM.2001.1188},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanDMR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChandraH01,
author = {Barun Chandra and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms for Dispersion Problems},
journal = {J. Algorithms},
volume = {38},
number = {2},
pages = {438--465},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1145},
doi = {10.1006/JAGM.2000.1145},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChandraH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChandraH01a,
author = {Barun Chandra and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Greedy Local Improvement and Weighted Set Packing Approximation},
journal = {J. Algorithms},
volume = {39},
number = {2},
pages = {223--240},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1155},
doi = {10.1006/JAGM.2000.1155},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChandraH01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChaudharyV01,
author = {Amitabh Chaudhary and
Sundar Vishwanathan},
title = {Approximation Algorithms for the Achromatic Number},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {404--416},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1192},
doi = {10.1006/JAGM.2001.1192},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChaudharyV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChekuriB01,
author = {Chandra Chekuri and
Michael A. Bender},
title = {An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly
Related Machines},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {212--224},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1184},
doi = {10.1006/JAGM.2001.1184},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ChekuriB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FeigeL01,
author = {Uriel Feige and
Michael Langberg},
title = {Approximation Algorithms for Maximization Problems Arising in Graph
Partitioning},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {174--211},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1183},
doi = {10.1006/JAGM.2001.1183},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FeigeL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalperinZ01a,
author = {Eran Halperin and
Uri Zwick},
title = {Approximation Algorithms for {MAX} 4-SAT and Rounding Procedures for
Semidefinite Programs},
journal = {J. Algorithms},
volume = {40},
number = {2},
pages = {184--211},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1162},
doi = {10.1006/JAGM.2001.1162},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HalperinZ01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HassinK01,
author = {Refael Hassin and
Samir Khuller},
title = {z-Approximations},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {429--442},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1187},
doi = {10.1006/JAGM.2001.1187},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HassinK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AsanoKK01,
author = {Tetsuo Asano and
Naoki Katoh and
Kazuhiro Kawashima},
title = {A New Approximation Algorithm for the Capacitated Vehicle Routing
Problem on a Tree},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {213--231},
year = {2001},
url = {https://doi.org/10.1023/A:1011461300596},
doi = {10.1023/A:1011461300596},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AsanoKK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CarrFKP01,
author = {Robert D. Carr and
Toshihiro Fujito and
Goran Konjevod and
Ojas Parekh},
title = {A 2{\textbackslash}frac\{1\}\{10\}-Approximation Algorithm for a Generalization
of the Weighted Edge-Dominating Set Problem},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {317--326},
year = {2001},
url = {https://doi.org/10.1023/A:1011445210568},
doi = {10.1023/A:1011445210568},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CarrFKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaurK01,
author = {Daya Ram Gaur and
Ramesh Krishnamurti},
title = {Simple Approximation Algorithms for {MAXNAESP} and Hypergraph 2-colorability},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {167--173},
year = {2001},
url = {https://doi.org/10.1023/A:1011453115618},
doi = {10.1023/A:1011453115618},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaurK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrystaS01,
author = {Piotr Krysta and
Roberto Solis{-}Oba},
title = {Approximation Algorithms for Bounded Facility Location Problems},
journal = {J. Comb. Optim.},
volume = {5},
number = {2},
pages = {233--247},
year = {2001},
url = {https://doi.org/10.1023/A:1011465419252},
doi = {10.1023/A:1011465419252},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KrystaS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/WangC01,
author = {Guoqing Wang and
T. C. Edwin Cheng},
title = {An approximation algorithm for parallel machine scheduling with a
common server},
journal = {J. Oper. Res. Soc.},
volume = {52},
number = {2},
pages = {234--237},
year = {2001},
url = {https://doi.org/10.1057/palgrave.jors.2601074},
doi = {10.1057/PALGRAVE.JORS.2601074},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/WangC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/CostabileN01,
author = {Francesco A. Costabile and
Anna Napoli},
title = {A Method for Global Approximation of the Initial Value Problem},
journal = {Numer. Algorithms},
volume = {27},
number = {2},
pages = {119--130},
year = {2001},
url = {https://doi.org/10.1023/A:1011866317159},
doi = {10.1023/A:1011866317159},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/CostabileN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Glader01,
author = {Christer Glader},
title = {A method for rational Chebyshev approximation of rational functions
on the unit disk and on the unit interval},
journal = {Numer. Algorithms},
volume = {26},
number = {2},
pages = {151--165},
year = {2001},
url = {https://doi.org/10.1023/A:1016636532753},
doi = {10.1023/A:1016636532753},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Glader01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Kvasov01,
author = {Boris I. Kvasov},
title = {Approximation by Discrete GB-Splines},
journal = {Numer. Algorithms},
volume = {27},
number = {2},
pages = {169--188},
year = {2001},
url = {https://doi.org/10.1023/A:1011818621589},
doi = {10.1023/A:1011818621589},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Kvasov01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhangTC01,
author = {Feng Zhang and
Guochun Tang and
Zhi{-}Long Chen},
title = {A 3/2-approximation algorithm for parallel machine scheduling with
controllable processing times},
journal = {Oper. Res. Lett.},
volume = {29},
number = {1},
pages = {41--47},
year = {2001},
url = {https://doi.org/10.1016/S0167-6377(01)00080-3},
doi = {10.1016/S0167-6377(01)00080-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ZhangTC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/Salotti01,
author = {Marc Salotti},
title = {An efficient algorithm for the optimal polygonal approximation of
digitized curves},
journal = {Pattern Recognit. Lett.},
volume = {22},
number = {2},
pages = {215--221},
year = {2001},
url = {https://doi.org/10.1016/S0167-8655(00)00088-X},
doi = {10.1016/S0167-8655(00)00088-X},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/Salotti01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/NaorZ01,
author = {Joseph Naor and
Leonid Zosin},
title = {A 2-Approximation Algorithm for the Directed Multiway Cut Problem},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {2},
pages = {477--482},
year = {2001},
url = {https://doi.org/10.1137/S009753979732147X},
doi = {10.1137/S009753979732147X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/NaorZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AgeevHS01,
author = {Alexander A. Ageev and
Refael Hassin and
Maxim Sviridenko},
title = {A 0.5-Approximation Algorithm for {MAX} {DICUT} with Given Sizes of
Parts},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {2},
pages = {246--255},
year = {2001},
url = {https://doi.org/10.1137/S089548010036813X},
doi = {10.1137/S089548010036813X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AgeevHS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArikatiDLM01,
author = {Srinivasa Rao Arikati and
Anders Dessmark and
Andrzej Lingas and
Madhav V. Marathe},
title = {Approximation algorithms for maximum two-dimensional pattern matching},
journal = {Theor. Comput. Sci.},
volume = {255},
number = {1-2},
pages = {51--62},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00153-X},
doi = {10.1016/S0304-3975(99)00153-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArikatiDLM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KarunoN01,
author = {Yoshiyuki Karuno and
Hiroshi Nagamochi},
editor = {Friedhelm Meyer auf der Heide},
title = {A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem
on a Path with Release and Handling Times},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {218--229},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_18},
doi = {10.1007/3-540-44676-1\_18},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KarunoN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FleischerJW01,
author = {Lisa Fleischer and
Kamal Jain and
David P. Williamson},
title = {An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity
Problem},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {339--347},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959908},
doi = {10.1109/SFCS.2001.959908},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FleischerJW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/QueyranneS01,
author = {Maurice Queyranne and
Maxim Sviridenko},
editor = {Karen I. Aardal and
Bert Gerards},
title = {A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open
Shop Problem with Minsum Objective},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {361--369},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_28},
doi = {10.1007/3-540-45535-3\_28},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/QueyranneS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/EvenFKN01,
author = {Guy Even and
Jon Feldman and
Guy Kortsarz and
Zeev Nutov},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity
of a Graph from 1 to 2 Using a Subset of a Given Edge Set},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {90--101},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_13},
doi = {10.1007/3-540-44666-4\_13},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/EvenFKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KrystaK01,
author = {Piotr Krysta and
V. S. Anil Kumar},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Approximation Algorithms for Minimum Size 2-Connectivity Problems},
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 = {431--442},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_38},
doi = {10.1007/3-540-44693-1\_38},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KrystaK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Guttmann-BeckH00,
author = {Nili Guttmann{-}Beck and
Refael Hassin},
title = {Approximation Algorithms for Minimum \emph{K}-Cut},
journal = {Algorithmica},
volume = {27},
number = {2},
pages = {198--207},
year = {2000},
url = {https://doi.org/10.1007/s004530010013},
doi = {10.1007/S004530010013},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Guttmann-BeckH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Trevisan00,
author = {Luca Trevisan},
title = {Erratum: {A} Correction to "Parallel Approximation Algorithms by Positive
Linear Programming"},
journal = {Algorithmica},
volume = {27},
number = {2},
pages = {115--119},
year = {2000},
url = {https://doi.org/10.1007/s004530010007},
doi = {10.1007/S004530010007},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Trevisan00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ArkinFM00,
author = {Esther M. Arkin and
S{\'{a}}ndor P. Fekete and
Joseph S. B. Mitchell},
title = {Approximation algorithms for lawn mowing and milling},
journal = {Comput. Geom.},
volume = {17},
number = {1-2},
pages = {25--50},
year = {2000},
url = {https://doi.org/10.1016/S0925-7721(00)00015-8},
doi = {10.1016/S0925-7721(00)00015-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ArkinFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CapraraKPP00,
author = {Alberto Caprara and
Hans Kellerer and
Ulrich Pferschy and
David Pisinger},
title = {Approximation algorithms for knapsack problems with cardinality constraints},
journal = {Eur. J. Oper. Res.},
volume = {123},
number = {2},
pages = {333--345},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00261-1},
doi = {10.1016/S0377-2217(99)00261-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CapraraKPP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KellererMS00,
author = {Hans Kellerer and
Renata Mansini and
Maria Grazia Speranza},
title = {Two linear approximation algorithms for the subset-sum problem},
journal = {Eur. J. Oper. Res.},
volume = {120},
number = {2},
pages = {289--296},
year = {2000},
url = {https://doi.org/10.1016/S0377-2217(99)00157-5},
doi = {10.1016/S0377-2217(99)00157-5},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KellererMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/UeharaC00,
author = {Ryuhei Uehara and
Zhi{-}Zhong Chen},
title = {Parallel approximation algorithms for maximum weighted matching in
general graphs},
journal = {Inf. Process. Lett.},
volume = {76},
number = {1-2},
pages = {13--17},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00128-9},
doi = {10.1016/S0020-0190(00)00128-9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/UeharaC00.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/DawandeKKSR00,
author = {Milind Dawande and
Jayant Kalagnanam and
Pinar Keskinocak and
F. Sibel Salman and
R. Ravi},
title = {Approximation Algorithms for the Multiple Knapsack Problem with Assignment
Restrictions},
journal = {J. Comb. Optim.},
volume = {4},
number = {2},
pages = {171--186},
year = {2000},
url = {https://doi.org/10.1023/A:1009894503716},
doi = {10.1023/A:1009894503716},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DawandeKKSR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HeLZ00,
author = {George He and
Jiping Liu and
Cheng Zhao},
title = {Approximation Algorithms for Some Graph Partitioning Problems},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {2},
pages = {1--11},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00021},
doi = {10.7155/JGAA.00021},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HeLZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/RethmannW00,
author = {Jochen Rethmann and
Egon Wanke},
title = {An approximation algorithm for the stack-up problem},
journal = {Math. Methods Oper. Res.},
volume = {51},
number = {2},
pages = {203--233},
year = {2000},
url = {https://doi.org/10.1007/s001860050085},
doi = {10.1007/S001860050085},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/RethmannW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BavejaS00,
author = {Alok Baveja and
Aravind Srinivasan},
title = {Approximation Algorithms for Disjoint Paths and Related Routing and
Packing Problems},
journal = {Math. Oper. Res.},
volume = {25},
number = {2},
pages = {255--280},
year = {2000},
url = {https://doi.org/10.1287/moor.25.2.255.12228},
doi = {10.1287/MOOR.25.2.255.12228},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BavejaS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/AppratoG00,
author = {Dominique Apprato and
Christian Gout},
title = {A result about scale transformation families in approximation: application
to surface fitting from rapidly varying data},
journal = {Numer. Algorithms},
volume = {23},
number = {2-3},
pages = {263--279},
year = {2000},
url = {https://doi.org/10.1023/A:1019108318920},
doi = {10.1023/A:1019108318920},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/AppratoG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Cuyt00,
author = {Annie A. M. Cuyt},
title = {Computational methods from rational approximation theory},
journal = {Numer. Algorithms},
volume = {24},
number = {1-2},
pages = {i},
year = {2000},
url = {https://doi.org/10.1023/A:1019176706625},
doi = {10.1023/A:1019176706625},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Cuyt00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Kalantari00,
author = {Bahman Kalantari},
title = {New formulas for approximation of {\(\pi\)} and other transcendental
numbers},
journal = {Numer. Algorithms},
volume = {24},
number = {1-2},
pages = {59--81},
year = {2000},
url = {https://doi.org/10.1023/A:1019184908442},
doi = {10.1023/A:1019184908442},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Kalantari00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnn/MeirM00,
author = {Ron Meir and
V. E. Maiorov},
title = {On the optimality of neural-network approximation using incremental
algorithms},
journal = {{IEEE} Trans. Neural Networks Learn. Syst.},
volume = {11},
number = {2},
pages = {323--337},
year = {2000},
url = {https://doi.org/10.1109/72.839004},
doi = {10.1109/72.839004},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tnn/MeirM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CarrFKP00,
author = {Robert D. Carr and
Toshihiro Fujito and
Goran Konjevod and
Ojas Parekh},
editor = {Mike Paterson},
title = {A 2 1/10-Approximation Algorithm for a Generalization of the Weighted
Edge-Dominating Set Problem},
booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {132--142},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_13},
doi = {10.1007/3-540-45253-2\_13},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CarrFKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DengZLZ00,
author = {Xiaotie Deng and
Yi Zhou and
Guojun Li and
Wenan Zang},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {A 2-Approximation Algorithm for Path Coloring on Trees of Rings},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {144--155},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_13},
doi = {10.1007/3-540-40996-3\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DengZLZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AroraK00,
author = {Sanjeev Arora and
George Karakostas},
editor = {David B. Shmoys},
title = {A 2+epsilon approximation algorithm for the \emph{k}-MST problem},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {754--759},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338636},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AroraK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CryanGP99,
author = {Mary Cryan and
Leslie Ann Goldberg and
Cynthia A. Phillips},
title = {Approximation Algorithms for the Fixed-Topology Phylogenetic Number
Problem},
journal = {Algorithmica},
volume = {25},
number = {2-3},
pages = {311--329},
year = {1999},
url = {https://doi.org/10.1007/PL00008280},
doi = {10.1007/PL00008280},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CryanGP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AgeevS99,
author = {Alexander A. Ageev and
Maxim Sviridenko},
title = {An 0.828-approximation Algorithm for the Uncapacitated Facility Location
Problem},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {149--156},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00103-1},
doi = {10.1016/S0166-218X(99)00103-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AgeevS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AulettaDNP99,
author = {Vincenzo Auletta and
Yefim Dinitz and
Zeev Nutov and
Domenico Parente},
title = {A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected
Spanning Subgraph},
journal = {J. Algorithms},
volume = {32},
number = {1},
pages = {21--30},
year = {1999},
url = {https://doi.org/10.1006/jagm.1999.1006},
doi = {10.1006/JAGM.1999.1006},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AulettaDNP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChudakS99,
author = {Fabi{\'{a}}n A. Chudak and
David B. Shmoys},
title = {Approximation Algorithms for Precedence-Constrained Scheduling Problems
on Parallel Machines that Run at Different Speeds},
journal = {J. Algorithms},
volume = {30},
number = {2},
pages = {323--343},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0987},
doi = {10.1006/JAGM.1998.0987},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChudakS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Akutsu99,
author = {Tatsuya Akutsu},
title = {Approximation and Exact Algorithms for {RNA} Secondary Structure Prediction
and Recognition of Stochastic Context-free Languages},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {321--336},
year = {1999},
url = {https://doi.org/10.1023/A:1009898029639},
doi = {10.1023/A:1009898029639},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Akutsu99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ParidaFR99,
author = {Laxmi Parida and
Aris Floratos and
Isidore Rigoutsos},
title = {An Approximation Algorithm for Alignment of Multiple Sequences using
Motif Discovery},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {247--275},
year = {1999},
url = {https://doi.org/10.1023/A:1009841927822},
doi = {10.1023/A:1009841927822},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ParidaFR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Approximation and Exact Algorithms for Constructing Minimum Ultrametric
Trees from Distance Matrices},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {199--211},
year = {1999},
url = {https://doi.org/10.1023/A:1009885610075},
doi = {10.1023/A:1009885610075},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nm/Stewart99,
author = {G. W. Stewart},
title = {Four algorithms for the the efficient computation of truncated pivoted
{QR} approximations to a sparse matrix},
journal = {Numerische Mathematik},
volume = {83},
number = {2},
pages = {313--323},
year = {1999},
url = {https://doi.org/10.1007/s002110050451},
doi = {10.1007/S002110050451},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nm/Stewart99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AnilyBH99,
author = {Shoshana Anily and
Julien Bramel and
Alain Hertz},
title = {A 5/3-approximation algorithm for the clustered traveling salesman
tour and path problems},
journal = {Oper. Res. Lett.},
volume = {24},
number = {1-2},
pages = {29--35},
year = {1999},
url = {https://doi.org/10.1016/S0167-6377(98)00046-7},
doi = {10.1016/S0167-6377(98)00046-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AnilyBH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sweedyk99,
author = {Z. Sweedyk},
title = {A 2{\textonehalf}-Approximation Algorithm for Shortest Superstring},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {954--986},
year = {1999},
url = {https://doi.org/10.1137/S0097539796324661},
doi = {10.1137/S0097539796324661},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sweedyk99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BafnaBF99,
author = {Vineet Bafna and
Piotr Berman and
Toshihiro Fujito},
title = {A 2-Approximation Algorithm for the Undirected Feedback Vertex Set
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {3},
pages = {289--297},
year = {1999},
url = {https://doi.org/10.1137/S0895480196305124},
doi = {10.1137/S0895480196305124},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BafnaBF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RaghavachariV99,
author = {Balaji Raghavachari and
Jeyakesavan Veerasamy},
title = {A 3/2-Approximation Algorithm for the Mixed Postman Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {4},
pages = {425--433},
year = {1999},
url = {https://doi.org/10.1137/S0895480197331454},
doi = {10.1137/S0895480197331454},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RaghavachariV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GuPS99,
author = {Qian{-}Ping Gu and
Shietung Peng and
Ivan Hal Sudborough},
title = {A 2-Approximation Algorithm for Genome Rearrangements by Reversals
and Transpositions},
journal = {Theor. Comput. Sci.},
volume = {210},
number = {2},
pages = {327--339},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(98)00092-9},
doi = {10.1016/S0304-3975(98)00092-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GuPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChongWK99,
author = {Edwin K. P. Chong and
I{-}Jeng Wang and
Sanjeev R. Kulkarni},
title = {Noise Conditions for Prespecified Convergence Rates of Stochastic
Approximation Algorithms},
journal = {{IEEE} Trans. Inf. Theory},
volume = {45},
number = {2},
pages = {810--814},
year = {1999},
url = {https://doi.org/10.1109/18.749035},
doi = {10.1109/18.749035},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChongWK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainV99,
author = {Kamal Jain and
Vijay V. Vazirani},
title = {Primal-Dual Approximation Algorithms for Metric Facility Location
and k-Median Problems},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {2--13},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814571},
doi = {10.1109/SFFCS.1999.814571},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JainV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GaurK99,
author = {Daya Ram Gaur and
Ramesh Krishnamurti},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {Simple Approximation Algorithms for {MAXNAESP} and Hypergraph 2-colorability},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {49--55},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_6},
doi = {10.1007/3-540-46632-0\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GaurK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Preis99,
author = {Robert Preis},
editor = {Christoph Meinel and
Sophie Tison},
title = {Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching
in General Graphs},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {259--269},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_24},
doi = {10.1007/3-540-49116-3\_24},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Preis99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SmolaS98,
author = {Alexander J. Smola and
Bernhard Sch{\"{o}}lkopf},
title = {On a Kernel-Based Method for Pattern Recognition, Regression, Approximation,
and Operator Inversion},
journal = {Algorithmica},
volume = {22},
number = {1/2},
pages = {211--231},
year = {1998},
url = {https://doi.org/10.1007/PL00013831},
doi = {10.1007/PL00013831},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SmolaS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArmenS98,
author = {Chris Armen and
Clifford Stein},
title = {A 2 2/3 Superstring Approximation Algorithm},
journal = {Discret. Appl. Math.},
volume = {88},
number = {1-3},
pages = {29--57},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00065-1},
doi = {10.1016/S0166-218X(98)00065-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArmenS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Fujito98,
author = {Toshihiro Fujito},
title = {A Unified Approximation Algorithm for Node-deletion Problems},
journal = {Discret. Appl. Math.},
volume = {86},
number = {2-3},
pages = {213--231},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00035-3},
doi = {10.1016/S0166-218X(98)00035-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Fujito98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Terlaky98,
author = {Tam{\'{a}}s Terlaky},
title = {Optimization. Algorithms and consistent approximations : Elijah Polak
Springer, New York, NY, 1997, {ISBN} 0-38794971-2, hb., 118 DM, 779
pages},
journal = {Eur. J. Oper. Res.},
volume = {107},
number = {3},
pages = {755--756},
year = {1998},
url = {https://doi.org/10.1016/S0377-2217(98)80004-0},
doi = {10.1016/S0377-2217(98)80004-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Terlaky98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijait/DraelosH98,
author = {Tim Draelos and
Don R. Hush},
title = {A Constructive Neural Network Algorithm for Function Approximation
Using Locally Fit Sigmoids},
journal = {Int. J. Artif. Intell. Tools},
volume = {7},
number = {2},
pages = {373--398},
year = {1998},
url = {https://doi.org/10.1142/S0218213098000172},
doi = {10.1142/S0218213098000172},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijait/DraelosH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/JansenR98,
author = {Klaus Jansen and
Joachim Reiter},
title = {An approximation algorithm for the register allocation problem},
journal = {Integr.},
volume = {25},
number = {2},
pages = {89--102},
year = {1998},
url = {https://doi.org/10.1016/S0167-9260(98)00008-X},
doi = {10.1016/S0167-9260(98)00008-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/integration/JansenR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AryaR98,
author = {Sunil Arya and
H. Ramesh},
title = {A 2.5-Factor Approximation Algorithm for the \emph{k}-MST Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {117--118},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00010-6},
doi = {10.1016/S0020-0190(98)00010-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AryaR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CalinescuFFK98,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ulrich Finkler and
Howard J. Karloff},
title = {A Better Approximation Algorithm for Finding Planar Subgraphs},
journal = {J. Algorithms},
volume = {27},
number = {2},
pages = {269--302},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0920},
doi = {10.1006/JAGM.1997.0920},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CalinescuFFK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HuntMRRRS98,
author = {Harry B. Hunt III and
Madhav V. Marathe and
Venkatesh Radhakrishnan and
S. S. Ravi and
Daniel J. Rosenkrantz and
Richard Edwin Stearns},
title = {NC-Approximation Schemes for {NP-} and PSPACE-Hard Problems for Geometric
Graphs},
journal = {J. Algorithms},
volume = {26},
number = {2},
pages = {238--274},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0903},
doi = {10.1006/JAGM.1997.0903},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HuntMRRRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PanigrahyV98,
author = {Rina Panigrahy and
Sundar Vishwanathan},
title = {An O(log* n) Approximation Algorithm for the Asymmetric \emph{p}-Center
Problem},
journal = {J. Algorithms},
volume = {27},
number = {2},
pages = {259--268},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0921},
doi = {10.1006/JAGM.1997.0921},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/PanigrahyV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FuLY98,
author = {Minyue Fu and
Zhi{-}Quan Luo and
Yinyu Ye},
title = {Approximation Algorithms for Quadratic Programming},
journal = {J. Comb. Optim.},
volume = {2},
number = {1},
pages = {29--50},
year = {1998},
url = {https://doi.org/10.1023/A:1009739827008},
doi = {10.1023/A:1009739827008},
timestamp = {Tue, 20 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FuLY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrumkeMNRR98,
author = {Sven Oliver Krumke and
Madhav V. Marathe and
Hartmut Noltemeier and
R. Ravi and
S. S. Ravi},
title = {Approximation Algorithms for Certain Network Improvement Problems},
journal = {J. Comb. Optim.},
volume = {2},
number = {3},
pages = {257--288},
year = {1998},
url = {https://doi.org/10.1023/A:1009798010579},
doi = {10.1023/A:1009798010579},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KrumkeMNRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RolimT98,
author = {Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {A Case Study of De-randomization Methods for Combinatorial Approximation
Algorithms},
journal = {J. Comb. Optim.},
volume = {2},
number = {3},
pages = {219--236},
year = {1998},
url = {https://doi.org/10.1023/A:1009793909670},
doi = {10.1023/A:1009793909670},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/RolimT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/HorstR98,
author = {Reiner Horst and
Ulrich Raber},
title = {Convergent Outer Approximation Algorithms for Solving Unary Programs},
journal = {J. Glob. Optim.},
volume = {13},
number = {2},
pages = {123--149},
year = {1998},
url = {https://doi.org/10.1023/A:1008284026289},
doi = {10.1023/A:1008284026289},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/HorstR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ChudakGHW98,
author = {Fabi{\'{a}}n A. Chudak and
Michel X. Goemans and
Dorit S. Hochbaum and
David P. Williamson},
title = {A primal-dual interpretation of two 2-approximation algorithms for
the feedback vertex set problem in undirected graphs},
journal = {Oper. Res. Lett.},
volume = {22},
number = {4-5},
pages = {111--118},
year = {1998},
url = {https://doi.org/10.1016/S0167-6377(98)00021-2},
doi = {10.1016/S0167-6377(98)00021-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ChudakGHW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RajagopalanV98,
author = {Sridhar Rajagopalan and
Vijay V. Vazirani},
title = {Primal-Dual {RNC} Approximation Algorithms for Set Cover and Covering
Integer Programs},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {525--540},
year = {1998},
url = {https://doi.org/10.1137/S0097539793260763},
doi = {10.1137/S0097539793260763},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/RajagopalanV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/Patriksson98,
author = {Michael Patriksson},
title = {Cost Approximation: {A} Unified Framework of Descent Algorithms for
Nonlinear Programs},
journal = {{SIAM} J. Optim.},
volume = {8},
number = {2},
pages = {561--582},
year = {1998},
url = {https://doi.org/10.1137/S105262349427577X},
doi = {10.1137/S105262349427577X},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/Patriksson98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BhatiaS98,
author = {Randeep Bhatia and
Yoram J. Sussmann},
title = {Book review: Approximation Algorithms for NP-hard Problems. Edited
by Dorit S. Hochbaum (PWS, 1997)},
journal = {{SIGACT} News},
volume = {29},
number = {2},
pages = {17--20},
year = {1998},
url = {http://doi.acm.org/10.1145/288079.1041951},
doi = {10.1145/288079.1041951},
timestamp = {Mon, 25 Jan 2010 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/BhatiaS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeGP98,
author = {Marc Demange and
Pascal Grisoni and
Vangelis Th. Paschos},
title = {Differential Approximation Algorithms for Some Combinatorial Optimization
Problems},
journal = {Theor. Comput. Sci.},
volume = {209},
number = {1-2},
pages = {107--122},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00099-6},
doi = {10.1016/S0304-3975(97)00099-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeGP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Solis-Oba98,
author = {Roberto Solis{-}Oba},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {2-Approximation Algorithm for Finding a Spanning Tree with Maximum
Number of Leaves},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {441--452},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_37},
doi = {10.1007/3-540-68530-8\_37},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Solis-Oba98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Jain98,
author = {Kamal Jain},
title = {Factor 2 Approximation Algorithm for the Generalized Steiner Network
Problem},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {448--457},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743495},
doi = {10.1109/SFCS.1998.743495},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Jain98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CheriyanSS98,
author = {Joseph Cheriyan and
Andr{\'{a}}s Seb{\"{o}} and
Zolt{\'{a}}n Szigeti},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {An Improved Approximation Algorithm for Minimum Size 2-Edge Connected
Spanning Subgraphs},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {126--136},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_10},
doi = {10.1007/3-540-69346-7\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CheriyanSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Christie98,
author = {David A. Christie},
editor = {Howard J. Karloff},
title = {A 3/2-Approximation Algorithm for Sorting by Reversals},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {244--252},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314711},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/Christie98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MartelloST97,
author = {Silvano Martello and
Fran{\c{c}}ois Soumis and
Paolo Toth},
title = {Exact and Approximation Algorithms for Makespan Minimization on Unrelated
Parallel Machines},
journal = {Discret. Appl. Math.},
volume = {75},
number = {2},
pages = {169--188},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00087-X},
doi = {10.1016/S0166-218X(96)00087-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MartelloST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/JansenO97,
author = {Klaus Jansen and
Sabine R. {\"{O}}hring},
title = {Approximation Algorithms for Time Constrained Scheduling},
journal = {Inf. Comput.},
volume = {132},
number = {2},
pages = {85--108},
year = {1997},
url = {https://doi.org/10.1006/inco.1996.2616},
doi = {10.1006/INCO.1996.2616},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/JansenO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijar/Bauer97,
author = {Mathias Bauer},
title = {Approximation algorithms and decision making in the Dempster-Shafer
theory of evidence - An empirical study},
journal = {Int. J. Approx. Reason.},
volume = {17},
number = {2-3},
pages = {217--237},
year = {1997},
url = {https://doi.org/10.1016/S0888-613X(97)00013-3},
doi = {10.1016/S0888-613X(97)00013-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijar/Bauer97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HassinR97,
author = {Refael Hassin and
Shlomi Rubinstein},
title = {An Approximation Algorithm for Maximum Packing of 3-Edge Paths},
journal = {Inf. Process. Lett.},
volume = {63},
number = {2},
pages = {63--67},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00097-5},
doi = {10.1016/S0020-0190(97)00097-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HassinR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guttmann-BeckH97,
author = {Nili Guttmann{-}Beck and
Refael Hassin},
title = {Approximation Algorithms for Min-Max Tree Partition},
journal = {J. Algorithms},
volume = {24},
number = {2},
pages = {266--286},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0848},
doi = {10.1006/JAGM.1996.0848},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guttmann-BeckH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Henzinger97,
author = {Monika Rauch Henzinger},
title = {A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental
Approximation Algorithms for Edge and Vertex Connectivity},
journal = {J. Algorithms},
volume = {24},
number = {1},
pages = {194--220},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0855},
doi = {10.1006/JAGM.1997.0855},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Henzinger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinPRT97,
author = {Philip N. Klein and
Serge A. Plotkin and
Satish Rao and
{\'{E}}va Tardos},
title = {Approximation Algorithms for Steiner and Directed Multicuts},
journal = {J. Algorithms},
volume = {22},
number = {2},
pages = {241--269},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0833},
doi = {10.1006/JAGM.1996.0833},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinPRT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PennS97,
author = {Michal Penn and
Haya Shasha{-}Krupnik},
title = {Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity
Augmentation Problems},
journal = {J. Algorithms},
volume = {22},
number = {1},
pages = {187--196},
year = {1997},
url = {https://doi.org/10.1006/jagm.1995.0800},
doi = {10.1006/JAGM.1995.0800},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/PennS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WangG97,
author = {Lusheng Wang and
Dan Gusfield},
title = {Improved Approximation Algorithms for Tree Alignment},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {255--273},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0882},
doi = {10.1006/JAGM.1997.0882},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WangG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AmanoM97,
author = {Kazuyuki Amano and
Akira Maruoka},
title = {Approximation Algorithms for {DNF} Under Distributions with Limited
Independence},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {181--196},
year = {1997},
url = {https://doi.org/10.1007/s002240000049},
doi = {10.1007/S002240000049},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AmanoM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Anderson97,
author = {I. J. Anderson},
title = {A piecewise approach to piecewise approximation},
journal = {Numer. Algorithms},
volume = {15},
number = {2},
pages = {139--152},
year = {1997},
url = {https://doi.org/10.1023/A:1019189719519},
doi = {10.1023/A:1019189719519},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Anderson97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/GutzmerI97,
author = {Tim Gutzmer and
Armin Iske},
title = {Detection of discontinuities in scattered data approximation},
journal = {Numer. Algorithms},
volume = {16},
number = {2},
pages = {155--170},
year = {1997},
url = {https://doi.org/10.1023/A:1019139130423},
doi = {10.1023/A:1019139130423},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/GutzmerI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Pestano-GabinoG97,
author = {Celina Pestano{-}Gabino and
Concepci{\'{o}}n Gonz{\'{a}}lez{-}Concepci{\'{o}}n},
title = {Matrix Pad{\'{e}} Approximation of rational functions},
journal = {Numer. Algorithms},
volume = {15},
number = {2},
pages = {167--192},
year = {1997},
url = {https://doi.org/10.1023/A:1019193820428},
doi = {10.1023/A:1019193820428},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Pestano-GabinoG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Rebillard97,
author = {Luc Rebillard},
title = {Rational approximation in the complex plane using a {\(\tau\)}-method
and computer algebra},
journal = {Numer. Algorithms},
volume = {16},
number = {2},
pages = {187--208},
year = {1997},
url = {https://doi.org/10.1023/A:1019143231331},
doi = {10.1023/A:1019143231331},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Rebillard97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/YamaguchiNM97,
author = {Atsuko Yamaguchi and
Koji Nakano and
Satoru Miyano},
title = {An Approximation Algorithm for the Minimum Common Supertree Problem},
journal = {Nord. J. Comput.},
volume = {4},
number = {2},
pages = {303--316},
year = {1997},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/YamaguchiNM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Boyd97,
author = {E. Andrew Boyd},
title = {A fully polynomial epsilon approximation cutting plane algorithm for
solving combinatorial linear programs containing a sufficiently large
ball},
journal = {Oper. Res. Lett.},
volume = {20},
number = {2},
pages = {59--63},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(96)00048-X},
doi = {10.1016/S0167-6377(96)00048-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Boyd97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Hochba97,
author = {Dorit S. Hochbaum},
title = {Approximation Algorithms for NP-Hard Problems},
journal = {{SIGACT} News},
volume = {28},
number = {2},
pages = {40--52},
year = {1997},
url = {https://doi.org/10.1145/261342.571216},
doi = {10.1145/261342.571216},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Hochba97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BafnaLP97,
author = {Vineet Bafna and
Eugene L. Lawler and
Pavel A. Pevzner},
title = {Approximation Algorithms for Multiple Sequence Alignment},
journal = {Theor. Comput. Sci.},
volume = {182},
number = {1-2},
pages = {233--244},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(97)00023-6},
doi = {10.1016/S0304-3975(97)00023-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BafnaLP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Pezeshki-EsfahaniH97,
author = {H. Pezeshki{-}Esfahani and
Andrew J. Heunis},
title = {Strong diffusion approximations for recursive stochastic algorithms},
journal = {{IEEE} Trans. Inf. Theory},
volume = {43},
number = {2},
pages = {512--523},
year = {1997},
url = {https://doi.org/10.1109/18.556109},
doi = {10.1109/18.556109},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Pezeshki-EsfahaniH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ZeraiB97,
author = {Adel A. Zerai and
James A. Bucklew},
title = {Poisson approximation for excursions of adaptive algorithms with a
lattice state space},
journal = {{IEEE} Trans. Inf. Theory},
volume = {43},
number = {2},
pages = {524--536},
year = {1997},
url = {https://doi.org/10.1109/18.556110},
doi = {10.1109/18.556110},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ZeraiB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsmc/Chin97,
author = {Daniel C. Chin},
title = {Comparative study of stochastic algorithms for system optimization
based on gradient approximations},
journal = {{IEEE} Trans. Syst. Man Cybern. Part {B}},
volume = {27},
number = {2},
pages = {244--249},
year = {1997},
url = {https://doi.org/10.1109/3477.558808},
doi = {10.1109/3477.558808},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsmc/Chin97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/GroplS97,
author = {Clemens Gr{\"{o}}pl and
Martin Skutella},
editor = {Ernst W. Mayr and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger},
title = {Parallel Repetition of MIP(2, 1) Systems},
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 = {161--178},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0053016},
doi = {10.1007/BFB0053016},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/GroplS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/SeibertW97,
author = {Sebastian Seibert and
Thomas Wilke},
editor = {Ernst W. Mayr and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger},
title = {Bounds for Approximating {MAXLINEQ3-2} and {MAXEKSAT}},
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 = {179--212},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0053017},
doi = {10.1007/BFB0053017},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/SeibertW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/LiangH97,
author = {Weifa Liang and
George Havas},
editor = {Christian Lengauer and
Martin Griebl and
Sergei Gorlatch},
title = {{NC} Approximation Algorithms for 2-Connectivity Augmentation in a
Graph},
booktitle = {Euro-Par '97 Parallel Processing, Third International Euro-Par Conference,
Passau, Germany, August 26-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1300},
pages = {430--439},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0002767},
doi = {10.1007/BFB0002767},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/LiangH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NaorZ97,
author = {Joseph Naor and
Leonid Zosin},
title = {A 2-Approximation Algorithm for the Directed Multiway Cut Problem},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {548--553},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646144},
doi = {10.1109/SFCS.1997.646144},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NaorZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaratheHR96,
author = {Madhav V. Marathe and
Harry B. Hunt III and
S. S. Ravi},
title = {Efficient Approximation Algorithms for Domatic Partition and on-line
Coloring of Circular Arc Graphs},
journal = {Discret. Appl. Math.},
volume = {64},
number = {2},
pages = {135--149},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(94)00118-W},
doi = {10.1016/0166-218X(94)00118-W},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MaratheHR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HochbaumN96,
author = {Dorit S. Hochbaum and
Joseph Naor},
title = {Approximation Algorithms for Network Design Problems on Bounded Subsets},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {403--414},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0050},
doi = {10.1006/JAGM.1996.0050},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HochbaumN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KhullerR96,
author = {Samir Khuller and
Balaji Raghavachari},
title = {Improved Approximation Algorithms for Uniform Connectivity Problems},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {434--450},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0052},
doi = {10.1006/JAGM.1996.0052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KhullerR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NarayananRP96,
author = {H. Narayanan and
Subir K. Roy and
Sachin B. Patkar},
title = {Approximation Algorithms for Min-k-Overlap Problems Using the Principal
Lattice of Partitions Approach},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {306--330},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0047},
doi = {10.1006/JAGM.1996.0047},
timestamp = {Tue, 04 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/NarayananRP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/MacLeod96,
author = {Allan J. MacLeod},
title = {Rational approximations, software and test methods for sine and cosine
integrals},
journal = {Numer. Algorithms},
volume = {12},
number = {2},
pages = {259--272},
year = {1996},
url = {https://doi.org/10.1007/BF02142806},
doi = {10.1007/BF02142806},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/MacLeod96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Witomski96,
author = {Patrick Witomski},
title = {Approximation of the capillarity problem by an augmented Lagrangian
method},
journal = {Numer. Algorithms},
volume = {12},
number = {2},
pages = {321--346},
year = {1996},
url = {https://doi.org/10.1007/BF02142811},
doi = {10.1007/BF02142811},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Witomski96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DobrowS96,
author = {Robert P. Dobrow and
Robert T. Smythe},
title = {Poisson approximations for functionals of random trees},
journal = {Random Struct. Algorithms},
volume = {9},
number = {1-2},
pages = {79--92},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2\<79::AID-RSA5\>3.0.CO;2-8},
doi = {10.1002/(SICI)1098-2418(199608/09)9:1/2\<79::AID-RSA5\>3.0.CO;2-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DobrowS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigpro/Yang96,
author = {Bin Yang},
title = {Asymptotic convergence analysis of the projection approximation subspace
tracking algorithms},
journal = {Signal Process.},
volume = {50},
number = {1-2},
pages = {123--136},
year = {1996},
url = {https://doi.org/10.1016/0165-1684(96)00008-4},
doi = {10.1016/0165-1684(96)00008-4},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigpro/Yang96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ArmenS96,
author = {Chris Armen and
Clifford Stein},
editor = {Daniel S. Hirschberg and
Eugene W. Myers},
title = {A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem},
booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
Beach, California, USA, June 10-12, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1075},
pages = {87--101},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61258-0\_8},
doi = {10.1007/3-540-61258-0\_8},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ArmenS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KececiogluS95,
author = {John D. Kececioglu and
David Sankoff},
title = {Exact and Approximation Algorithms for Sorting by Reversals, with
Application to Genome Rearrangement},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {180--210},
year = {1995},
url = {https://doi.org/10.1007/BF01188586},
doi = {10.1007/BF01188586},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KececiogluS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Syslo95,
author = {Maciej M. Syslo},
title = {The jump number problem on interval orders: {A} 3/2 approximation
algorithm},
journal = {Discret. Math.},
volume = {144},
number = {1-3},
pages = {119--130},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00290-Y},
doi = {10.1016/0012-365X(94)00290-Y},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Syslo95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeightonMPSST95,
author = {Frank Thomson Leighton and
Fillia Makedon and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos and
Spyros Tragoudas},
title = {Fast Approximation Algorithms for Multicommodity Flow Problems},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {228--243},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1020},
doi = {10.1006/JCSS.1995.1020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LeightonMPSST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/PlotkinST95,
author = {Serge A. Plotkin and
David B. Shmoys and
{\'{E}}va Tardos},
title = {Fast Approximation Algorithms for Fractional Packing and Covering
Problems},
journal = {Math. Oper. Res.},
volume = {20},
number = {2},
pages = {257--301},
year = {1995},
url = {https://doi.org/10.1287/moor.20.2.257},
doi = {10.1287/MOOR.20.2.257},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/PlotkinST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/FraserI95,
author = {C. B. Fraser and
Robert W. Irving},
title = {Approximation Algorithms for the Shortest Common Supersequence},
journal = {Nord. J. Comput.},
volume = {2},
number = {3},
pages = {303--325},
year = {1995},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/FraserI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GrigoriadisK95,
author = {Michael D. Grigoriadis and
Leonid G. Khachiyan},
title = {A sublinear-time randomized approximation algorithm for matrix games},
journal = {Oper. Res. Lett.},
volume = {18},
number = {2},
pages = {53--58},
year = {1995},
url = {https://doi.org/10.1016/0167-6377(95)00032-0},
doi = {10.1016/0167-6377(95)00032-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GrigoriadisK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Kovalyov95,
author = {Mikhail Y. Kovalyov},
title = {Improving the complexities of approximation algorithms for optimization
problems},
journal = {Oper. Res. Lett.},
volume = {17},
number = {2},
pages = {85--87},
year = {1995},
url = {https://doi.org/10.1016/0167-6377(95)91591-Z},
doi = {10.1016/0167-6377(95)91591-Z},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Kovalyov95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kordecki95,
author = {Wojciech Kordecki},
title = {Maximal Full Subspaces in Random Projective Spaces- Thresholds and
Poisson Approximation},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {297--308},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060216},
doi = {10.1002/RSA.3240060216},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kordecki95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Shimozono95,
author = {Shinichi Shimozono},
editor = {John Staples and
Peter Eades and
Naoki Katoh and
Alistair Moffat},
title = {An Approximation Algorithm for Alphabet Indexing Problem},
booktitle = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95,
Cairns, Australia, December 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1004},
pages = {2--11},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0015403},
doi = {10.1007/BFB0015403},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Shimozono95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KhullerVY94,
author = {Samir Khuller and
Uzi Vishkin and
Neal E. Young},
title = {A Primal-Dual Parallel Approximation Technique Applied to Weighted
Set and Vertex Covers},
journal = {J. Algorithms},
volume = {17},
number = {2},
pages = {280--289},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1036},
doi = {10.1006/JAGM.1994.1036},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/KhullerVY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Dunham94,
author = {Charles B. Dunham},
title = {Uniform approximation by Mc Callig rationals},
journal = {Numer. Algorithms},
volume = {7},
number = {2},
pages = {201--204},
year = {1994},
url = {https://doi.org/10.1007/BF02140683},
doi = {10.1007/BF02140683},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Dunham94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/neco/Finnoff94,
author = {William Finnoff},
title = {Diffusion Approximations for the Constant Learning Rate Backpropagation
Algorithm and Resistance to Local Minima},
journal = {Neural Comput.},
volume = {6},
number = {2},
pages = {285--295},
year = {1994},
url = {https://doi.org/10.1162/neco.1994.6.2.285},
doi = {10.1162/NECO.1994.6.2.285},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/neco/Finnoff94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Stewart93,
author = {Iain A. Stewart},
title = {On Two Approximation Algorithms for the Clique Problem},
journal = {Int. J. Found. Comput. Sci.},
volume = {4},
number = {2},
pages = {117--133},
year = {1993},
url = {https://doi.org/10.1142/S0129054193000080},
doi = {10.1142/S0129054193000080},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Stewart93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijns/Newman93,
author = {Rhys Newman},
title = {A Function Approximation Algorithm Using Sequential Composition},
journal = {Int. J. Neural Syst.},
volume = {4},
number = {2},
pages = {187--199},
year = {1993},
url = {https://doi.org/10.1142/S012906579300016X},
doi = {10.1142/S012906579300016X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijns/Newman93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zelikovsky93,
author = {Alexander Zelikovsky},
title = {A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs},
journal = {Inf. Process. Lett.},
volume = {46},
number = {2},
pages = {79--83},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90201-J},
doi = {10.1016/0020-0190(93)90201-J},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Zelikovsky93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KhullerT93,
author = {Samir Khuller and
Ramakrishna Thurimella},
title = {Approximation Algorithms for Graph Augmentation},
journal = {J. Algorithms},
volume = {14},
number = {2},
pages = {214--225},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1010},
doi = {10.1006/JAGM.1993.1010},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KhullerT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Ye93,
author = {Yinyu Ye},
title = {A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary
Point of the General Linear Complementarity Problem},
journal = {Math. Oper. Res.},
volume = {18},
number = {2},
pages = {334--345},
year = {1993},
url = {https://doi.org/10.1287/moor.18.2.334},
doi = {10.1287/MOOR.18.2.334},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Ye93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HochbaumMNT93,
author = {Dorit S. Hochbaum and
Nimrod Megiddo and
Joseph Naor and
Arie Tamir},
title = {Tight bounds and 2-approximation algorithms for integer programs with
two variables per inequality},
journal = {Math. Program.},
volume = {62},
pages = {69--83},
year = {1993},
url = {https://doi.org/10.1007/BF01585160},
doi = {10.1007/BF01585160},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HochbaumMNT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/XuLC93,
author = {Yuan Xu and
William A. Light and
Elliot Ward Cheney},
title = {Constructive methods of approximation by ridge functions and radial
functions},
journal = {Numer. Algorithms},
volume = {4},
number = {2},
pages = {205--223},
year = {1993},
url = {https://doi.org/10.1007/BF02144104},
doi = {10.1007/BF02144104},
timestamp = {Wed, 23 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/XuLC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/Dupac93,
author = {V{\'{a}}clav Dupac},
title = {Adaptive Algorithms and Stochastic Approximations {(A.} Benveniste,
M. M{\'{e}}tivier, and P. Priouret)},
journal = {{SIAM} Rev.},
volume = {35},
number = {2},
pages = {313--314},
year = {1993},
url = {https://doi.org/10.1137/1035062},
doi = {10.1137/1035062},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/Dupac93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Matula93,
author = {David W. Matula},
editor = {Vijaya Ramachandran},
title = {A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {500--504},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313872},
timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
biburl = {https://dblp.org/rec/conf/soda/Matula93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GusfieldP92,
author = {Dan Gusfield and
Leonard Pitt},
title = {A Bounded Approximation for the Minimum Cost 2-Sat Problem},
journal = {Algorithmica},
volume = {8},
number = {2},
pages = {103--117},
year = {1992},
url = {https://doi.org/10.1007/BF01758838},
doi = {10.1007/BF01758838},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GusfieldP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Paschos92,
author = {Vangelis Th. Paschos},
title = {A (Delta/2)-Approximation Algorithm for the Maximum Independent Set
Problem},
journal = {Inf. Process. Lett.},
volume = {44},
number = {1},
pages = {11--13},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90248-T},
doi = {10.1016/0020-0190(92)90248-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Paschos92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Blaha92,
author = {Kenneth D. Blaha},
title = {Minimum Bases for Permutation Groups: The Greedy Approximation},
journal = {J. Algorithms},
volume = {13},
number = {2},
pages = {297--306},
year = {1992},
url = {https://doi.org/10.1016/0196-6774(92)90020-D},
doi = {10.1016/0196-6774(92)90020-D},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Blaha92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/VargaC92,
author = {Richard S. Varga and
Amos J. Carpenter},
title = {Some numerical results on best uniform rational approximation of\emph{x}\({}^{\mbox{{\(\alpha\)}}}\)
on [0, 1]},
journal = {Numer. Algorithms},
volume = {2},
number = {2},
pages = {171--185},
year = {1992},
url = {https://doi.org/10.1007/BF02145384},
doi = {10.1007/BF02145384},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/VargaC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Watson92,
author = {G. A. Watson},
title = {Linear best approximation using a class of polyhedral norms},
journal = {Numer. Algorithms},
volume = {2},
number = {3},
pages = {321--335},
year = {1992},
url = {https://doi.org/10.1007/BF02139472},
doi = {10.1007/BF02139472},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Watson92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/BuiHL92,
author = {Thang Nguyen Bui and
Willie Hsu and
SingLing Lee},
title = {A 2.5 approximation algorithm for the multi-via assignment problem},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {11},
number = {11},
pages = {1325--1333},
year = {1992},
url = {https://doi.org/10.1109/43.177396},
doi = {10.1109/43.177396},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/BuiHL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/BaratchartCO91,
author = {Laurent Baratchart and
Michel Cardelli and
Martine Olivi},
title = {Identification and rational L\({}^{\mbox{2}}\) approximation {A} gradient
algorithm},
journal = {Autom.},
volume = {27},
number = {2},
pages = {413--417},
year = {1991},
url = {https://doi.org/10.1016/0005-1098(91)90092-G},
doi = {10.1016/0005-1098(91)90092-G},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/BaratchartCO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonA91,
author = {Noga Alon and
Yossi Azar},
title = {Parallel comparison algorithms for approximation problems},
journal = {Comb.},
volume = {11},
number = {2},
pages = {97--122},
year = {1991},
url = {https://doi.org/10.1007/BF01206355},
doi = {10.1007/BF01206355},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kierstead91,
author = {Hal A. Kierstead},
title = {A polynomial time approximation algorithm for dynamic storage allocation},
journal = {Discret. Math.},
volume = {88},
number = {2-3},
pages = {231--237},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90011-P},
doi = {10.1016/0012-365X(91)90011-P},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kierstead91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FeoK90,
author = {Thomas A. Feo and
Mallek Khellaf},
title = {A class of bounded approximation algorithms for graph partitioning},
journal = {Networks},
volume = {20},
number = {2},
pages = {181--195},
year = {1990},
url = {https://doi.org/10.1002/net.3230200205},
doi = {10.1002/NET.3230200205},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FeoK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson90a,
author = {Svante Janson},
title = {Poisson Approximation for Large Deviations},
journal = {Random Struct. Algorithms},
volume = {1},
number = {2},
pages = {221--230},
year = {1990},
url = {https://doi.org/10.1002/rsa.3240010209},
doi = {10.1002/RSA.3240010209},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/Shahrokhi89,
author = {Farhad Shahrokhi},
title = {Approximation Algorithms for the Maximum Concurrent Flow Problem},
journal = {{INFORMS} J. Comput.},
volume = {1},
number = {2},
pages = {62--69},
year = {1989},
url = {https://doi.org/10.1287/ijoc.1.2.62},
doi = {10.1287/IJOC.1.2.62},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/Shahrokhi89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BasartH89,
author = {Josep M. Basart and
Lloren{\c{c}} Huguet i Rotger},
title = {An Approximation Algorithm for the {TSP}},
journal = {Inf. Process. Lett.},
volume = {31},
number = {2},
pages = {77--81},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90072-0},
doi = {10.1016/0020-0190(89)90072-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BasartH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LevcopoulosL87,
author = {Christos Levcopoulos and
Andrzej Lingas},
title = {On Approximation Behavior of the Greedy Triangulation for Convex Polygons},
journal = {Algorithmica},
volume = {2},
pages = {15--193},
year = {1987},
url = {https://doi.org/10.1007/BF01840358},
doi = {10.1007/BF01840358},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LevcopoulosL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/WuWW86,
author = {Ying{-}Fung Wu and
Peter Widmayer and
C. K. Wong},
title = {A Faster Approximation Algorithm for the Steiner Problem in Graphs},
journal = {Acta Informatica},
volume = {23},
number = {2},
pages = {223--229},
year = {1986},
url = {https://doi.org/10.1007/BF00289500},
doi = {10.1007/BF00289500},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/WuWW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kan86,
author = {A. H. G. Rinnooy Kan},
title = {An introduction to the analysis of approximation algorithms},
journal = {Discret. Appl. Math.},
volume = {14},
number = {2},
pages = {171--185},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90059-4},
doi = {10.1016/0166-218X(86)90059-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kan86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Yuan85,
author = {Ya{-}Xiang Yuan},
title = {An only 2-step Q-superlinear convergence example for some algorithms
that use reduced hessian approximations},
journal = {Math. Program.},
volume = {32},
number = {2},
pages = {224--231},
year = {1985},
url = {https://doi.org/10.1007/BF01586092},
doi = {10.1007/BF01586092},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Yuan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/CordellaD85,
author = {Luigi P. Cordella and
G. Dettori},
title = {An {O(N)} algorithm for polygonal approximation},
journal = {Pattern Recognit. Lett.},
volume = {3},
number = {2},
pages = {93--97},
year = {1985},
url = {https://doi.org/10.1016/0167-8655(85)90014-5},
doi = {10.1016/0167-8655(85)90014-5},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/CordellaD85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NishizekiAW83,
author = {Takao Nishizeki and
Takao Asano and
Takahiro Watanabe},
title = {An approximation algorithm for the hamiltonian walk problem on maximal
planar graphs},
journal = {Discret. Appl. Math.},
volume = {5},
number = {2},
pages = {211--222},
year = {1983},
url = {https://doi.org/10.1016/0166-218X(83)90042-2},
doi = {10.1016/0166-218X(83)90042-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NishizekiAW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-YehudaE81,
author = {Reuven Bar{-}Yehuda and
Shimon Even},
title = {A Linear-Time Approximation Algorithm for the Weighted Vertex Cover
Problem},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {198--203},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90020-1},
doi = {10.1016/0196-6774(81)90020-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bar-YehudaE81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonJ81,
author = {Greg N. Frederickson and
Joseph F. J{\'{a}}J{\'{a}}},
title = {Approximation Algorithms for Several Graph Augmentation Problems},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {2},
pages = {270--283},
year = {1981},
url = {https://doi.org/10.1137/0210019},
doi = {10.1137/0210019},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonJ81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AielloBMV80,
author = {Aldo Aiello and
Ernesto Burattini and
A. Massarotti and
Francesco Ventriglia},
title = {"A posteriori" evaluation of bin packing approximation algorithms},
journal = {Discret. Appl. Math.},
volume = {2},
number = {2},
pages = {159--161},
year = {1980},
url = {https://doi.org/10.1016/0166-218X(80)90006-2},
doi = {10.1016/0166-218X(80)90006-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AielloBMV80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/BarrodaleR80,
author = {Ian Barrodale and
F. D. K. Roberts},
title = {Algorithm 552: Solution of the Constrained \emph{I}\({}_{\mbox{1}}\)
Linear Approximation Problem {[F4]}},
journal = {{ACM} Trans. Math. Softw.},
volume = {6},
number = {2},
pages = {231--235},
year = {1980},
url = {https://doi.org/10.1145/355887.355896},
doi = {10.1145/355887.355896},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toms/BarrodaleR80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FredericksonHK78,
author = {Greg N. Frederickson and
Matthew S. Hecht and
Chul E. Kim},
title = {Approximation Algorithms for Some Routing Problems},
journal = {{SIAM} J. Comput.},
volume = {7},
number = {2},
pages = {178--193},
year = {1978},
url = {https://doi.org/10.1137/0207017},
doi = {10.1137/0207017},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FredericksonHK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcom/FritchmanHMS77,
author = {Bruce D. Fritchman and
C. D. Hafer and
J. C. Mixsell and
M. A. Sattar},
title = {Approximations to a Joint Detection/Decoding Algorithm},
journal = {{IEEE} Trans. Commun.},
volume = {25},
number = {2},
pages = {271--278},
year = {1977},
url = {https://doi.org/10.1109/TCOM.1977.1093796},
doi = {10.1109/TCOM.1977.1093796},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcom/FritchmanHMS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/Wal76,
author = {J. van der Wal},
title = {A successive approximation algorithm for an undiscounted Markov decision
process},
journal = {Computing},
volume = {17},
number = {2},
pages = {157--162},
year = {1976},
url = {https://doi.org/10.1007/BF02276760},
doi = {10.1007/BF02276760},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/Wal76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/Pavlidis76,
author = {Theodosios Pavlidis},
title = {The Use of Algorithms of Piecewise Approximations for Picture Processing
Applications},
journal = {{ACM} Trans. Math. Softw.},
volume = {2},
number = {4},
pages = {305--321},
year = {1976},
url = {https://doi.org/10.1145/355705.355706},
doi = {10.1145/355705.355706},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toms/Pavlidis76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/Wilson76,
author = {D. G. Wilson},
title = {Algorithm 510: Piecewise Linear Approximation to Tabulated Data {[E2]}},
journal = {{ACM} Trans. Math. Softw.},
volume = {2},
number = {4},
pages = {388--391},
year = {1976},
url = {https://doi.org/10.1145/355705.355714},
doi = {10.1145/355705.355714},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toms/Wilson76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/OsborneW71,
author = {Michael R. Osborne and
G. A. Watson},
title = {On an Algorithm for Discrete Nonlinear L\({}_{\mbox{1}}\) Approximation},
journal = {Comput. J.},
volume = {14},
number = {2},
pages = {184--188},
year = {1971},
url = {https://doi.org/10.1093/comjnl/14.2.184},
doi = {10.1093/COMJNL/14.2.184},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/OsborneW71.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tssc/Saridis70,
author = {George N. Saridis},
title = {Learning Applied to Successive Approximation Algorithms},
journal = {{IEEE} Trans. Syst. Sci. Cybern.},
volume = {6},
number = {2},
pages = {97--103},
year = {1970},
url = {https://doi.org/10.1109/TSSC.1970.300282},
doi = {10.1109/TSSC.1970.300282},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tssc/Saridis70.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Phillips68a,
author = {G. M. Phillips},
title = {Algorithms for Piecewise Straight Line Approximations},
journal = {Comput. J.},
volume = {11},
number = {2},
pages = {211--212},
year = {1968},
url = {https://doi.org/10.1093/comjnl/11.2.211},
doi = {10.1093/COMJNL/11.2.211},
timestamp = {Mon, 13 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/Phillips68a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-24 12:44 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:
