Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "faster approximation"
download as .bib file
@inproceedings{DBLP:conf/soda/Quanrud24,
author = {Kent Quanrud},
editor = {David P. Woodruff},
title = {Faster exact and approximation algorithms for packing and covering
matroids via push-relabel},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2305--2336},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.82},
doi = {10.1137/1.9781611977912.82},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/Quanrud24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-14815,
author = {Thijs van der Horst and
Tim Ophelders},
title = {Faster Fr{\'{e}}chet Distance Approximation through Truncated
Smoothing},
journal = {CoRR},
volume = {abs/2401.14815},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.14815},
doi = {10.48550/ARXIV.2401.14815},
eprinttype = {arXiv},
eprint = {2401.14815},
timestamp = {Tue, 06 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-14815.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qmi/ProtasovL23,
author = {Stanislav I. Protasov and
Marina O. Lisnichenko},
title = {Faster quantum state decomposition with Tucker tensor approximation},
journal = {Quantum Mach. Intell.},
volume = {5},
number = {2},
pages = {1--10},
year = {2023},
url = {https://doi.org/10.1007/s42484-023-00113-4},
doi = {10.1007/S42484-023-00113-4},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qmi/ProtasovL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HarviainenK23,
author = {Juha Harviainen and
Mikko Koivisto},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {A Faster Practical Approximation Scheme for the Permanent},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {12216--12224},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i10.26440},
doi = {10.1609/AAAI.V37I10.26440},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/HarviainenK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/BengaliV23,
author = {Vedangi Bengali and
Nate Veldt},
editor = {Ingo Frommholz and
Frank Hopfgartner and
Mark Lee and
Michael Oakes and
Mounia Lalmas and
Min Zhang and
Rodrygo L. T. Santos},
title = {Faster Approximation Algorithms for Parameterized Graph Clustering
and Edge Labeling},
booktitle = {Proceedings of the 32nd {ACM} International Conference on Information
and Knowledge Management, {CIKM} 2023, Birmingham, United Kingdom,
October 21-25, 2023},
pages = {78--87},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583780.3614878},
doi = {10.1145/3583780.3614878},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/BengaliV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01478,
author = {Kent Quanrud},
title = {Faster exact and approximation algorithms for packing and covering
matroids via push-relabel},
journal = {CoRR},
volume = {abs/2303.01478},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01478},
doi = {10.48550/ARXIV.2303.01478},
eprinttype = {arXiv},
eprint = {2303.01478},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-04884,
author = {Vedangi Bengali and
Nate Veldt},
title = {Faster Approximation Algorithms for Parameterized Graph Clustering
and Edge Labeling},
journal = {CoRR},
volume = {abs/2306.04884},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.04884},
doi = {10.48550/ARXIV.2306.04884},
eprinttype = {arXiv},
eprint = {2306.04884},
timestamp = {Wed, 14 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-04884.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-08069,
author = {Ernest van Wijland and
Hang Zhou},
title = {Faster Approximation Schemes for k-TSP and k-MST in the Euclidean
Space},
journal = {CoRR},
volume = {abs/2307.08069},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.08069},
doi = {10.48550/ARXIV.2307.08069},
eprinttype = {arXiv},
eprint = {2307.08069},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-08069.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/quantum/BrandaoKF22,
author = {Fernando G. S. L. Brand{\~{a}}o and
Richard Kueng and
Daniel Stilck Fran{\c{c}}a},
title = {Faster quantum and classical {SDP} approximations for quadratic binary
optimization},
journal = {Quantum},
volume = {6},
pages = {625},
year = {2022},
url = {https://doi.org/10.22331/q-2022-01-20-625},
doi = {10.22331/Q-2022-01-20-625},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/quantum/BrandaoKF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EsmerKMNS22,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Faster Exponential-Time Approximation Algorithms Using Approximate
Monotone Local Search},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {50:1--50:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.50},
doi = {10.4230/LIPICS.ESA.2022.50},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/EsmerKMNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/ZhaoFU22,
author = {Shipu Zhao and
Zachary Frangella and
Madeleine Udell},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {NysADMM: faster composite convex optimization via low-rank approximation},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {26824--26840},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/zhao22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/ZhaoFU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcnn/NagarajanSSR22,
author = {Amrit Nagarajan and
Sanchari Sen and
Jacob R. Stevens and
Anand Raghunathan},
title = {AxFormer: Accuracy-driven Approximation of Transformers for Faster,
Smaller and more Accurate {NLP} Models},
booktitle = {International Joint Conference on Neural Networks, {IJCNN} 2022, Padua,
Italy, July 18-23, 2022},
pages = {1--8},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/IJCNN55064.2022.9892797},
doi = {10.1109/IJCNN55064.2022.9892797},
timestamp = {Mon, 10 Oct 2022 17:40:09 +0200},
biburl = {https://dblp.org/rec/conf/ijcnn/NagarajanSSR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AhmadCDGGZ22,
author = {Zafar Ahmad and
Rezaul Chowdhury and
Rathish Das and
Pramod Ganapathi and
Aaron Gregory and
Yimin Zhu},
editor = {Kunal Agrawal and
I{-}Ting Angelina Lee},
title = {Brief Announcement: Faster Stencil Computations using Gaussian Approximations},
booktitle = {{SPAA} '22: 34th {ACM} Symposium on Parallelism in Algorithms and
Architectures, Philadelphia, PA, USA, July 11 - 14, 2022},
pages = {291--293},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3490148.3538558},
doi = {10.1145/3490148.3538558},
timestamp = {Tue, 12 Jul 2022 14:22:25 +0200},
biburl = {https://dblp.org/rec/conf/spaa/AhmadCDGGZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wob/AlexandrinoBODD22,
author = {Alexsandro Oliveira Alexandrino and
Klairton Lima Brito and
Andre Rodrigues Oliveira and
Ulisses Dias and
Zanoni Dias},
editor = {Nicole M. Scherer and
Raquel Cardoso de Melo Minardi},
title = {A 1.375-Approximation Algorithm for Sorting by Transpositions with
Faster Running Time},
booktitle = {Advances in Bioinformatics and Computational Biology - 15th Brazilian
Symposium on Bioinformatics, {BSB} 2022, Buzios, Brazil, September
21-23, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13523},
pages = {147--157},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-21175-1\_16},
doi = {10.1007/978-3-031-21175-1\_16},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wob/AlexandrinoBODD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-13481,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
title = {Faster Exponential-Time Approximation Algorithms Using Approximate
Monotone Local Search},
journal = {CoRR},
volume = {abs/2206.13481},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.13481},
doi = {10.48550/ARXIV.2206.13481},
eprinttype = {arXiv},
eprint = {2206.13481},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-13481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nm/Wang21,
author = {Haiyong Wang},
title = {How much faster does the best polynomial approximation converge than
Legendre projection?},
journal = {Numerische Mathematik},
volume = {147},
number = {2},
pages = {481--503},
year = {2021},
url = {https://doi.org/10.1007/s00211-021-01173-z},
doi = {10.1007/S00211-021-01173-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nm/Wang21.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}
}
@inproceedings{DBLP:conf/esa/0001MW21,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Faster (1+{\(\epsilon\)})-Approximation for Unsplittable Flow on a
Path via Resource Augmentation and Back},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {49:1--49:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.49},
doi = {10.4230/LIPICS.ESA.2021.49},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/0001MW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-12879,
author = {Ariel Kulik and
Roy Schwartz and
Hadas Shachnai},
title = {A Faster Tight Approximation for Submodular Maximization Subject to
a Knapsack Constraint},
journal = {CoRR},
volume = {abs/2102.12879},
year = {2021},
url = {https://arxiv.org/abs/2102.12879},
eprinttype = {arXiv},
eprint = {2102.12879},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-12879.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-10699,
author = {Nate Veldt},
title = {Faster Deterministic Approximation Algorithms for Correlation Clustering
and Cluster Deletion},
journal = {CoRR},
volume = {abs/2111.10699},
year = {2021},
url = {https://arxiv.org/abs/2111.10699},
eprinttype = {arXiv},
eprint = {2111.10699},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-10699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-01598,
author = {Xiao Ling and
Tim Menzies},
title = {Faster Multi-Goal Simulation-Based Testing Using DoLesS (Domination
with Least Square Approximation)},
journal = {CoRR},
volume = {abs/2112.01598},
year = {2021},
url = {https://arxiv.org/abs/2112.01598},
eprinttype = {arXiv},
eprint = {2112.01598},
timestamp = {Tue, 07 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-01598.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/ChenHNW20,
author = {Zhi{-}Zhong Chen and
Youta Harada and
Yuna Nakamura and
Lusheng Wang},
title = {Faster Exact Computation of rSPR Distance via Better Approximation},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {17},
number = {3},
pages = {916--929},
year = {2020},
url = {https://doi.org/10.1109/TCBB.2018.2878731},
doi = {10.1109/TCBB.2018.2878731},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/ChenHNW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChanH20,
author = {Timothy M. Chan and
Qizheng He},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {Faster Approximation Algorithms for Geometric Set Cover},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.27},
doi = {10.4230/LIPICS.SOCG.2020.27},
timestamp = {Wed, 16 Jun 2021 12:02:54 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChanH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EdenRS20,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
editor = {Shuchi Chawla},
title = {Faster sublinear approximation of the number of \emph{k}-cliques in
low-arboricity graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1467--1478},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.89},
doi = {10.1137/1.9781611975994.89},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EdenRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13420,
author = {Timothy M. Chan and
Qizheng He},
title = {Faster Approximation Algorithms for Geometric Set Cover},
journal = {CoRR},
volume = {abs/2003.13420},
year = {2020},
url = {https://arxiv.org/abs/2003.13420},
eprinttype = {arXiv},
eprint = {2003.13420},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-13476,
author = {Adiel Statman and
Liat Rozenberg and
Dan Feldman},
title = {Faster Projective Clustering Approximation of Big Data},
journal = {CoRR},
volume = {abs/2011.13476},
year = {2020},
url = {https://arxiv.org/abs/2011.13476},
eprinttype = {arXiv},
eprint = {2011.13476},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-13476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HeydrichW19,
author = {Sandy Heydrich and
Andreas Wiese},
title = {Faster Approximation Schemes for the Two-Dimensional Knapsack Problem},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {47:1--47:28},
year = {2019},
url = {https://doi.org/10.1145/3338512},
doi = {10.1145/3338512},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HeydrichW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ducoffe19,
author = {Guillaume Ducoffe},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Faster Approximation Algorithms for Computing Shortest Cycles on Weighted
Graphs},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {49:1--49:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.49},
doi = {10.4230/LIPICS.ICALP.2019.49},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Ducoffe19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Manurangsi19,
author = {Pasin Manurangsi},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel
and Improved Approximation},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.15},
doi = {10.4230/OASICS.SOSA.2019.15},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/Manurangsi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-04613,
author = {Fernando G. S. L. Brand{\~{a}}o and
Richard Kueng and
Daniel Stilck Fran{\c{c}}a},
title = {Faster quantum and classical {SDP} approximations for quadratic binary
optimization},
journal = {CoRR},
volume = {abs/1909.04613},
year = {2019},
url = {http://arxiv.org/abs/1909.04613},
eprinttype = {arXiv},
eprint = {1909.04613},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-04613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AggarwalUV19,
author = {Divesh Aggarwal and
Bogdan Ursu and
Serge Vaudenay},
title = {Faster Sieving Algorithm for Approximate {SVP} with Constant Approximation
Factors},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1028},
year = {2019},
url = {https://eprint.iacr.org/2019/1028},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AggarwalUV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Cohen18,
author = {Michael Benjamin Cohen},
title = {Sparse approximations, iterative methods, and faster algorithms for
matrices and graphs},
school = {Massachusetts Institute of Technology, Cambridge, {USA}},
year = {2018},
url = {https://hdl.handle.net/1721.1/119599},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Cohen18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/AblinCG18,
author = {Pierre Ablin and
Jean{-}Fran{\c{c}}ois Cardoso and
Alexandre Gramfort},
title = {Faster Independent Component Analysis by Preconditioning With Hessian
Approximations},
journal = {{IEEE} Trans. Signal Process.},
volume = {66},
number = {15},
pages = {4040--4049},
year = {2018},
url = {https://doi.org/10.1109/TSP.2018.2844203},
doi = {10.1109/TSP.2018.2844203},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/AblinCG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KumarS18,
author = {Nirman Kumar and
Stavros Sintos},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Faster Approximation Algorithm for the \emph{k}-Regret Minimizing
Set and Related Problems},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {62--74},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.6},
doi = {10.1137/1.9781611975055.6},
timestamp = {Thu, 04 Jan 2018 14:01:44 +0100},
biburl = {https://dblp.org/rec/conf/alenex/KumarS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Kolmogorov18,
author = {Vladimir Kolmogorov},
editor = {S{\'{e}}bastien Bubeck and
Vianney Perchet and
Philippe Rigollet},
title = {A Faster Approximation Algorithm for the Gibbs Partition Function},
booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9
July 2018},
series = {Proceedings of Machine Learning Research},
volume = {75},
pages = {228--249},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v75/kolmogorov18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
biburl = {https://dblp.org/rec/conf/colt/Kolmogorov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmt/Gove18,
author = {Robert Gove},
editor = {Markus Seidl and
Thomas Moser and
Kerstin Blumenstein and
Matthias Zeppelzauer and
Michael Iber},
title = {It Pays to Be Lazy: Reusing Force Approximations to Compute Better
Graph Layouts Faster},
booktitle = {Proceedings of the 11th Forum Media Technology and 4th All Around
Audio Symposium, St. P{\"{o}}lten, Austria, November 28-29, 2018},
series = {{CEUR} Workshop Proceedings},
volume = {2299},
pages = {43--51},
publisher = {CEUR-WS.org},
year = {2018},
url = {https://ceur-ws.org/Vol-2299/paper6.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:18 +0100},
biburl = {https://dblp.org/rec/conf/fmt/Gove18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/PratapS18,
author = {Rameshwar Pratap and
Sandeep Sen},
editor = {Costas S. Iliopoulos and
Hon Wai Leong and
Wing{-}Kin Sung},
title = {Faster Coreset Construction for Projective Clustering via Low-Rank
Approximation},
booktitle = {Combinatorial Algorithms - 29th International Workshop, {IWOCA} 2018,
Singapore, July 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10979},
pages = {336--348},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94667-2\_28},
doi = {10.1007/978-3-319-94667-2\_28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/PratapS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/HaeuplerL18,
author = {Bernhard Haeupler and
Jason Li},
editor = {Ulrich Schmid and
Josef Widder},
title = {Faster Distributed Shortest Path Approximations via Shortcuts},
booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018},
series = {LIPIcs},
volume = {121},
pages = {33:1--33:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.DISC.2018.33},
doi = {10.4230/LIPICS.DISC.2018.33},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/HaeuplerL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-03671,
author = {Bernhard Haeupler and
Jason Li},
title = {Faster Distributed Shortest Path Approximations via Shortcuts},
journal = {CoRR},
volume = {abs/1802.03671},
year = {2018},
url = {http://arxiv.org/abs/1802.03671},
eprinttype = {arXiv},
eprint = {1802.03671},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-03671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-03792,
author = {Pasin Manurangsi},
title = {A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel
and Improved Approximation},
journal = {CoRR},
volume = {abs/1810.03792},
year = {2018},
url = {http://arxiv.org/abs/1810.03792},
eprinttype = {arXiv},
eprint = {1810.03792},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-03792.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10229,
author = {Guillaume Ducoffe},
title = {Faster approximation algorithms for computing shortest cycles on weighted
graphs},
journal = {CoRR},
volume = {abs/1810.10229},
year = {2018},
url = {http://arxiv.org/abs/1810.10229},
eprinttype = {arXiv},
eprint = {1810.10229},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10229.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04425,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
title = {Faster sublinear approximations of k-cliques for low arboricity graphs},
journal = {CoRR},
volume = {abs/1811.04425},
year = {2018},
url = {http://arxiv.org/abs/1811.04425},
eprinttype = {arXiv},
eprint = {1811.04425},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NandyPR17,
author = {Subhas C. Nandy and
Supantha Pandit and
Sasanka Roy},
title = {Faster approximation for maximum independent set on unit disk graph},
journal = {Inf. Process. Lett.},
volume = {127},
pages = {58--61},
year = {2017},
url = {https://doi.org/10.1016/j.ipl.2017.07.007},
doi = {10.1016/J.IPL.2017.07.007},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NandyPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Allen-ZhuL17a,
author = {Zeyuan Allen{-}Zhu and
Yuanzhi Li},
editor = {Doina Precup and
Yee Whye Teh},
title = {Faster Principal Component Regression and Stable Matrix Chebyshev
Approximation},
booktitle = {Proceedings of the 34th International Conference on Machine Learning,
{ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},
series = {Proceedings of Machine Learning Research},
volume = {70},
pages = {107--115},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v70/allen-zhu17c.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/Allen-ZhuL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HeydrichW17,
author = {Sandy Heydrich and
Andreas Wiese},
editor = {Philip N. Klein},
title = {Faster approximation schemes for the two-dimensional knapsack problem},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {79--98},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.6},
doi = {10.1137/1.9781611974782.6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HeydrichW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fujii16,
author = {Kaito Fujii},
title = {Faster approximation algorithms for maximizing a monotone submodular
function subject to a b-matching constraint},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {578--584},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.004},
doi = {10.1016/J.IPL.2016.04.004},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fujii16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinS16,
author = {Aaron Bernstein and
Cliff Stein},
editor = {Robert Krauthgamer},
title = {Faster Fully Dynamic Matchings with Small Approximation Ratios},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {692--711},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch50},
doi = {10.1137/1.9781611974331.CH50},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BentzB16,
author = {C{\'{e}}dric Bentz and
Pierre Le Bodic},
title = {A note on "Approximation schemes for a subclass of subset selection
problems", and a faster {FPTAS} for the Minimum Knapsack Problem},
journal = {CoRR},
volume = {abs/1607.07950},
year = {2016},
url = {http://arxiv.org/abs/1607.07950},
eprinttype = {arXiv},
eprint = {1607.07950},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BentzB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GonenS16a,
author = {Alon Gonen and
Shai Shalev{-}Shwartz},
title = {Faster Low-rank Approximation using Adaptive Gap-based Preconditioning},
journal = {CoRR},
volume = {abs/1607.02925},
year = {2016},
url = {http://arxiv.org/abs/1607.02925},
eprinttype = {arXiv},
eprint = {1607.02925},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GonenS16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Kolmogorov16,
author = {Vladimir Kolmogorov},
title = {A Faster Approximation Algorithm for the Gibbs Partition Function},
journal = {CoRR},
volume = {abs/1608.04223},
year = {2016},
url = {http://arxiv.org/abs/1608.04223},
eprinttype = {arXiv},
eprint = {1608.04223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Kolmogorov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NandyPR16,
author = {Subhas C. Nandy and
Supantha Pandit and
Sasanka Roy},
title = {Faster Approximation for Maximum Independent Set on Unit Disk Graph},
journal = {CoRR},
volume = {abs/1611.03260},
year = {2016},
url = {http://arxiv.org/abs/1611.03260},
eprinttype = {arXiv},
eprint = {1611.03260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NandyPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ZhuL16d,
author = {Zeyuan Allen Zhu and
Yuanzhi Li},
title = {Faster Principal Component Regression via Optimal Polynomial Approximation
to sgn(x)},
journal = {CoRR},
volume = {abs/1608.04773},
year = {2016},
url = {http://arxiv.org/abs/1608.04773},
eprinttype = {arXiv},
eprint = {1608.04773},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ZhuL16d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/CunhaKHF15,
author = {Lu{\'{\i}}s Felipe I. Cunha and
Luis Antonio Brasil Kowada and
Rodrigo de A. Hausen and
Celina M. H. de Figueiredo},
title = {A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*},
journal = {J. Comput. Biol.},
volume = {22},
number = {11},
pages = {1044--1056},
year = {2015},
url = {https://doi.org/10.1089/cmb.2014.0298},
doi = {10.1089/CMB.2014.0298},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/CunhaKHF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChowdhuryJNSV15,
author = {Muhammad F. I. Chowdhury and
Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
title = {Faster Algorithms for Multivariate Interpolation With Multiplicities
and Simultaneous Polynomial Approximations},
journal = {{IEEE} Trans. Inf. Theory},
volume = {61},
number = {5},
pages = {2370--2387},
year = {2015},
url = {https://doi.org/10.1109/TIT.2015.2416068},
doi = {10.1109/TIT.2015.2416068},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChowdhuryJNSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GharanT15,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
journal = {Theory Comput.},
volume = {11},
pages = {241--256},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a009},
doi = {10.4086/TOC.2015.V011A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GharanT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiniazMSL15,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid and
Paul Liu},
title = {A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/12.pdf},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiniazMSL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/visapp/SchwartzRP15,
author = {William Robson Schwartz and
Pedro Jussieu de Rezende and
H{\'{e}}lio Pedrini},
editor = {Jos{\'{e}} Braz and
Sebastiano Battiato and
Francisco H. Imai},
title = {Faster Approximations of Shortest Geodesic Paths on Polyhedra Through
Adaptive Priority Queue},
booktitle = {{VISAPP} 2015 - Proceedings of the 10th International Conference on
Computer Vision Theory and Applications, Volume 1, Berlin, Germany,
11-14 March, 2015},
pages = {371--378},
publisher = {SciTePress},
year = {2015},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/visapp/SchwartzRP15.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/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}
}
@inproceedings{DBLP:conf/wabi/CunhaKHF14,
author = {Lu{\'{\i}}s Felipe I. Cunha and
Luis Antonio Brasil Kowada and
Rodrigo de A. Hausen and
Celina M. H. de Figueiredo},
editor = {Daniel G. Brown and
Burkhard Morgenstern},
title = {A Faster 1.375-Approximation Algorithm for Sorting by Transpositions},
booktitle = {Algorithms in Bioinformatics - 14th International Workshop, {WABI}
2014, Wroclaw, Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8701},
pages = {26--37},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44753-6\_3},
doi = {10.1007/978-3-662-44753-6\_3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/CunhaKHF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChowdhuryJNSV14,
author = {Muhammad F. I. Chowdhury and
Claude{-}Pierre Jeannerod and
Vincent Neiger and
{\'{E}}ric Schost and
Gilles Villard},
title = {Faster Algorithms for Multivariate Interpolation with Multiplicities
and Simultaneous Polynomial Approximations},
journal = {CoRR},
volume = {abs/1402.0643},
year = {2014},
url = {http://arxiv.org/abs/1402.0643},
eprinttype = {arXiv},
eprint = {1402.0643},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChowdhuryJNSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EpsteinL14,
author = {Leah Epstein and
Asaf Levin},
title = {Minimum total weighted completion time: Faster approximation schemes},
journal = {CoRR},
volume = {abs/1404.1059},
year = {2014},
url = {http://arxiv.org/abs/1404.1059},
eprinttype = {arXiv},
eprint = {1404.1059},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EpsteinL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GutfraindKLR14,
author = {Alexander Gutfraind and
Jeremy Kun and
{\'{A}}d{\'{a}}m D{\'{a}}niel Lelkes and
Lev Reyzin},
title = {Network installation and recovery: approximation lower bounds and
faster exact formulations},
journal = {CoRR},
volume = {abs/1411.3640},
year = {2014},
url = {http://arxiv.org/abs/1411.3640},
eprinttype = {arXiv},
eprint = {1411.3640},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GutfraindKLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SchmittW13,
author = {Manuel Schmitt and
Rolf Wanka},
title = {Exploiting independent subformulas: {A} faster approximation scheme
for {\#}k-SAT},
journal = {Inf. Process. Lett.},
volume = {113},
number = {9},
pages = {337--344},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.02.013},
doi = {10.1016/J.IPL.2013.02.013},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SchmittW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgtools/KallbergL13,
author = {Linus K{\"{a}}llberg and
Thomas Larsson},
title = {Faster Approximation of Minimum Enclosing Balls by Distance Filtering
and {GPU} Parallelization},
journal = {J. Graph. Tools},
volume = {17},
number = {3},
pages = {67--84},
year = {2013},
url = {https://doi.org/10.1080/2165347X.2015.1037471},
doi = {10.1080/2165347X.2015.1037471},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgtools/KallbergL13.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}
}
@inproceedings{DBLP:conf/approx/GharanT13,
author = {Shayan Oveis Gharan and
Luca Trevisan},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {303--316},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_22},
doi = {10.1007/978-3-642-40328-6\_22},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GharanT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Calinescu13,
author = {Gruia C{\u{a}}linescu},
title = {Faster approximation for Symmetric Min-Power Broadcast},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_9.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/Calinescu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Yu13a,
author = {Yaoliang Yu},
editor = {Christopher J. C. Burges and
L{\'{e}}on Bottou and
Zoubin Ghahramani and
Kilian Q. Weinberger},
title = {Better Approximation and Faster Algorithm Using the Proximal Average},
booktitle = {Advances in Neural Information Processing Systems 26: 27th Annual
Conference on Neural Information Processing Systems 2013. Proceedings
of a meeting held December 5-8, 2013, Lake Tahoe, Nevada, United States},
pages = {458--466},
year = {2013},
url = {https://proceedings.neurips.cc/paper/2013/hash/49182f81e6a13cf5eaa496d51fea6406-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/Yu13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5871,
author = {Muhammad Marwan Muhammad Fuad and
Pierre{-}Fran{\c{c}}ois Marteau},
title = {Towards a faster symbolic aggregate approximation method},
journal = {CoRR},
volume = {abs/1301.5871},
year = {2013},
url = {http://arxiv.org/abs/1301.5871},
eprinttype = {arXiv},
eprint = {1301.5871},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5871.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6900,
author = {Manuel Schmitt and
Rolf Wanka},
title = {Exploiting Independent Subformulas: {A} Faster Approximation Scheme
for {\#}k-SAT},
journal = {CoRR},
volume = {abs/1302.6900},
year = {2013},
url = {http://arxiv.org/abs/1302.6900},
eprinttype = {arXiv},
eprint = {1302.6900},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6900.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tazari12,
author = {Siamak Tazari},
title = {Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free
graphs},
journal = {Theor. Comput. Sci.},
volume = {417},
pages = {95--107},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.09.014},
doi = {10.1016/J.TCS.2011.09.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tazari12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0752,
author = {Cheng Wang},
title = {Faster Approximation of Max Flow for Directed Graphs},
journal = {CoRR},
volume = {abs/1211.0752},
year = {2012},
url = {http://arxiv.org/abs/1211.0752},
eprinttype = {arXiv},
eprint = {1211.0752},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0752.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-1831,
author = {Shayan Oveis Gharan and
Luca Trevisan},
title = {A New Regularity Lemma and Faster Approximation Algorithms for Low
Threshold Rank Graphs},
journal = {CoRR},
volume = {abs/1212.1831},
year = {2012},
url = {http://arxiv.org/abs/1212.1831},
eprinttype = {arXiv},
eprint = {1212.1831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-1831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nm/DrineasMMS11,
author = {Petros Drineas and
Michael W. Mahoney and
S. Muthukrishnan and
Tam{\'{a}}s Sarl{\'{o}}s},
title = {Faster least squares approximation},
journal = {Numerische Mathematik},
volume = {117},
number = {2},
pages = {219--249},
year = {2011},
url = {https://doi.org/10.1007/s00211-010-0331-6},
doi = {10.1007/S00211-010-0331-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nm/DrineasMMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/JansenPSS11,
author = {Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz and
Ola Svensson},
editor = {Alex Potanin and
Taso Viglas},
title = {Faster Approximation Algorithms for Scheduling with Fixed Jobs},
booktitle = {Seventeenth Computing: The Australasian Theory Symposium, {CATS} 2011,
Perth, Australia, January 2011},
series = {{CRPIT}},
volume = {119},
pages = {3--10},
publisher = {Australian Computer Society},
year = {2011},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV119Jansen.html},
timestamp = {Mon, 08 Feb 2021 13:26:46 +0100},
biburl = {https://dblp.org/rec/conf/cats/JansenPSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristianoKMST11,
author = {Paul F. Christiano and
Jonathan A. Kelner and
Aleksander Madry and
Daniel A. Spielman and
Shang{-}Hua Teng},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Electrical flows, laplacian systems, and faster approximation of maximum
flow in undirected graphs},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {273--282},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993674},
doi = {10.1145/1993636.1993674},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChristianoKMST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Paluch11,
author = {Katarzyna E. Paluch},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Faster and Simpler Approximation of Stable Matchings},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {176--187},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_15},
doi = {10.1007/978-3-642-29116-6\_15},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Paluch11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icsoft/FuadM10,
author = {Muhammad Marwan Muhammad Fuad and
Pierre{-}Fran{\c{c}}ois Marteau},
editor = {Jos{\'{e}} A. Moinhos Cordeiro and
Maria Virvou and
Boris Shishkov},
title = {Towards a Faster Symbolic Aggregate Approximation Method},
booktitle = {{ICSOFT} 2010 - Proceedings of the Fifth International Conference
on Software and Data Technologies, Volume 1, Athens, Greece, July
22-24, 2010},
pages = {305--310},
publisher = {SciTePress},
year = {2010},
timestamp = {Thu, 28 Apr 2011 13:13:21 +0200},
biburl = {https://dblp.org/rec/conf/icsoft/FuadM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Tazari10,
author = {Siamak Tazari},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Faster Approximation Schemes and Parameterized Algorithms on \emph{H}-Minor-Free
and Odd-Minor-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {641--652},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_56},
doi = {10.1007/978-3-642-15155-2\_56},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Tazari10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Madry10,
author = {Aleksander Madry},
editor = {Leonard J. Schulman},
title = {Faster approximation schemes for fractional multicommodity flow problems
via dynamic graph algorithms},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {121--130},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806708},
doi = {10.1145/1806689.1806708},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Madry10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-5907,
author = {Aleksander Madry},
title = {Faster Approximation Schemes for Fractional Multicommodity Flow Problems
via Dynamic Graph Algorithms},
journal = {CoRR},
volume = {abs/1003.5907},
year = {2010},
url = {http://arxiv.org/abs/1003.5907},
eprinttype = {arXiv},
eprint = {1003.5907},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-5907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-3392,
author = {Siamak Tazari},
title = {Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free
and Odd-Minor-Free Graphs},
journal = {CoRR},
volume = {abs/1004.3392},
year = {2010},
url = {http://arxiv.org/abs/1004.3392},
eprinttype = {arXiv},
eprint = {1004.3392},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-3392.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-2921,
author = {Paul F. Christiano and
Jonathan A. Kelner and
Aleksander Madry and
Daniel A. Spielman and
Shang{-}Hua Teng},
title = {Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum
Flow in Undirected Graphs},
journal = {CoRR},
volume = {abs/1010.2921},
year = {2010},
url = {http://arxiv.org/abs/1010.2921},
eprinttype = {arXiv},
eprint = {1010.2921},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-2921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Koulamas09,
author = {Christos Koulamas},
title = {A faster fully polynomial approximation scheme for the single-machine
total tardiness problem},
journal = {Eur. J. Oper. Res.},
volume = {193},
number = {2},
pages = {637--638},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2007.12.031},
doi = {10.1016/J.EJOR.2007.12.031},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Koulamas09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispd/HuLA09,
author = {Shiyan Hu and
Zhuo Li and
Charles J. Alpert},
editor = {Gi{-}Joon Nam and
Prashant Saxena},
title = {A faster approximation scheme for timing driven minimum cost layer
assignment},
booktitle = {Proceedings of the 2009 International Symposium on Physical Design,
{ISPD} 2009, San Diego, California, USA, March 29 - April 1, 2009},
pages = {167--174},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1514932.1514969},
doi = {10.1145/1514932.1514969},
timestamp = {Tue, 06 Nov 2018 11:07:47 +0100},
biburl = {https://dblp.org/rec/conf/ispd/HuLA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-5660,
author = {Katarzyna E. Paluch},
title = {Faster and simpler approximation of stable matchings},
journal = {CoRR},
volume = {abs/0911.5660},
year = {2009},
url = {http://arxiv.org/abs/0911.5660},
eprinttype = {arXiv},
eprint = {0911.5660},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-5660.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ahswn/GfellerV08,
author = {Beat Gfeller and
Elias Vicari},
title = {A Faster Distributed Approximation Scheme for the Connected Dominating
Set Problem for Growth-Bounded Graphs},
journal = {Ad Hoc Sens. Wirel. Networks},
volume = {6},
number = {3-4},
pages = {197--213},
year = {2008},
url = {http://www.oldcitypublishing.com/journals/ahswn-home/ahswn-issue-contents/ahswn-volume-6-number-1-2-2008-2/ahswn-6-3-4-p-197-213/},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ahswn/GfellerV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArcherLW08,
author = {Aaron Archer and
Asaf Levin and
David P. Williamson},
title = {A Faster, Better Approximation Algorithm for the Minimum Latency Problem},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {5},
pages = {1472--1498},
year = {2008},
url = {https://doi.org/10.1137/07068151X},
doi = {10.1137/07068151X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArcherLW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Karakostas08,
author = {George Karakostas},
title = {Faster approximation schemes for fractional multicommodity flow problems},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {13:1--13:17},
year = {2008},
url = {https://doi.org/10.1145/1328911.1328924},
doi = {10.1145/1328911.1328924},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/Karakostas08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiedrichJ07,
author = {Florian Diedrich and
Klaus Jansen},
title = {Faster and simpler approximation algorithms for mixed packing and
covering problems},
journal = {Theor. Comput. Sci.},
volume = {377},
number = {1-3},
pages = {181--204},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.064},
doi = {10.1016/J.TCS.2007.02.064},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiedrichJ07.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}
}
@inproceedings{DBLP:conf/adhoc-now/GfellerV07,
author = {Beat Gfeller and
Elias Vicari},
editor = {Evangelos Kranakis and
Jaroslav Opatrny},
title = {A Faster Distributed Approximation Scheme for the Connected Dominating
Set Problem for Growth-Bounded Graphs},
booktitle = {Ad-Hoc, Mobile, and Wireless Networks, 6th International Conference,
{ADHOC-NOW} 2007, Morelia, Mexico, September 24-26, 2007, Proceeedings},
series = {Lecture Notes in Computer Science},
volume = {4686},
pages = {59--73},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74823-6\_5},
doi = {10.1007/978-3-540-74823-6\_5},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/adhoc-now/GfellerV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanK07,
author = {Piotr Berman and
Shiva Prasad Kasiviswanathan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Faster Approximation of Distances in Graphs},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {541--552},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_47},
doi = {10.1007/978-3-540-73951-7\_47},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0710-1435,
author = {Petros Drineas and
Michael W. Mahoney and
S. Muthukrishnan and
Tam{\'{a}}s Sarl{\'{o}}s},
title = {Faster Least Squares Approximation},
journal = {CoRR},
volume = {abs/0710.1435},
year = {2007},
url = {http://arxiv.org/abs/0710.1435},
eprinttype = {arXiv},
eprint = {0710.1435},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0710-1435.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/jise/HsiehWT06,
author = {Ming{-}I Hsieh and
Eric Hsiao{-}Kuang Wu and
Meng{-}Feng Tsai},
title = {FasterDSP: {A} Faster Approximation Algorithm for Directed Steiner
Tree Problem},
journal = {J. Inf. Sci. Eng.},
volume = {22},
number = {6},
pages = {1409--1425},
year = {2006},
url = {http://www.iis.sinica.edu.tw/page/jise/2006/200611\_07.html},
timestamp = {Fri, 16 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jise/HsiehWT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aspdac/LiSAHS05,
author = {Zhuo Li and
Cliff C. N. Sze and
Charles J. Alpert and
Jiang Hu and
Weiping Shi},
editor = {Tingao Tang},
title = {Making fast buffer insertion even faster via approximation techniques},
booktitle = {Proceedings of the 2005 Conference on Asia South Pacific Design Automation,
{ASP-DAC} 2005, Shanghai, China, January 18-21, 2005},
pages = {13--18},
publisher = {{ACM} Press},
year = {2005},
url = {https://doi.org/10.1145/1120725.1120733},
doi = {10.1145/1120725.1120733},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/aspdac/LiSAHS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GaurK05,
author = {Daya Ram Gaur and
Ramesh Krishnamurti},
title = {Faster approximation algorithms for scheduling tasks with a choice
of start times},
booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry,
CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
pages = {11--14},
year = {2005},
url = {http://www.cccg.ca/proceedings/2005/66.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GaurK05.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/icalp/GairingMW05,
author = {Martin Gairing and
Burkhard Monien and
Andreas Woclaw},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated
Parallel Machines},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {828--839},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_67},
doi = {10.1007/11523468\_67},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GairingMW05.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}
}
@inproceedings{DBLP:conf/swat/Jansen04,
author = {Klaus Jansen},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Approximation Algorithms for the General Max-min Resource Sharing
Problem: Faster and Simpler},
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 = {311--322},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_27},
doi = {10.1007/978-3-540-27810-8\_27},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/DanosD03,
author = {Vincent Danos and
Jos{\'{e}}e Desharnais},
title = {Labelled Markov Processes: Stronger and Faster Approximations},
booktitle = {18th {IEEE} Symposium on Logic in Computer Science {(LICS} 2003),
22-25 June 2003, Ottawa, Canada, Proceedings},
pages = {341--350},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/LICS.2003.1210074},
doi = {10.1109/LICS.2003.1210074},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/DanosD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArcherW03,
author = {Aaron Archer and
David P. Williamson},
title = {Faster approximation algorithms for the minimum latency problem},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {88--96},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644122},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ArcherW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/DanosDP04,
author = {Vincent Danos and
Jos{\'{e}}e Desharnais and
Prakash Panangaden},
editor = {Jos{\'{e}}e Desharnais and
Prakash Panangaden},
title = {Labelled Markov Processes: Stronger and Faster Approximations},
booktitle = {Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic
Processes, {DTMPP} 2003, Barbados, April 21-25, 2003},
series = {Electronic Notes in Theoretical Computer Science},
volume = {87},
pages = {157--203},
publisher = {Elsevier},
year = {2003},
url = {https://doi.org/10.1016/j.entcs.2004.09.018},
doi = {10.1016/J.ENTCS.2004.09.018},
timestamp = {Wed, 07 Dec 2022 09:46:53 +0100},
biburl = {https://dblp.org/rec/journals/entcs/DanosDP04.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}
}
@inproceedings{DBLP:conf/soda/Karakostas02,
author = {George Karakostas},
editor = {David Eppstein},
title = {Faster approximation schemes for fractional multicommodity flow problems},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {166--173},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545402},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Karakostas02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Guitart01,
author = {Pere Guitart},
title = {A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm
for the Steiner Problem in Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {133--136},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00378-6},
doi = {10.1016/S1571-0653(04)00378-6},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Guitart01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/WayneF99,
author = {Kevin D. Wayne and
Lisa Fleischer},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Faster Approximation Algorithms for Generalized Flow},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {981--982},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314959},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/WayneF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Eppstein97,
author = {David Eppstein},
title = {Faster Geometric K-point {MST} Approximation},
journal = {Comput. Geom.},
volume = {8},
pages = {231--240},
year = {1997},
url = {https://doi.org/10.1016/S0925-7721(96)00021-1},
doi = {10.1016/S0925-7721(96)00021-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Eppstein97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FossmeierKZ97,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann and
Alexander Zelikovsky},
title = {Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem},
journal = {Discret. Comput. Geom.},
volume = {18},
number = {1},
pages = {93--109},
year = {1997},
url = {https://doi.org/10.1007/PL00009310},
doi = {10.1007/PL00009310},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FossmeierKZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NutovP97,
author = {Zeev Nutov and
Michal Penn},
title = {Faster approximation algorithms for weighted triconnectivity augmentation
problems},
journal = {Oper. Res. Lett.},
volume = {21},
number = {5},
pages = {219--223},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(97)00045-X},
doi = {10.1016/S0167-6377(97)00045-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/NutovP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Gusfield94,
author = {Dan Gusfield},
title = {Faster Implementation of a Shortest Superstring Approximation},
journal = {Inf. Process. Lett.},
volume = {51},
number = {5},
pages = {271--274},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00097-2},
doi = {10.1016/0020-0190(94)00097-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Gusfield94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KleinPST94,
author = {Philip N. Klein and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos},
title = {Faster Approximation Algorithms for the Unit Capacity Concurrent Flow
Problem with Applications to Routing and Finding Sparse Cuts},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {3},
pages = {466--487},
year = {1994},
url = {https://doi.org/10.1137/S0097539792241175},
doi = {10.1137/S0097539792241175},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KleinPST94.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}
}
@inproceedings{DBLP:conf/isaac/FossmeierKZ93,
author = {Ulrich F{\"{o}}{\ss}meier and
Michael Kaufmann and
Alexander Zelikovsky},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {533--542},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_285},
doi = {10.1007/3-540-57568-5\_285},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FossmeierKZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Floren91,
author = {Rolf Floren},
title = {A Note on "A Faster Approximation Algorithm for the Steiner Problem
in Graphs"},
journal = {Inf. Process. Lett.},
volume = {38},
number = {4},
pages = {177--178},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90096-Z},
doi = {10.1016/0020-0190(91)90096-Z},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Floren91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinST90,
author = {Philip N. Klein and
Clifford Stein and
{\'{E}}va Tardos},
editor = {Harriet Ortiz},
title = {Leighton-Rao Might Be Practical: Faster Approximation Algorithms for
Concurrent Flow with Uniform Capacities},
booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
May 13-17, 1990, Baltimore, Maryland, {USA}},
pages = {310--321},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/100216.100257},
doi = {10.1145/100216.100257},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinST90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Mehlhorn88,
author = {Kurt Mehlhorn},
title = {A Faster Approximation Algorithm for the Steiner Problem in Graphs},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {125--128},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90066-X},
doi = {10.1016/0020-0190(88)90066-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Mehlhorn88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnn/Kolen88,
author = {John F. Kolen},
title = {Faster learning through a probabilistic approximation algorithm},
booktitle = {Proceedings of International Conference on Neural Networks (ICNN'88),
San Diego, CA, USA, July 24-27, 1988},
pages = {449--454},
publisher = {{IEEE}},
year = {1988},
url = {https://doi.org/10.1109/ICNN.1988.23878},
doi = {10.1109/ICNN.1988.23878},
timestamp = {Thu, 15 Aug 2019 17:22:48 +0200},
biburl = {https://dblp.org/rec/conf/icnn/Kolen88.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}
}
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-05 18:33 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:
