Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "approximation algorithm"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/algorithmica/DoerrRW24,
author = {Benjamin Doerr and
Amirhossein Rajabi and
Carsten Witt},
title = {Simulated Annealing is a Polynomial-Time Approximation Scheme for
the Minimum Spanning Tree Problem},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {64--89},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01135-x},
doi = {10.1007/S00453-023-01135-X},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DoerrRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GongCH24,
author = {Mingyang Gong and
Zhi{-}Zhong Chen and
Kuniteru Hayashi},
title = {Approximation Algorithms for Multiprocessor Scheduling with Testing
to Minimize the Total Job Completion Time},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1400--1427},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01198-w},
doi = {10.1007/S00453-023-01198-W},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GongCH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HuangYL24,
author = {Liting Huang and
Wei Yu and
Zhaohui Liu},
title = {Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover
Problem and Its Variants},
journal = {Algorithmica},
volume = {86},
number = {4},
pages = {1135--1162},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01187-z},
doi = {10.1007/S00453-023-01187-Z},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HuangYL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HyattDenesikRS24,
author = {Dylan Hyatt{-}Denesik and
Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
title = {Approximations for Throughput Maximization},
journal = {Algorithmica},
volume = {86},
number = {5},
pages = {1545--1577},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01201-4},
doi = {10.1007/S00453-023-01201-4},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HyattDenesikRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/ChenLGZ24,
author = {Jing Chen and
Yanjun Liu and
Min Gan and
Quanmin Zhu},
title = {Sequential stabilizing spline algorithm for linear systems: Eigenvalue
approximation and polishing},
journal = {Autom.},
volume = {159},
pages = {111313},
year = {2024},
url = {https://doi.org/10.1016/j.automatica.2023.111313},
doi = {10.1016/J.AUTOMATICA.2023.111313},
timestamp = {Wed, 03 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/ChenLGZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cee/LiSSDZ24,
author = {Guangfeng Li and
Jian Sun and
Zhiren Sun and
Donglei Du and
Xiaoyan Zhang},
title = {An approximation algorithm for high-dimensional table compression
on balanced K-partite graph},
journal = {Comput. Electr. Eng.},
volume = {113},
pages = {109048},
year = {2024},
url = {https://doi.org/10.1016/j.compeleceng.2023.109048},
doi = {10.1016/J.COMPELECENG.2023.109048},
timestamp = {Fri, 02 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cee/LiSSDZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/ZhouZS24,
author = {Xianghai Zhou and
Xiaodi Zhang and
Haiyan Su},
title = {Local and parallel finite element algorithms based on charge-conservation
approximation for the stationary inductionless magnetohydrodynamic
problem},
journal = {Comput. Math. Appl.},
volume = {154},
pages = {224--235},
year = {2024},
url = {https://doi.org/10.1016/j.camwa.2023.11.044},
doi = {10.1016/J.CAMWA.2023.11.044},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cma/ZhouZS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/HaPT24,
author = {Dung T. K. Ha and
Canh V. Pham and
Tan D. Tran},
title = {Improved approximation algorithms for k-submodular maximization under
a knapsack constraint},
journal = {Comput. Oper. Res.},
volume = {161},
pages = {106452},
year = {2024},
url = {https://doi.org/10.1016/j.cor.2023.106452},
doi = {10.1016/J.COR.2023.106452},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/HaPT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/DasM24,
author = {Sayani Das and
Sounaka Mishra},
title = {Approximation algorithm for minimum q-dominator partization problem},
journal = {Discret. Math. Algorithms Appl.},
volume = {16},
number = {1},
pages = {2250188:1--2250188:24},
year = {2024},
url = {https://doi.org/10.1142/S1793830922501889},
doi = {10.1142/S1793830922501889},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/DasM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/evi/Zhai24,
author = {Hao Zhai},
title = {A hybrid {GA-FS} algorithm with fuzzy approximation scheme for solving
credibilistic reliability optimization problem},
journal = {Evol. Intell.},
volume = {17},
number = {1},
pages = {151--161},
year = {2024},
url = {https://doi.org/10.1007/s12065-021-00573-2},
doi = {10.1007/S12065-021-00573-2},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/evi/Zhai24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijon/FengCYYW24,
author = {Yuanyuan Feng and
Yi Cao and
Shuanghua Yang and
Lili Yang and
Tangjian Wei},
title = {An approximation algorithm for bus evacuation problem},
journal = {Neurocomputing},
volume = {574},
pages = {127252},
year = {2024},
url = {https://doi.org/10.1016/j.neucom.2024.127252},
doi = {10.1016/J.NEUCOM.2024.127252},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijon/FengCYYW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iotj/AsgarianJB24,
author = {Mina Asgarian and
Kamal Jamshidi and
Ali Bohlooli},
title = {An Efficient Approximation Algorithm for Service Function Chaining
Placement in Edge-Cloud Computing Industrial Internet of Things},
journal = {{IEEE} Internet Things J.},
volume = {11},
number = {7},
pages = {12815--12822},
year = {2024},
url = {https://doi.org/10.1109/JIOT.2023.3338516},
doi = {10.1109/JIOT.2023.3338516},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iotj/AsgarianJB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FominGIK24,
author = {Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Tomohiro Koana},
title = {{FPT} approximation and subexponential algorithms for covering few
or many edges},
journal = {Inf. Process. Lett.},
volume = {185},
pages = {106471},
year = {2024},
url = {https://doi.org/10.1016/j.ipl.2024.106471},
doi = {10.1016/J.IPL.2024.106471},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FominGIK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/PrzybylowiczSS24,
author = {Pawel Przybylowicz and
Verena Schwarz and
Michaela Sz{\"{o}}lgyenyi},
title = {Randomized Milstein algorithm for approximation of solutions of jump-diffusion
SDEs},
journal = {J. Comput. Appl. Math.},
volume = {440},
pages = {115631},
year = {2024},
url = {https://doi.org/10.1016/j.cam.2023.115631},
doi = {10.1016/J.CAM.2023.115631},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcam/PrzybylowiczSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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/mcs/AkiyamaY24,
author = {Naho Akiyama and
Toshihiro Yamada},
title = {A weak approximation for Bismut's formula: An algorithmic differentiation
method},
journal = {Math. Comput. Simul.},
volume = {216},
pages = {386--396},
year = {2024},
url = {https://doi.org/10.1016/j.matcom.2023.09.003},
doi = {10.1016/J.MATCOM.2023.09.003},
timestamp = {Sat, 18 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mcs/AkiyamaY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mcs/HaslingerKMS24,
author = {Jaroslav Haslinger and
Radek Kucera and
Kristina Motyckov{\'{a}} and
V{\'{a}}clav S{\'{a}}tek},
title = {Stokes problem with the Coulomb stick-slip boundary conditions in
3D: Formulations, approximation, algorithms, and experiments},
journal = {Math. Comput. Simul.},
volume = {216},
pages = {145--167},
year = {2024},
url = {https://doi.org/10.1016/j.matcom.2023.08.036},
doi = {10.1016/J.MATCOM.2023.08.036},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mcs/HaslingerKMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlc/XuZS24,
author = {Yi Xu and
Jie Zhang and
Weikang Sun},
title = {Hierarchical algorithm for calculating approximation regions based
on granular computing},
journal = {Int. J. Mach. Learn. Cybern.},
volume = {15},
number = {3},
pages = {985--1005},
year = {2024},
url = {https://doi.org/10.1007/s13042-023-01951-1},
doi = {10.1007/S13042-023-01951-1},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mlc/XuZS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoydCHI24,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Arash Haddadan and
Sharat Ibrahimpur},
title = {Approximation algorithms for flexible graph connectivity},
journal = {Math. Program.},
volume = {204},
number = {1},
pages = {493--516},
year = {2024},
url = {https://doi.org/10.1007/s10107-023-01961-5},
doi = {10.1007/S10107-023-01961-5},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BoydCHI24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/GarciaArdilaM24,
author = {Juan Carlos Garc{\'{\i}}a{-}Ardila and
Misael Enrique Marriaga},
title = {Approximation by polynomials in Sobolev spaces associated with classical
moment functionals},
journal = {Numer. Algorithms},
volume = {95},
number = {1},
pages = {285--318},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01572-3},
doi = {10.1007/S11075-023-01572-3},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/GarciaArdilaM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/KaurM24,
author = {Deepti Kaur and
R. K. Mohanty},
title = {High-order half-step compact numerical approximation for fourth-order
parabolic PDEs},
journal = {Numer. Algorithms},
volume = {95},
number = {3},
pages = {1127--1153},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01602-0},
doi = {10.1007/S11075-023-01602-0},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/KaurM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/KumariGNKC24,
author = {Sudesh Kumari and
Krzysztof Gdawiec and
Ashish Nandal and
Naresh Kumar and
Renu Chugh},
title = {On the viscosity approximation type iterative method and its non-linear
behaviour in the generation of Mandelbrot and Julia sets},
journal = {Numer. Algorithms},
volume = {96},
number = {1},
pages = {211--236},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01644-4},
doi = {10.1007/S11075-023-01644-4},
timestamp = {Sun, 14 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/KumariGNKC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Melman24,
author = {Aaron Melman},
title = {An efficient approximation to the Cauchy radius},
journal = {Numer. Algorithms},
volume = {96},
number = {1},
pages = {1--11},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01636-4},
doi = {10.1007/S11075-023-01636-4},
timestamp = {Sun, 14 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Melman24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/SongR24,
author = {Junpeng Song and
Hongxing Rui},
title = {Reduced-order finite element approximation based on {POD} for the
parabolic optimal control problem},
journal = {Numer. Algorithms},
volume = {95},
number = {3},
pages = {1189--1211},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01605-x},
doi = {10.1007/S11075-023-01605-X},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/SongR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/WangC24,
author = {Yibo Wang and
Wanrong Cao},
title = {Strong 1.5 order scheme for fractional Langevin equation based on
spectral approximation of white noise},
journal = {Numer. Algorithms},
volume = {95},
number = {1},
pages = {423--450},
year = {2024},
url = {https://doi.org/10.1007/s11075-023-01576-z},
doi = {10.1007/S11075-023-01576-Z},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/WangC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/MaoY24,
author = {Xianpeng Mao and
Yuning Yang},
title = {Practical approximation algorithms for {\(\mathscr{l}\)}\({}_{\mbox{1}}\)-regularized
sparse rank-1 approximation to higher-order tensors},
journal = {Optim. Lett.},
volume = {18},
number = {3},
pages = {767--781},
year = {2024},
url = {https://doi.org/10.1007/s11590-023-02032-6},
doi = {10.1007/S11590-023-02032-6},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/MaoY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/PanZ24,
author = {Pengxiang Pan and
Hongtao Zhu},
title = {Approximation algorithms for the restricted k-Chinese postman problems
with penalties},
journal = {Optim. Lett.},
volume = {18},
number = {1},
pages = {307--318},
year = {2024},
url = {https://doi.org/10.1007/s11590-023-01992-z},
doi = {10.1007/S11590-023-01992-Z},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/PanZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JiangLP24,
author = {Xiaojuan Jiang and
Kangbok Lee and
Michael L. Pinedo},
title = {Bicriteria two-machine flowshop scheduling: approximation algorithms
and their limits},
journal = {J. Sched.},
volume = {27},
number = {1},
pages = {61--86},
year = {2024},
url = {https://doi.org/10.1007/s10951-023-00781-x},
doi = {10.1007/S10951-023-00781-X},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/JiangLP24.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/siamdm/BergSS24,
author = {Mark de Berg and
Arpan Sadhukhan and
Frits C. R. Spieksma},
title = {Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {790--827},
year = {2024},
url = {https://doi.org/10.1137/23m1545975},
doi = {10.1137/23M1545975},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BergSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/BogoyaGC24,
author = {Manuel Bogoya and
Sergei M. Grudsky and
Stefano Serra Capizzano},
title = {Fast Non-Hermitian Toeplitz Eigenvalue Computations, Joining Matrixless
Algorithms and {FDE} Approximation Matrices},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {45},
number = {1},
pages = {284--305},
year = {2024},
url = {https://doi.org/10.1137/22m1529920},
doi = {10.1137/22M1529920},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siammax/BogoyaGC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sncs/JohnKLS24,
author = {Rose Rani John and
E. Grace Mary Kanaga and
Jeno Lovesum and
S. G. Sandeep},
title = {An Enhanced Approximation Algorithm Using Red Black Tree and HashMap
for Virtual Machine Placement Problem},
journal = {{SN} Comput. Sci.},
volume = {5},
number = {1},
pages = {153},
year = {2024},
url = {https://doi.org/10.1007/s42979-023-02465-x},
doi = {10.1007/S42979-023-02465-X},
timestamp = {Tue, 23 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sncs/JohnKLS24.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/tcc/Chen24,
author = {Chi{-}Yeh Chen},
title = {Efficient Approximation Algorithms for Scheduling Coflows With Total
Weighted Completion Time in Identical Parallel Networks},
journal = {{IEEE} Trans. Cloud Comput.},
volume = {12},
number = {1},
pages = {116--129},
year = {2024},
url = {https://doi.org/10.1109/TCC.2023.3340729},
doi = {10.1109/TCC.2023.3340729},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcc/Chen24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenDYYZ24,
author = {Shengminjie Chen and
Donglei Du and
Ruiqi Yang and
Wenguo Yang and
Yapu Zhang},
title = {A single factor approximation ratio algorithm for DR-submodular maximization
on integer lattice beyond non-negativity and monotonicity},
journal = {Theor. Comput. Sci.},
volume = {981},
pages = {114254},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114254},
doi = {10.1016/J.TCS.2023.114254},
timestamp = {Fri, 17 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenDYYZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenJWXY24,
author = {Xianrun Chen and
Sai Ji and
Chenchen Wu and
Yicheng Xu and
Yang Yang},
title = {An approximation algorithm for diversity-aware fair \emph{k}-supplier
problem},
journal = {Theor. Comput. Sci.},
volume = {983},
pages = {114305},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114305},
doi = {10.1016/J.TCS.2023.114305},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenJWXY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TangCW24,
author = {Zhongzheng Tang and
Jingwen Chen and
Chenhao Wang},
title = {Greedy+Singleton: An efficient approximation algorithm for \emph{k}-submodular
knapsack maximization},
journal = {Theor. Comput. Sci.},
volume = {984},
pages = {114320},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114320},
doi = {10.1016/J.TCS.2023.114320},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TangCW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WuFW24,
author = {Di Wu and
Qilong Feng and
Jianxin Wang},
title = {Approximation algorithms for fair \emph{k}-median problem without
fairness violation},
journal = {Theor. Comput. Sci.},
volume = {985},
pages = {114332},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114332},
doi = {10.1016/J.TCS.2023.114332},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WuFW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/MahmoodabadiN24,
author = {Zahra Mahmoodabadi and
Mostafa Nouri{-}Baygi},
title = {An approximation algorithm for virtual machine placement in cloud
data centers},
journal = {J. Supercomput.},
volume = {80},
number = {1},
pages = {915--941},
year = {2024},
url = {https://doi.org/10.1007/s11227-023-05505-8},
doi = {10.1007/S11227-023-05505-8},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tjs/MahmoodabadiN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toms/PiazzolaT24,
author = {Chiara Piazzola and
Lorenzo Tamellini},
title = {Algorithm 1040: The Sparse Grids Matlab Kit - a Matlab implementation
of sparse grids for high-dimensional function approximation and uncertainty
quantification},
journal = {{ACM} Trans. Math. Softw.},
volume = {50},
number = {1},
pages = {7:1--7:22},
year = {2024},
url = {https://doi.org/10.1145/3630023},
doi = {10.1145/3630023},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toms/PiazzolaT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ZhangLL24,
author = {Weiguang Zhang and
Jiarong Liang and
Xinyu Liang},
title = {Approximation Algorithms for Computing Virtual Backbones Considering
Routing Costs in Wireless Networks},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {32},
number = {1},
pages = {323--337},
year = {2024},
url = {https://doi.org/10.1109/TNET.2023.3284051},
doi = {10.1109/TNET.2023.3284051},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ton/ZhangLL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/www/PatilP24,
author = {Rahul A. Patil and
Pramod D. Patil},
title = {Efficient approximation and privacy preservation algorithms for real
time online evolving data streams},
journal = {World Wide Web {(WWW)}},
volume = {27},
number = {1},
pages = {5},
year = {2024},
url = {https://doi.org/10.1007/s11280-024-01244-9},
doi = {10.1007/S11280-024-01244-9},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/www/PatilP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/AliYZ24,
author = {Abu Mohammad Hammad Ali and
Boting Yang and
Sandra Zilles},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Approximation Algorithms for Preference Aggregation Using CP-Nets},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {10433--10441},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i9.28911},
doi = {10.1609/AAAI.V38I9.28911},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/AliYZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ChenXXZ24,
author = {Xianrun Chen and
Dachuan Xu and
Yicheng Xu and
Yong Zhang},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Parameterized Approximation Algorithms for Sum of Radii Clustering
and Variants},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {20666--20673},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i18.30053},
doi = {10.1609/AAAI.V38I18.30053},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ChenXXZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BarmanKKN24,
author = {Siddharth Barman and
Anand Krishna and
Pooja Kulkarni and
Shivika Narang},
editor = {Venkatesan Guruswami},
title = {Sublinear Approximation Algorithm for Nash Social Welfare with {XOS}
Valuations},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {8:1--8:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.8},
doi = {10.4230/LIPICS.ITCS.2024.8},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BarmanKKN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GuptaMSS24,
author = {Sushmita Gupta and
Sounak Modak and
Saket Saurabh and
Sanjay Seetharaman},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Quick-Sort Style Approximation Algorithms for Generalizations of Feedback
Vertex Set in Tournaments},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14578},
pages = {225--240},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55598-5\_15},
doi = {10.1007/978-3-031-55598-5\_15},
timestamp = {Wed, 13 Mar 2024 19:10:54 +0100},
biburl = {https://dblp.org/rec/conf/latin/GuptaMSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MandalMRS24,
author = {Soumen Mandal and
Pranabendu Misra and
Ashutosh Rai and
Saket Saurabh},
editor = {Jos{\'{e}} A. Soto and
Andreas Wiese},
title = {Parameterized Approximation Algorithms for Weighted Vertex Cover},
booktitle = {{LATIN} 2024: Theoretical Informatics - 16th Latin American Symposium,
Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14579},
pages = {177--192},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-55601-2\_12},
doi = {10.1007/978-3-031-55601-2\_12},
timestamp = {Wed, 13 Mar 2024 19:10:54 +0100},
biburl = {https://dblp.org/rec/conf/latin/MandalMRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalHRS24,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Rahul Raychaudhury and
Stavros Sintos},
editor = {David P. Woodruff},
title = {Fast Approximation Algorithms for Piercing Boxes by Points},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4892--4908},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.174},
doi = {10.1137/1.9781611977912.174},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/AgarwalHRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrownLPS24,
author = {Adam Brown and
Aditi Laddha and
Madhusudhan Reddy Pittu and
Mohit Singh},
editor = {David P. Woodruff},
title = {Approximation Algorithms for the Weighted Nash Social Welfare via
Convex and Non-Convex Programs},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1307--1327},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.52},
doi = {10.1137/1.9781611977912.52},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BrownLPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchemERW24,
author = {Moritz Buchem and
Katja Ettmayr and
Hugo K. K. Rosado and
Andreas Wiese},
editor = {David P. Woodruff},
title = {A {(3} + {\(\varepsilon\)})-approximation algorithm for the minimum
sum of radii problem with outliers and extensions for generalized
lower bounds},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {1738--1765},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.69},
doi = {10.1137/1.9781611977912.69},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BuchemERW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CslovjecsekPW24,
author = {Jana Cslovjecsek and
Michal Pilipczuk and
Karol Wegrzycki},
editor = {David P. Woodruff},
title = {A polynomial-time OPT\({}^{\mbox{{\(\varepsilon\)}}}\)-approximation
algorithm for maximum independent set of connected subgraphs in a
planar graph},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {625--638},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.23},
doi = {10.1137/1.9781611977912.23},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/CslovjecsekPW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EsmerKMNS24,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
editor = {David P. Woodruff},
title = {Optimally Repurposing Existing Algorithms to Obtain Exponential-Time
Approximations},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {314--345},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.13},
doi = {10.1137/1.9781611977912.13},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EsmerKMNS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KonradN24,
author = {Christian Konrad and
Kheeran K. Naidu},
editor = {David P. Woodruff},
title = {An Unconditional Lower Bound for Two-Pass Streaming Algorithms for
Maximum Matching Approximation},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2881--2899},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.102},
doi = {10.1137/1.9781611977912.102},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KonradN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Quanrud24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SuriyanarayanaSGS24,
author = {Varun Suriyanarayana and
Varun Sivashankar and
Siddharth Gollapudi and
David B. Shmoys},
editor = {David P. Woodruff},
title = {Improved Approximation Algorithms for the Joint Replenishment Problem
with Outliers, and with Fairness Constraints},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2793--2828},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.99},
doi = {10.1137/1.9781611977912.99},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/SuriyanarayanaSGS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ArmbrusterRW24,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
editor = {Merav Parter and
Seth Pettie},
title = {Simpler constant factor approximation algorithms for weighted flow
time - now for any \emph{p}-norm},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {63--81},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.7},
doi = {10.1137/1.9781611977936.7},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/ArmbrusterRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/Assadi24,
author = {Sepehr Assadi},
editor = {Merav Parter and
Seth Pettie},
title = {A Simple {(1} - \emph{{\(\epsilon\)}})-Approximation Semi-Streaming
Algorithm for Maximum (Weighted) Matching},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {337--354},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.31},
doi = {10.1137/1.9781611977936.31},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Assadi24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/JagerW24,
author = {Sven J{\"{a}}ger and
Philipp Warode},
editor = {Merav Parter and
Seth Pettie},
title = {Simple Approximation Algorithms for Minimizing the Total Weighted
Completion Time of Precedence-Constrained Jobs},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {82--96},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.8},
doi = {10.1137/1.9781611977936.8},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/JagerW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/KaluginN24,
author = {Pavel E. Kalugin and
Maksim S. Nikolaev},
editor = {Merav Parter and
Seth Pettie},
title = {The greedy algorithm for the Shortest Common Superstring problem is
a {\textonehalf}-approximation in terms of compression: a simple proof},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {97--99},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.9},
doi = {10.1137/1.9781611977936.9},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/KaluginN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BienkowskiE24,
author = {Marcin Bienkowski and
Guy Even},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.15},
doi = {10.4230/LIPICS.STACS.2024.15},
timestamp = {Mon, 11 Mar 2024 15:43:27 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BienkowskiE24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KowalskaP24,
author = {Katarzyna Anna Kowalska and
Michal Pilipczuk},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {Parameterized and Approximation Algorithms for Coverings Points with
Segments in the Plane},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {47:1--47:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.47},
doi = {10.4230/LIPICS.STACS.2024.47},
timestamp = {Mon, 11 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KowalskaP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/0001024,
author = {Jingyang Zhao and
Mingyu Xiao},
editor = {Ryuhei Uehara and
Katsuhisa Yamanaka and
Hsu{-}Chun Yen},
title = {Improved Approximation Algorithms for Cycle and Path Packings},
booktitle = {{WALCOM:} Algorithms and Computation - 18th International Conference
and Workshops on Algorithms and Computation, {WALCOM} 2024, Kanazawa,
Japan, March 18-20, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14549},
pages = {179--193},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-981-97-0566-5\_14},
doi = {10.1007/978-981-97-0566-5\_14},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/0001024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-00419,
author = {Pierre Berg{\'{e}} and
Mari Chaikovskaia and
Jean{-}Philippe Gayon and
Alain Quilliot},
title = {Approximation algorithms for Job Scheduling with reconfigurable resources},
journal = {CoRR},
volume = {abs/2401.00419},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.00419},
doi = {10.48550/ARXIV.2401.00419},
eprinttype = {arXiv},
eprint = {2401.00419},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-00419.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-02918,
author = {Adam Brown and
Aditi Laddha and
Madhusudhan Reddy Pittu and
Mohit Singh},
title = {Approximation Algorithms for the Weighted Nash Social Welfare via
Convex and Non-Convex Programs},
journal = {CoRR},
volume = {abs/2401.02918},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.02918},
doi = {10.48550/ARXIV.2401.02918},
eprinttype = {arXiv},
eprint = {2401.02918},
timestamp = {Tue, 23 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-02918.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-03588,
author = {Dmytro Mishagli and
Eugene Koskin and
Elena Blokhina},
title = {Gate-Level Statistical Timing Analysis: Exact Solutions, Approximations
and Algorithms},
journal = {CoRR},
volume = {abs/2401.03588},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.03588},
doi = {10.48550/ARXIV.2401.03588},
eprinttype = {arXiv},
eprint = {2401.03588},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-03588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-04249,
author = {Behzad Ghahremani and
Hessam Babaee},
title = {A {DEIM} Tucker Tensor Cross Algorithm and its Application to Dynamical
Low-Rank Approximation},
journal = {CoRR},
volume = {abs/2401.04249},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.04249},
doi = {10.48550/ARXIV.2401.04249},
eprinttype = {arXiv},
eprint = {2401.04249},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-04249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-04638,
author = {Wenkai Dai and
Michael Dinitz and
Klaus{-}Tycho Foerster and
Long Luo and
Stefan Schmid},
title = {Approximation Algorithms for Minimizing Congestion in Demand-Aware
Networks},
journal = {CoRR},
volume = {abs/2401.04638},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.04638},
doi = {10.48550/ARXIV.2401.04638},
eprinttype = {arXiv},
eprint = {2401.04638},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-04638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-05502,
author = {Suhas Thejaswi and
Ameet Gadekar and
Bruno Ordozgoiti and
Aristides Gionis},
title = {Diversity-aware clustering: Computational Complexity and Approximation
Algorithms},
journal = {CoRR},
volume = {abs/2401.05502},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.05502},
doi = {10.48550/ARXIV.2401.05502},
eprinttype = {arXiv},
eprint = {2401.05502},
timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-05502.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-01995,
author = {Xueqing Liu and
Kyra Gan and
Esmaeil Keyvanshokooh and
Susan A. Murphy},
title = {Online Uniform Risk Times Sampling: First Approximation Algorithms,
Learning Augmentation with Full Confidence Interval Integration},
journal = {CoRR},
volume = {abs/2402.01995},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.01995},
doi = {10.48550/ARXIV.2402.01995},
eprinttype = {arXiv},
eprint = {2402.01995},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-01995.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-02917,
author = {Yuya Suzuki and
Toni Karvonen},
title = {Construction of Optimal Algorithms for Function Approximation in Gaussian
Sobolev Spaces},
journal = {CoRR},
volume = {abs/2402.02917},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.02917},
doi = {10.48550/ARXIV.2402.02917},
eprinttype = {arXiv},
eprint = {2402.02917},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-02917.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-05560,
author = {Svein H{\o}gemo},
title = {Tight Approximation Bounds on a Simple Algorithm for Minimum Average
Search Time in Trees},
journal = {CoRR},
volume = {abs/2402.05560},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.05560},
doi = {10.48550/ARXIV.2402.05560},
eprinttype = {arXiv},
eprint = {2402.05560},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-05560.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-06407,
author = {Sushmita Gupta and
Sounak Modak and
Saket Saurabh and
Sanjay Seetharaman},
title = {Quick-Sort Style Approximation Algorithms for Generalizations of Feedback
Vertex Set in Tournaments},
journal = {CoRR},
volume = {abs/2402.06407},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.06407},
doi = {10.48550/ARXIV.2402.06407},
eprinttype = {arXiv},
eprint = {2402.06407},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-06407.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07863,
author = {Tamio{-}Vesa Nakajima and
Stanislav Zivn{\'{y}}},
title = {An approximation algorithm for Maximum DiCut vs. Cut},
journal = {CoRR},
volume = {abs/2402.07863},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07863},
doi = {10.48550/ARXIV.2402.07863},
eprinttype = {arXiv},
eprint = {2402.07863},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07863.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-08216,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {An Improved Approximation Algorithm for Metric Triangle Packing},
journal = {CoRR},
volume = {abs/2402.08216},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.08216},
doi = {10.48550/ARXIV.2402.08216},
eprinttype = {arXiv},
eprint = {2402.08216},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-08216.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-2402-16466,
author = {Katarzyna Anna Kowalska and
Michal Pilipczuk},
title = {Parameterized and approximation algorithms for coverings points with
segments in the plane},
journal = {CoRR},
volume = {abs/2402.16466},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.16466},
doi = {10.48550/ARXIV.2402.16466},
eprinttype = {arXiv},
eprint = {2402.16466},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-16466.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-01778,
author = {Chuanfu Xiao and
Zeyu Li and
Chao Yang},
title = {{HOSCF:} Efficient decoupling algorithms for finding the best rank-one
approximation of higher-order tensors},
journal = {CoRR},
volume = {abs/2403.01778},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.01778},
doi = {10.48550/ARXIV.2403.01778},
eprinttype = {arXiv},
eprint = {2403.01778},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-01778.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-06629,
author = {Felipe S. Abrah{\~{a}}o and
Santiago Hern{\'{a}}ndez{-}Orozco and
Narsis A. Kiani and
Jesper Tegn{\'{e}}r and
Hector Zenil},
title = {Assembly Theory is an approximation to algorithmic complexity based
on {LZ} compression that does not explain selection or evolution},
journal = {CoRR},
volume = {abs/2403.06629},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.06629},
doi = {10.48550/ARXIV.2403.06629},
eprinttype = {arXiv},
eprint = {2403.06629},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-06629.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-08929,
author = {Omar El Housni and
Alfredo Torrico and
Ulysse Hennebelle},
title = {Two-sided Assortment Optimization: Adaptivity Gaps and Approximation
Algorithms},
journal = {CoRR},
volume = {abs/2403.08929},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.08929},
doi = {10.48550/ARXIV.2403.08929},
eprinttype = {arXiv},
eprint = {2403.08929},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-08929.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-10868,
author = {Steven Chaplick and
Martin Frohn and
Steven Kelk and
Johann Lottermoser and
Mat{\'{u}}s Mihal{\'{a}}k},
title = {Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum
Independent Set on Interval and Chordal Graphs},
journal = {CoRR},
volume = {abs/2403.10868},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.10868},
doi = {10.48550/ARXIV.2403.10868},
eprinttype = {arXiv},
eprint = {2403.10868},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-10868.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/corr/abs-2403-12340,
author = {Zhengbang Zhou and
Huanhuan Ma and
Wentiao Wu and
Weiguo Gao and
Jinlong Yang and
Meiyue Shao and
Wei Hu},
title = {A fast low-rank inversion algorithm of dielectric matrix in {GW} approximation},
journal = {CoRR},
volume = {abs/2403.12340},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.12340},
doi = {10.48550/ARXIV.2403.12340},
eprinttype = {arXiv},
eprint = {2403.12340},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-12340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-15547,
author = {Chandra Chekuri and
Rhea Jain},
title = {Approximation Algorithms for Network Design in Non-Uniform Fault Models},
journal = {CoRR},
volume = {abs/2403.15547},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.15547},
doi = {10.48550/ARXIV.2403.15547},
eprinttype = {arXiv},
eprint = {2403.15547},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-15547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-15623,
author = {Santhini K. A. and
Kamesh Munagala and
Meghana Nasre and
Govind S. Sankar},
title = {Approximation Algorithms for School Assignment: Group Fairness and
Multi-criteria Optimization},
journal = {CoRR},
volume = {abs/2403.15623},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.15623},
doi = {10.48550/ARXIV.2403.15623},
eprinttype = {arXiv},
eprint = {2403.15623},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-15623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-16330,
author = {Vladimir Yu. Protasov and
Rinat Kamalov},
title = {Algorithms of constrained uniform approximation},
journal = {CoRR},
volume = {abs/2403.16330},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.16330},
doi = {10.48550/ARXIV.2403.16330},
eprinttype = {arXiv},
eprint = {2403.16330},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-16330.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-18517,
author = {Jeremy E. Cohen and
Valentin Leplat},
title = {Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank
Approximation Models},
journal = {CoRR},
volume = {abs/2403.18517},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.18517},
doi = {10.48550/ARXIV.2403.18517},
eprinttype = {arXiv},
eprint = {2403.18517},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-18517.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Ferme23,
author = {Paul Ferm{\'{e}}},
title = {Approximation Algorithms for Channel Coding and Non-signaling Correlations.
(Algorithmes d'approximation pour le probl{\`{e}}me du codage de canal
et corr{\'{e}}lations non-signalantes)},
school = {{\'{E}}cole normale sup{\'{e}}rieure de Lyon, France},
year = {2023},
url = {https://tel.archives-ouvertes.fr/tel-04472174},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Ferme23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adhoc/KumarM23,
author = {Rohit Kumar and
Joy Chandra Mukherjee},
title = {Approximation algorithms for vehicle-aided periodic data collection
from mobile sensors with obstacle avoidance in WSNs},
journal = {Ad Hoc Networks},
volume = {149},
pages = {103239},
year = {2023},
url = {https://doi.org/10.1016/j.adhoc.2023.103239},
doi = {10.1016/J.ADHOC.2023.103239},
timestamp = {Thu, 24 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adhoc/KumarM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeshpandeP23,
author = {Amit Deshpande and
Rameshwar Pratap},
title = {One-Pass Additive-Error Subset Selection for {\(\mathscr{l}\)} \({}_{\mbox{p}}\)
Subspace Approximation and (k, p)-Clustering},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3144--3167},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01124-0},
doi = {10.1007/S00453-023-01124-0},
timestamp = {Thu, 05 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeshpandeP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeyFNS23,
author = {Sanjana Dey and
Florent Foucaud and
Subhas C. Nandy and
Arunabha Sen},
title = {Complexity and Approximation for Discriminating and Identifying Code
Problems in Geometric Setups},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1850--1882},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01073-0},
doi = {10.1007/S00453-022-01073-0},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DeyFNS23.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 = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalvezGAJKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhanS23,
author = {Arindam Khan and
Eklavya Sharma},
title = {Tight Approximation Algorithms for Geometric Bin Packing with Skewed
Items},
journal = {Algorithmica},
volume = {85},
number = {9},
pages = {2735--2778},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01116-0},
doi = {10.1007/S00453-023-01116-0},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhanS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KimSA23,
author = {Kangsan Kim and
Yongho Shin and
Hyung{-}Chan An},
title = {Constant-Factor Approximation Algorithms for Parity-Constrained Facility
Location and k-Center},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1883--1911},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01060-5},
doi = {10.1007/S00453-022-01060-5},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KimSA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MadireddyM23,
author = {Raghunath Reddy Madireddy and
Apurva Mudgal},
title = {A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with
Unit Disks},
journal = {Algorithmica},
volume = {85},
number = {1},
pages = {100--132},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01012-z},
doi = {10.1007/S00453-022-01012-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MadireddyM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/NefedovTL23,
author = {Nikolay N. Nefedov and
Bogdan Tishchenko and
Natalia Levashova},
title = {An Algorithm for Construction of the Asymptotic Approximation of a
Stable Stationary Solution to a Diffusion Equation System with a Discontinuous
Source Function},
journal = {Algorithms},
volume = {16},
number = {8},
pages = {359},
year = {2023},
url = {https://doi.org/10.3390/a16080359},
doi = {10.3390/A16080359},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/NefedovTL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/XingS23,
author = {Siyuan Xing and
Jian{-}Qiao Sun},
title = {Separable Gaussian Neural Networks: Structure, Analysis, and Function
Approximations},
journal = {Algorithms},
volume = {16},
number = {10},
pages = {453},
year = {2023},
url = {https://doi.org/10.3390/a16100453},
doi = {10.3390/A16100453},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/XingS23.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/apjor/JiLWX23,
author = {Sai Ji and
Jun Li and
Zijun Wu and
Yicheng Xu},
title = {Approximation Algorithms for the Capacitated Min-Max Correlation Clustering
Problem},
journal = {Asia Pac. J. Oper. Res.},
volume = {40},
number = {1},
pages = {2240008:1--2240008:13},
year = {2023},
url = {https://doi.org/10.1142/S0217595922400085},
doi = {10.1142/S0217595922400085},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/JiLWX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/LiY23,
author = {Shiming Li and
Wei Yu},
title = {Approximation Algorithms for the Maximum-Weight Cycle/Path Packing
Problems},
journal = {Asia Pac. J. Oper. Res.},
volume = {40},
number = {4},
pages = {2340003:1--2340003:16},
year = {2023},
url = {https://doi.org/10.1142/S0217595923400031},
doi = {10.1142/S0217595923400031},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/LiY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/TianGXZ23,
author = {Xiaoyun Tian and
Ling Gai and
Yicheng Xu and
Dongmei Zhang},
title = {Approximation Algorithms for Spherical k-Means Problem with Penalties
Using Local Search Techniques},
journal = {Asia Pac. J. Oper. Res.},
volume = {40},
number = {1},
pages = {2240014:1--2240014:16},
year = {2023},
url = {https://doi.org/10.1142/S0217595922400140},
doi = {10.1142/S0217595922400140},
timestamp = {Thu, 20 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/TianGXZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/ZhaoLZL23,
author = {Ao Zhao and
Qian Liu and
Yang Zhou and
Min Li},
title = {Approximation Algorithms for Matroid and Knapsack Means Problems},
journal = {Asia Pac. J. Oper. Res.},
volume = {40},
number = {1},
pages = {2240007:1--2240007:16},
year = {2023},
url = {https://doi.org/10.1142/S0217595922400073},
doi = {10.1142/S0217595922400073},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/ZhaoLZL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/ZhangXL23a,
author = {Zhaorong Zhang and
Juanjuan Xu and
Xun Li},
title = {A distributed stochastic approximation algorithm for stochastic {LQ}
control with unknown uncertainty},
journal = {Autom.},
volume = {151},
pages = {110917},
year = {2023},
url = {https://doi.org/10.1016/j.automatica.2023.110917},
doi = {10.1016/J.AUTOMATICA.2023.110917},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/automatica/ZhangXL23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/axioms/WangW23,
author = {Limin Wang and
Wenqi Wang},
title = {An Approximation Algorithm for a Variant of Dominating Set Problem},
journal = {Axioms},
volume = {12},
number = {6},
pages = {506},
year = {2023},
url = {https://doi.org/10.3390/axioms12060506},
doi = {10.3390/AXIOMS12060506},
timestamp = {Thu, 18 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/axioms/WangW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/JiangTLCJ23,
author = {Yiwei Jiang and
Xuelian Tang and
Kai Li and
T. C. E. Cheng and
Min Ji},
title = {Approximation algorithms for bi-objective parallel-machine scheduling
in green manufacturing},
journal = {Comput. Ind. Eng.},
volume = {176},
pages = {108949},
year = {2023},
url = {https://doi.org/10.1016/j.cie.2022.108949},
doi = {10.1016/J.CIE.2022.108949},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/JiangTLCJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cca/Sekigawa23,
author = {Hiroshi Sekigawa},
title = {An Approximation Algorithm for the Nearest Decomposable Polynomial
in the Hamming Distance},
journal = {{ACM} Commun. Comput. Algebra},
volume = {57},
number = {3},
pages = {119--125},
year = {2023},
url = {https://doi.org/10.1145/3637529.3637532},
doi = {10.1145/3637529.3637532},
timestamp = {Thu, 21 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cca/Sekigawa23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cma/ZhouH23,
author = {Yingcong Zhou and
Tianliang Hou},
title = {Two-grid algorithm of lumped mass finite element approximation for
Allen-Cahn equations},
journal = {Comput. Math. Appl.},
volume = {152},
pages = {46--55},
year = {2023},
url = {https://doi.org/10.1016/j.camwa.2023.10.012},
doi = {10.1016/J.CAMWA.2023.10.012},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cma/ZhouH23.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/AprileDFH23,
author = {Manuel Aprile and
Matthew Drescher and
Samuel Fiorini and
Tony Huynh},
title = {A 7/3-approximation algorithm for feedback vertex set in tournaments
via Sherali-Adams},
journal = {Discret. Appl. Math.},
volume = {337},
pages = {149--160},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.04.016},
doi = {10.1016/J.DAM.2023.04.016},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AprileDFH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BlochHansenSS23,
author = {Andrew Bloch{-}Hansen and
Nasim Samei and
Roberto Solis{-}Oba},
title = {A local search approximation algorithm for the multiway cut problem},
journal = {Discret. Appl. Math.},
volume = {338},
pages = {8--21},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.05.022},
doi = {10.1016/J.DAM.2023.05.022},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BlochHansenSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DasDM23,
author = {Arun Kumar Das and
Sandip Das and
Joydeep Mukherjee},
title = {Approximation algorithms for orthogonal line centers},
journal = {Discret. Appl. Math.},
volume = {338},
pages = {69--76},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.05.014},
doi = {10.1016/J.DAM.2023.05.014},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DasDM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiZ23,
author = {Ke Li and
Zhao Zhang},
title = {Approximation algorithm for (connected) Italian dominating function},
journal = {Discret. Appl. Math.},
volume = {341},
pages = {169--179},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.08.006},
doi = {10.1016/J.DAM.2023.08.006},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LiZ23.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/dmaa/SetyawatiMD23,
author = {Dian Winda Setyawati and
Imam Mukhlash and
Bijan Davvaz},
title = {Application of near approximations in Cayley graphs},
journal = {Discret. Math. Algorithms Appl.},
volume = {15},
number = {8},
pages = {2250180:1--2250180:31},
year = {2023},
url = {https://doi.org/10.1142/S1793830922501804},
doi = {10.1142/S1793830922501804},
timestamp = {Thu, 14 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/SetyawatiMD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dsp/ChenCLCML23,
author = {Zirui Chen and
Alei Chen and
Weijian Liu and
Wenfeng Chen and
Xiaoyan Ma and
Mingjiu Lv},
title = {An improved fast adaptive complex approximation message passing algorithm},
journal = {Digit. Signal Process.},
volume = {137},
pages = {104016},
year = {2023},
url = {https://doi.org/10.1016/j.dsp.2023.104016},
doi = {10.1016/J.DSP.2023.104016},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dsp/ChenCLCML23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/entropy/WangWWS23,
author = {Le Wang and
Huan Wen and
Xucen Wu and
Qingping Song},
title = {Design and Implementation of a Low-Complexity Multi-h {CPM} Receiver
with Linear Phase Approximation Synchronization Algorithm},
journal = {Entropy},
volume = {25},
number = {11},
pages = {1530},
year = {2023},
url = {https://doi.org/10.3390/e25111530},
doi = {10.3390/E25111530},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/entropy/WangWWS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BampisCERT23,
author = {Evripidis Bampis and
Carmine{-}Emanuele Cella and
Bruno Escoffier and
Mila Rocco and
Alexandre Teiller},
title = {Target-based computer-assisted orchestration: Complexity and approximation
algorithms},
journal = {Eur. J. Oper. Res.},
volume = {304},
number = {3},
pages = {926--938},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.05.008},
doi = {10.1016/J.EJOR.2022.05.008},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BampisCERT23.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/LiXX23,
author = {Feng Li and
Shifu Xu and
Zhou Xu},
title = {New exact and approximation algorithms for integrated production and
transportation scheduling with committed delivery due dates and order
acceptance},
journal = {Eur. J. Oper. Res.},
volume = {306},
number = {1},
pages = {127--140},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.07.030},
doi = {10.1016/J.EJOR.2022.07.030},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LiXX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/OuLZ23,
author = {Jinwen Ou and
Lingfa Lu and
Xueling Zhong},
title = {Parallel-batch scheduling with rejection: Structural properties and
approximation algorithms},
journal = {Eur. J. Oper. Res.},
volume = {310},
number = {3},
pages = {1017--1032},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.04.019},
doi = {10.1016/J.EJOR.2023.04.019},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/OuLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/WuL23,
author = {Xiaohu Wu and
Patrick Loiseau},
title = {Efficient approximation algorithms for scheduling moldable tasks},
journal = {Eur. J. Oper. Res.},
volume = {310},
number = {1},
pages = {71--83},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.02.044},
doi = {10.1016/J.EJOR.2023.02.044},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/WuL23.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/eswa/AltarabichiNPM23,
author = {Mohammed Ghaith Altarabichi and
Slawomir Nowaczyk and
Sepideh Pashami and
Peyman Sheikholharam Mashhadi},
title = {Fast Genetic Algorithm for feature selection - {A} qualitative approximation
approach},
journal = {Expert Syst. Appl.},
volume = {211},
pages = {118528},
year = {2023},
url = {https://doi.org/10.1016/j.eswa.2022.118528},
doi = {10.1016/J.ESWA.2022.118528},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eswa/AltarabichiNPM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fcsc/LiuLY23,
author = {Xiaofei Liu and
Weidong Li and
Jinhua Yang},
title = {A primal-dual approximation algorithm for the k-prize-collecting minimum
vertex cover problem with submodular penalties},
journal = {Frontiers Comput. Sci.},
volume = {17},
number = {3},
pages = {173404},
year = {2023},
url = {https://doi.org/10.1007/s11704-022-1665-9},
doi = {10.1007/S11704-022-1665-9},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fcsc/LiuLY23.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/ipl/GuoLW23,
author = {Lifeng Guo and
Changhong Lu and
Guanlin Wu},
title = {Approximation algorithms for a virtual machine allocation problem
with finite types},
journal = {Inf. Process. Lett.},
volume = {180},
pages = {106339},
year = {2023},
url = {https://doi.org/10.1016/j.ipl.2022.106339},
doi = {10.1016/J.IPL.2022.106339},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GuoLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/WangSXGA23,
author = {Hao Wang and
Chaoli Sun and
Gang Xie and
Xiao{-}Zhi Gao and
Farooq Akhtar},
title = {A performance approximation assisted expensive many-objective evolutionary
algorithm},
journal = {Inf. Sci.},
volume = {625},
pages = {20--35},
year = {2023},
url = {https://doi.org/10.1016/j.ins.2023.01.018},
doi = {10.1016/J.INS.2023.01.018},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/WangSXGA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iswa/AlfanoGMT23,
author = {Gianvincenzo Alfano and
Sergio Greco and
Cristian Molinaro and
Irina Trubitsyna},
title = {An approximation algorithm for querying inconsistent knowledge bases},
journal = {Intell. Syst. Appl.},
volume = {17},
pages = {200146},
year = {2023},
url = {https://doi.org/10.1016/j.iswa.2022.200146},
doi = {10.1016/J.ISWA.2022.200146},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iswa/AlfanoGMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jamc/SinghM23,
author = {Abhishek Kumar Singh and
Mani Mehra},
title = {An algorithm to estimate parameter in M{\"{u}}ntz-Legendre polynomial
approximation for the numerical solution of stochastic fractional
integro-differential equation},
journal = {J. Appl. Math. Comput.},
volume = {69},
number = {3},
pages = {2675--2694},
year = {2023},
url = {https://doi.org/10.1007/s12190-023-01850-2},
doi = {10.1007/S12190-023-01850-2},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jamc/SinghM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/JingNCY23,
author = {Jiayin Jing and
Guyan Ni and
Ciwen Chen and
Bo Yang},
title = {Alternate algorithms to most referenced techniques of numerical optimization
to solve the symmetric rank-R approximation problem of symmetric tensors},
journal = {J. Comput. Appl. Math.},
volume = {420},
pages = {114792},
year = {2023},
url = {https://doi.org/10.1016/j.cam.2022.114792},
doi = {10.1016/J.CAM.2022.114792},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcam/JingNCY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/LongH23,
author = {Xian{-}Jun Long and
Yue{-}Hong He},
title = {A fast stochastic approximation-based subgradient extragradient algorithm
with variance reduction for solving stochastic variational inequality
problems},
journal = {J. Comput. Appl. Math.},
volume = {420},
pages = {114786},
year = {2023},
url = {https://doi.org/10.1016/j.cam.2022.114786},
doi = {10.1016/J.CAM.2022.114786},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcam/LongH23.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/jco/Armaselu23,
author = {Bogdan Armaselu},
title = {Approximation algorithms for some extensions of the maximum profit
routing problem},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {26},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00944-0},
doi = {10.1007/S10878-022-00944-0},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Armaselu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CuiDXY23,
author = {Min Cui and
Donglei Du and
Dachuan Xu and
Ruiqi Yang},
title = {Two approximation algorithms for maximizing nonnegative weakly monotonic
set functions},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {54},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00978-4},
doi = {10.1007/S10878-022-00978-4},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CuiDXY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiDDWX23,
author = {Sai Ji and
Yinhong Dong and
Donglei Du and
Dongzhao Wang and
Dachuan Xu},
title = {Approximation algorithms for the lower bounded correlation clustering
problem},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {43},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00976-6},
doi = {10.1007/S10878-022-00976-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiDDWX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiLZZ23,
author = {Sai Ji and
Gaidi Li and
Dongmei Zhang and
Xianzhao Zhang},
title = {Approximation algorithms for the capacitated correlation clustering
problem with penalties},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {12},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00930-6},
doi = {10.1007/S10878-022-00930-6},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/JiLZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KongZF23,
author = {Xiangyan Kong and
Zhen Zhang and
Qilong Feng},
title = {On parameterized approximation algorithms for balanced clustering},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {49},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00980-w},
doi = {10.1007/S10878-022-00980-W},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KongZF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrishnaaLNN23,
author = {Prem Krishnaa and
Girija Limaye and
Meghana Nasre and
Prajakta Nimbhorkar},
title = {Envy-freeness and relaxed stability: hardness and approximation algorithms},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {41},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00963-x},
doi = {10.1007/S10878-022-00963-X},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KrishnaaLNN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiPLCWL23,
author = {Jianping Li and
Pengxiang Pan and
Junran Lichen and
Lijian Cai and
Wencheng Wang and
Suding Liu},
title = {Approximation algorithms for solving the heterogeneous Chinese postman
problem},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {17},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00931-5},
doi = {10.1007/S10878-022-00931-5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiPLCWL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuLLY23,
author = {Xiaofei Liu and
Yajie Li and
Weidong Li and
Jinhua Yang},
title = {Combinatorial approximation algorithms for the maximum bounded connected
bipartition problem},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {51},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00981-9},
doi = {10.1007/S10878-022-00981-9},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuLLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OliveiraAJFDD23,
author = {Andre Rodrigues Oliveira and
Alexsandro Oliveira Alexandrino and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
title = {Approximation algorithms for sorting by k-cuts on signed permutations},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {6},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00937-z},
doi = {10.1007/S10878-022-00937-Z},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/OliveiraAJFDD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunYL23,
author = {Yuhui Sun and
Wei Yu and
Zhaohui Liu},
title = {Approximation algorithms for some min-max and minimum stacker crane
cover problems},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {18},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00955-x},
doi = {10.1007/S10878-022-00955-X},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SunYL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangGHL23,
author = {Jiaxuan Zhang and
Suogang Gao and
Bo Hou and
Wen Liu},
title = {An approximation algorithm for the clustered path travelling salesman
problem},
journal = {J. Comb. Optim.},
volume = {45},
number = {4},
pages = {104},
year = {2023},
url = {https://doi.org/10.1007/s10878-023-01029-2},
doi = {10.1007/S10878-023-01029-2},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangGHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangYXL23,
author = {Li Zhang and
Jing Yuan and
Zhizhen Xu and
Qiaoliang Li},
title = {A combinatorial approximation algorithm for k-level facility location
problem with submodular penalties},
journal = {J. Comb. Optim.},
volume = {46},
number = {1},
pages = {5},
year = {2023},
url = {https://doi.org/10.1007/s10878-023-01067-w},
doi = {10.1007/S10878-023-01067-W},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangYXL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EinarsonGJMW23,
author = {Carl Einarson and
Gregory Z. Gutin and
Bart M. P. Jansen and
Diptapriyo Majumdar and
Magnus Wahlstr{\"{o}}m},
title = {\emph{p}-Edge/vertex-connected vertex cover: Parameterized and approximation
algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {133},
pages = {23--40},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.11.002},
doi = {10.1016/J.JCSS.2022.11.002},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EinarsonGJMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/CheWX23,
author = {Maolin Che and
Yiming 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 = {Sun, 17 Dec 2023 00:00:00 +0100},
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/jgo/OlamaCM23,
author = {Alireza Olama and
Eduardo Camponogara and
Paulo Renato da Costa Mendes},
title = {Distributed primal outer approximation algorithm for sparse convex
programming with separable structures},
journal = {J. Glob. Optim.},
volume = {86},
number = {3},
pages = {637--670},
year = {2023},
url = {https://doi.org/10.1007/s10898-022-01266-5},
doi = {10.1007/S10898-022-01266-5},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/OlamaCM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/ZhangGLH23,
author = {Bo Zhang and
Yuelin Gao and
Xia Liu and
XiaoLi Huang},
title = {Outcome-space branch-and-bound outer approximation algorithm for a
class of non-convex quadratic programming problems},
journal = {J. Glob. Optim.},
volume = {86},
number = {1},
pages = {61--92},
year = {2023},
url = {https://doi.org/10.1007/s10898-022-01255-8},
doi = {10.1007/S10898-022-01255-8},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/ZhangGLH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jim/ZerrouguiAM23,
author = {Raouf Zerrougui and
Amel B. H. Adamou{-}Mitiche and
Lahc{\`{e}}ne Mitiche},
title = {A novel machine learning algorithm for interval systems approximation
based on artificial neural network},
journal = {J. Intell. Manuf.},
volume = {34},
number = {5},
pages = {2171--2184},
year = {2023},
url = {https://doi.org/10.1007/s10845-021-01874-0},
doi = {10.1007/S10845-021-01874-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jim/ZerrouguiAM23.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/mcma/ZhangM23,
author = {Bolong Zhang and
Michael Mascagni},
title = {Pass-efficient randomized {LU} algorithms for computing low-rank matrix
approximation},
journal = {Monte Carlo Methods Appl.},
volume = {29},
number = {3},
pages = {181--202},
year = {2023},
url = {https://doi.org/10.1515/mcma-2023-2012},
doi = {10.1515/MCMA-2023-2012},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mcma/ZhangM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/AkagiMKKT23,
author = {Yasunori Akagi and
Naoki Marumo and
Hideaki Kim and
Takeshi Kurashima and
Hiroyuki Toda},
title = {{MAP} inference algorithms without approximation for collective graphical
models on path graphs via discrete difference of convex algorithm},
journal = {Mach. Learn.},
volume = {112},
number = {1},
pages = {99--129},
year = {2023},
url = {https://doi.org/10.1007/s10994-022-06275-9},
doi = {10.1007/S10994-022-06275-9},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/AkagiMKKT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/ShanksYJ23,
author = {Meghan Shanks and
Ge Yu and
Sheldon H. Jacobson},
title = {Approximation algorithms for stochastic online matching with reusable
resources},
journal = {Math. Methods Oper. Res.},
volume = {98},
number = {1},
pages = {43--56},
year = {2023},
url = {https://doi.org/10.1007/s00186-023-00822-3},
doi = {10.1007/S00186-023-00822-3},
timestamp = {Mon, 23 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/ShanksYJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Yu23,
author = {Wei Yu},
title = {Improved approximation algorithms for some min-max postmen cover problems
with applications to the min-max subtree cover},
journal = {Math. Methods Oper. Res.},
volume = {97},
number = {1},
pages = {135--157},
year = {2023},
url = {https://doi.org/10.1007/s00186-022-00807-8},
doi = {10.1007/S00186-022-00807-8},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/Yu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/ShengLN23,
author = {Zhou Sheng and
Jianze Li and
Qin Ni},
title = {Jacobi-type algorithms for homogeneous polynomial optimization on
Stiefel manifolds with applications to tensor approximations},
journal = {Math. Comput.},
volume = {92},
number = {343},
pages = {2217--2245},
year = {2023},
url = {https://doi.org/10.1090/mcom/3834},
doi = {10.1090/MCOM/3834},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/ShengLN23.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/FaenzaSZ23,
author = {Yuri Faenza and
Danny Segev and
Lingyi Zhang},
title = {Approximation algorithms for the generalized incremental knapsack
problem},
journal = {Math. Program.},
volume = {198},
number = {1},
pages = {27--83},
year = {2023},
url = {https://doi.org/10.1007/s10107-021-01755-7},
doi = {10.1007/S10107-021-01755-7},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/FaenzaSZ23.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/mp/Pia23a,
author = {Alberto Del Pia},
title = {An approximation algorithm for indefinite mixed integer quadratic
programming},
journal = {Math. Program.},
volume = {201},
number = {1},
pages = {263--293},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01907-3},
doi = {10.1007/S10107-022-01907-3},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Pia23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/AndersonBV23,
author = {Thomas G. Anderson and
Marc Bonnet and
Shravan K. Veerapaneni},
title = {Quantifying mixing in arbitrary fluid domains: a Pad{\'{e}} approximation
approach},
journal = {Numer. Algorithms},
volume = {93},
number = {1},
pages = {441--458},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01423-7},
doi = {10.1007/S11075-022-01423-7},
timestamp = {Fri, 21 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/AndersonBV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/BentbibGJR23,
author = {Abdeslem Hafid Bentbib and
M. El Ghomari and
Khalide Jbilou and
Lothar Reichel},
title = {The global Golub-Kahan method and Gauss quadrature for tensor function
approximation},
journal = {Numer. Algorithms},
volume = {92},
number = {1},
pages = {5--34},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01392-x},
doi = {10.1007/S11075-022-01392-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/BentbibGJR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/BultheelD23,
author = {Adhemar Bultheel and
Carlos D{\'{\i}}az{-}Mendoza},
title = {Two-point Pad{\'{e}} approximation to Herglotz-Riesz transforms},
journal = {Numer. Algorithms},
volume = {92},
number = {1},
pages = {269--299},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01467-9},
doi = {10.1007/S11075-022-01467-9},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/BultheelD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Fazzi23,
author = {Antonio Fazzi},
title = {Structured low-rank approximation for nonlinear matrices},
journal = {Numer. Algorithms},
volume = {93},
number = {4},
pages = {1561--1580},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01479-5},
doi = {10.1007/S11075-022-01479-5},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Fazzi23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/GeorgievaH23,
author = {Irina Georgieva and
Clemens Hofreither},
title = {A Newton method for best uniform rational approximation},
journal = {Numer. Algorithms},
volume = {93},
number = {4},
pages = {1741--1758},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01487-5},
doi = {10.1007/S11075-022-01487-5},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/GeorgievaH23.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/na/KastnerR23,
author = {Felix Kastner and
Andreas R{\"{o}}{\ss}ler},
title = {An analysis of approximation algorithms for iterated stochastic integrals
and a Julia and Matlab simulation toolbox},
journal = {Numer. Algorithms},
volume = {93},
number = {1},
pages = {27--66},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01401-z},
doi = {10.1007/S11075-022-01401-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/KastnerR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/LeiGL23,
author = {Ziyi Lei and
Siqing Gan and
Jing Liu},
title = {First order strong approximation of Ait-Sahalia-type interest rate
model with Poisson jumps},
journal = {Numer. Algorithms},
volume = {94},
number = {1},
pages = {93--130},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01494-6},
doi = {10.1007/S11075-022-01494-6},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/LeiGL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/LiXX23,
author = {Shiru Li and
Yong Xia and
Zi Xu},
title = {Simultaneous perturbation stochastic approximation: towards one-measurement
per iteration},
journal = {Numer. Algorithms},
volume = {94},
number = {3},
pages = {1085--1101},
year = {2023},
url = {https://doi.org/10.1007/s11075-023-01528-7},
doi = {10.1007/S11075-023-01528-7},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/LiXX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/MachRB23,
author = {Thomas Mach and
Lothar Reichel and
Marc Van Barel},
title = {Adaptive cross approximation for Tikhonov regularization in general
form},
journal = {Numer. Algorithms},
volume = {92},
number = {1},
pages = {815--830},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01395-8},
doi = {10.1007/S11075-022-01395-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/MachRB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/MirzaeiS23,
author = {Davoud Mirzaei and
Navid Soodbakhsh},
title = {A fault detection method based on partition of unity and kernel approximation},
journal = {Numer. Algorithms},
volume = {93},
number = {4},
pages = {1759--1794},
year = {2023},
url = {https://doi.org/10.1007/s11075-022-01488-4},
doi = {10.1007/S11075-022-01488-4},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/MirzaeiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Zhang23,
author = {Xiaolong Zhang},
title = {Comparisons of best approximations with Chebyshev expansions for functions
with logarithmic endpoint singularities},
journal = {Numer. Algorithms},
volume = {94},
number = {3},
pages = {1355--1379},
year = {2023},
url = {https://doi.org/10.1007/s11075-023-01538-5},
doi = {10.1007/S11075-023-01538-5},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Zhang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/ZhouLCW23,
author = {Zhaojie Zhou and
Jie Liu and
Yanping Chen and
Qiming Wang},
title = {Finite element approximation of optimal control problem with integral
fractional Laplacian and state constraint},
journal = {Numer. Algorithms},
volume = {94},
number = {4},
pages = {1983--2004},
year = {2023},
url = {https://doi.org/10.1007/s11075-023-01561-6},
doi = {10.1007/S11075-023-01561-6},
timestamp = {Mon, 27 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/ZhouLCW23.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/oms/KeskinU23,
author = {Irem Nur Keskin and
Firdevs Ulus},
title = {Outer approximation algorithms for convex vector optimization problems},
journal = {Optim. Methods Softw.},
volume = {38},
number = {4},
pages = {723--755},
year = {2023},
url = {https://doi.org/10.1080/10556788.2023.2167994},
doi = {10.1080/10556788.2023.2167994},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/KeskinU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Elbassioni23,
author = {Khaled Elbassioni},
title = {A bicriteria approximation algorithm for the minimum hitting set problem
in measurable range spaces},
journal = {Oper. Res. Lett.},
volume = {51},
number = {5},
pages = {507--514},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.07.005},
doi = {10.1016/J.ORL.2023.07.005},
timestamp = {Sun, 24 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Elbassioni23.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/quantum/King23,
author = {Robbie King},
title = {An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free
Graphs},
journal = {Quantum},
volume = {7},
pages = {1180},
year = {2023},
url = {https://doi.org/10.22331/q-2023-11-09-1180},
doi = {10.22331/Q-2023-11-09-1180},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/quantum/King23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/ChengYZQ23,
author = {Bayi Cheng and
Haimei Yuan and
Mi Zhou and
Tan Qi},
title = {Approximation algorithms for scheduling single batch machine with
incompatible deteriorating jobs},
journal = {{RAIRO} Oper. Res.},
volume = {57},
number = {3},
pages = {1267--1284},
year = {2023},
url = {https://doi.org/10.1051/ro/2023045},
doi = {10.1051/RO/2023045},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/ChengYZQ23.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/scheduling/ChaiLNC23,
author = {Xing Chai and
Wenhua Li and
C. T. Ng and
T. C. E. Cheng},
title = {Approximation algorithms for batch scheduling with processing set
restrictions},
journal = {J. Sched.},
volume = {26},
number = {6},
pages = {523--533},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00720-2},
doi = {10.1007/S10951-022-00720-2},
timestamp = {Mon, 18 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ChaiLNC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/WangHZB23,
author = {Yinling Wang and
Xin Han and
Yong Zhang and
Jacek Blazewicz},
title = {An improved approximation algorithm for a scheduling problem with
transporter coordination},
journal = {J. Sched.},
volume = {26},
number = {6},
pages = {559--570},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00762-6},
doi = {10.1007/S10951-022-00762-6},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/WangHZB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/WuJZZ23,
author = {Fangfang Wu and
Zhongyi Jiang and
Run Zhang and
Xiandong Zhang},
title = {Approximation algorithms for scheduling monotonic moldable tasks on
multiple platforms},
journal = {J. Sched.},
volume = {26},
number = {4},
pages = {383--398},
year = {2023},
url = {https://doi.org/10.1007/s10951-022-00774-2},
doi = {10.1007/S10951-022-00774-2},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/WuJZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BatraGK23,
author = {Jatin Batra and
Naveen Garg and
Amit Kumar},
title = {Constant Factor Approximation Algorithm for Weighted Flow-Time on
a Single Machine in PseudoPolynomial Time},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {6},
pages = {S18--158},
year = {2023},
url = {https://doi.org/10.1137/19m1244512},
doi = {10.1137/19M1244512},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BatraGK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharyaHNW23,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Xiaowei Wu},
title = {Deterministic Near-Optimal Approximation Algorithms for Dynamic Set
Cover},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {5},
pages = {1132--1192},
year = {2023},
url = {https://doi.org/10.1137/21m1428649},
doi = {10.1137/21M1428649},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHNW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CheriyanCDZ23,
author = {Joseph Cheriyan and
Robert Cummings and
Jack Dippel and
Jasper Zhu},
title = {An Improved Approximation Algorithm for the Matching Augmentation
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {1},
pages = {163--190},
year = {2023},
url = {https://doi.org/10.1137/21m1453505},
doi = {10.1137/21M1453505},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/CheriyanCDZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HelmuthLPRW23,
author = {Tyler Helmuth and
Holden Lee and
Will Perkins and
Mohan Ravichandran and
Qiang Wu},
title = {Approximation Algorithms for the Random Field Ising Model},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {3},
pages = {1610--1629},
year = {2023},
url = {https://doi.org/10.1137/21m1467389},
doi = {10.1137/21M1467389},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HelmuthLPRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/AraratTU23,
author = {{\c{C}}agin Ararat and
Simay Tekg{\"{u}}l and
Firdevs Ulus},
title = {Geometric Duality Results and Approximation Algorithms for Convex
Vector Optimization Problems},
journal = {{SIAM} J. Optim.},
volume = {33},
number = {1},
pages = {116--146},
year = {2023},
url = {https://doi.org/10.1137/21m1458788},
doi = {10.1137/21M1458788},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamjo/AraratTU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/RodriguezC23,
author = {Ana Alonso Rodr{\'{\i}}guez and
Jessika Cama{\~{n}}o},
title = {A Graph-Based Algorithm for the Approximation of the Spectrum of the
Curl Operator},
journal = {{SIAM} J. Sci. Comput.},
volume = {45},
number = {1},
pages = {147},
year = {2023},
url = {https://doi.org/10.1137/21m1460557},
doi = {10.1137/21M1460557},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/RodriguezC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/simpra/BadicaP23,
author = {Costin Badica and
Alexandru Popa},
title = {Exact and approximation algorithms for synthesizing specific classes
of optimal block-structured processes},
journal = {Simul. Model. Pract. Theory},
volume = {127},
pages = {102777},
year = {2023},
url = {https://doi.org/10.1016/j.simpat.2023.102777},
doi = {10.1016/J.SIMPAT.2023.102777},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/simpra/BadicaP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/soco/ChenPLW23,
author = {Xiyue Chen and
Jing Pan and
Bin Li and
Qingzhu Wang},
title = {An evolutionary algorithm based on rank-1 approximation for sparse
large-scale multi-objective problems},
journal = {Soft Comput.},
volume = {27},
number = {21},
pages = {15853--15871},
year = {2023},
url = {https://doi.org/10.1007/s00500-023-08825-2},
doi = {10.1007/S00500-023-08825-2},
timestamp = {Sat, 23 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/ChenPLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spl/ShentuLWC23,
author = {Xuanyue Shentu and
Xiaoping Lai and
Tianlei Wang and
Jiuwen Cao},
title = {Efficient ADMM-Based Algorithm for Regularized Minimax Approximation},
journal = {{IEEE} Signal Process. Lett.},
volume = {30},
pages = {210--214},
year = {2023},
url = {https://doi.org/10.1109/LSP.2023.3253053},
doi = {10.1109/LSP.2023.3253053},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spl/ShentuLWC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/swevo/NasehiMoghaddamFA23,
author = {Saeed NasehiMoghaddam and
Mohammad Fathian and
Babak Amiri},
title = {Alternate Solutions for Influence Maximization: Beyond theoretical
approximation by the Genetic Algorithm Framework},
journal = {Swarm Evol. Comput.},
volume = {83},
pages = {101424},
year = {2023},
url = {https://doi.org/10.1016/j.swevo.2023.101424},
doi = {10.1016/J.SWEVO.2023.101424},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/swevo/NasehiMoghaddamFA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/LiuLJYL23,
author = {Yanxiu Liu and
Ye Li and
Sheng Jiang and
Xin Ye and
Guoyi Liu},
title = {Approximation Algorithm for X-ray Imaging Optimization of High-Absorption
Ratio Materials},
journal = {Symmetry},
volume = {15},
number = {1},
pages = {44},
year = {2023},
url = {https://doi.org/10.3390/sym15010044},
doi = {10.3390/SYM15010044},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/symmetry/LiuLJYL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/symmetry/WangYPX23,
author = {Guoxin Wang and
Shengwei Yao and
Mingyang Pei and
Jieqiong Xu},
title = {A Three-Dimensional Subspace Algorithm Based on the Symmetry of the
Approximation Model and {WYL} Conjugate Gradient Method},
journal = {Symmetry},
volume = {15},
number = {6},
pages = {1207},
year = {2023},
url = {https://doi.org/10.3390/sym15061207},
doi = {10.3390/SYM15061207},
timestamp = {Thu, 06 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/symmetry/WangYPX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tac/FengZ23,
author = {Wenhui Feng and
Shixin Zhao},
title = {Tracking Control for Nonlinear Nonparametric Systems Based on the
Stochastic Approximation Algorithm},
journal = {{IEEE} Trans. Autom. Control.},
volume = {68},
number = {1},
pages = {230--241},
year = {2023},
url = {https://doi.org/10.1109/TAC.2021.3138701},
doi = {10.1109/TAC.2021.3138701},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tac/FengZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/taes/CaiWLLYH23,
author = {Jiong Cai and
Rui Wang and
Muyang Li and
Sheng Liu and
Yujia Yan and
Cheng Hu},
title = {An Efficient Threshold Determination Algorithm for {DP-TBD} Based
on Structural Analogy and Saddle-Point Approximation},
journal = {{IEEE} Trans. Aerosp. Electron. Syst.},
volume = {59},
number = {6},
pages = {8263--8281},
year = {2023},
url = {https://doi.org/10.1109/TAES.2023.3301458},
doi = {10.1109/TAES.2023.3301458},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/taes/CaiWLLYH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannCD23,
author = {Karl Bringmann and
Vincent Cohen{-}Addad and
Debarati Das},
title = {A Linear-Time \emph{n}\({}^{\mbox{0.4}}\)-Approximation for Longest
Common Subsequence},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {1},
pages = {9:1--9:24},
year = {2023},
url = {https://doi.org/10.1145/3568398},
doi = {10.1145/3568398},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BringmannCD23.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/tcns/ZhaoLH23,
author = {You Zhao and
Xiaofeng Liao and
Xing He},
title = {Accelerated Projection Algorithm Based on Smoothing Approximation
for Distributed Nonsmooth Optimization},
journal = {{IEEE} Trans. Control. Netw. Syst.},
volume = {10},
number = {4},
pages = {1682--1694},
year = {2023},
url = {https://doi.org/10.1109/TCNS.2023.3237496},
doi = {10.1109/TCNS.2023.3237496},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcns/ZhaoLH23.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/tcs/LiZ23,
author = {Jiangkun Li and
Peng Zhang},
title = {New approximation algorithms for the rooted Budgeted Cycle Cover problem},
journal = {Theor. Comput. Sci.},
volume = {940},
number = {Part},
pages = {283--295},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.009},
doi = {10.1016/J.TCS.2022.11.009},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SunGLSZ23,
author = {Jian Sun and
Gregory Z. Gutin and
Ping Li and
Peihao Shi and
Xiaoyan Zhang},
title = {An LP-based approximation algorithm for the generalized traveling
salesman path problem},
journal = {Theor. Comput. Sci.},
volume = {941},
pages = {180--190},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.013},
doi = {10.1016/J.TCS.2022.11.013},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/SunGLSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangFHW23,
author = {Zhen Zhang and
Qilong Feng and
Junyu Huang and
Jianxin Wang},
title = {Improved approximation algorithms for solving the squared metric \emph{k}-facility
location problem},
journal = {Theor. Comput. Sci.},
volume = {942},
pages = {107--122},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.027},
doi = {10.1016/J.TCS.2022.11.027},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangFHW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangZCCW23,
author = {An Zhang and
Liang Zhang and
Yong Chen and
Guangting Chen and
Xing Wang},
title = {Complexity and approximation algorithms for two parallel dedicated
machine scheduling with conflict constraints},
journal = {Theor. Comput. Sci.},
volume = {941},
pages = {167--179},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.11.012},
doi = {10.1016/J.TCS.2022.11.012},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangZCCW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZouGHL23,
author = {Wenjie Zou and
Longkun Guo and
Chunlin Hao and
Lei Liu},
title = {Approximation algorithm for MinSum linear barrier coverage with sink-based
mobile sensors on the plane},
journal = {Theor. Comput. Sci.},
volume = {941},
pages = {121--130},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.10.046},
doi = {10.1016/J.TCS.2022.10.046},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZouGHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tecs/AhmedDHPAT23,
author = {Soyed Tuhin Ahmed and
Kamal Danouchi and
Michael Hefenbrock and
Guillaume Prenat and
Lorena Anghel and
Mehdi B. Tahoori},
title = {SpinBayes: Algorithm-Hardware Co-Design for Uncertainty Estimation
Using Bayesian In-Memory Approximation on Spintronic-Based Architectures},
journal = {{ACM} Trans. Embed. Comput. Syst.},
volume = {22},
number = {5s},
pages = {131:1--131:25},
year = {2023},
url = {https://doi.org/10.1145/3609116},
doi = {10.1145/3609116},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tecs/AhmedDHPAT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tgrs/YangYLZ23,
author = {Yaming Yang and
Xingyao Yin and
Kun Li and
Yongjian Zeng},
title = {A Linearized Alternating Direction Method of Multipliers Algorithm
for Prestack Seismic Inversion in {VTI} Media Using the Quadratic
PP-Reflectivity Approximation},
journal = {{IEEE} Trans. Geosci. Remote. Sens.},
volume = {61},
pages = {1--18},
year = {2023},
url = {https://doi.org/10.1109/TGRS.2023.3267734},
doi = {10.1109/TGRS.2023.3267734},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tgrs/YangYLZ23.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}
}
@article{DBLP:journals/tnn/Iiduka23,
author = {Hideaki Iiduka},
title = {{\unicode{1013}}-Approximation of Adaptive Leaning Rate Optimization
Algorithms for Constrained Nonconvex Stochastic Optimization},
journal = {{IEEE} Trans. Neural Networks Learn. Syst.},
volume = {34},
number = {10},
pages = {8108--8115},
year = {2023},
url = {https://doi.org/10.1109/TNNLS.2022.3142726},
doi = {10.1109/TNNLS.2022.3142726},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnn/Iiduka23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/XuXWLJXZWC23,
author = {Wenzheng Xu and
Hongbin Xie and
Chenxi Wang and
Weifa Liang and
Xiaohua Jia and
Zichuan Xu and
Pan Zhou and
Weigang Wu and
Xiang Chen},
title = {An Approximation Algorithm for the h-Hop Independently Submodular
Maximization Problem and Its Applications},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {31},
number = {3},
pages = {1216--1229},
year = {2023},
url = {https://doi.org/10.1109/TNET.2022.3210825},
doi = {10.1109/TNET.2022.3210825},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/XuXWLJXZWC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/WagenaarFF23,
author = {Joris Camiel Wagenaar and
Ioannis Fragkos and
W. L. C. Faro},
title = {Transportation Asset Acquisition under a Newsvendor Model with Cutting-Stock
Restrictions: Approximation and Decomposition Algorithms},
journal = {Transp. Sci.},
volume = {57},
number = {3},
pages = {778--795},
year = {2023},
url = {https://doi.org/10.1287/trsc.2023.1201},
doi = {10.1287/TRSC.2023.1201},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/WagenaarFF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HanakaK0KKO23,
author = {Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {A Framework to Design Approximation Algorithms for Finding Diverse
Solutions in Combinatorial Problems},
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 = {3968--3976},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i4.25511},
doi = {10.1609/AAAI.V37I4.25511},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HanakaK0KKO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HikimaAKA23,
author = {Yuya Hikima and
Yasunori Akagi and
Hideaki Kim and
Taichi Asami},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {An Improved Approximation Algorithm for Wage Determination and Online
Task Allocation in Crowd-Sourcing},
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 = {3977--3986},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i4.25512},
doi = {10.1609/AAAI.V37I4.25512},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HikimaAKA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acit4/Petryshyn23,
author = {Lubomyr B. Petryshyn},
title = {Model and Algorithm for Accelerated Analog-to-Digital Conversion based
on the Additive Successive Approximation Method},
booktitle = {13th International Conference on Advanced Computer Information Technologies,
{ACIT} 2023, Wroc{\l}aw, Poland, September 21-23, 2023},
pages = {464--467},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ACIT58437.2023.10275579},
doi = {10.1109/ACIT58437.2023.10275579},
timestamp = {Thu, 26 Oct 2023 17:26:34 +0200},
biburl = {https://dblp.org/rec/conf/acit4/Petryshyn23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aina/GheisariRH23,
author = {Soheila Gheisari and
Alireza Rezaee and
Farshid Hajati},
editor = {Leonard Barolli},
title = {Co-evolution Genetic Algorithm Approximation Technique for ROM-Less
Digital Synthesizers},
booktitle = {Advanced Information Networking and Applications - Proceedings of
the 37th International Conference on Advanced Information Networking
and Applications (AINA-2023), Juiz de Fora, Brazil, 29-31 March 2023,
Volume 3},
series = {Lecture Notes in Networks and Systems},
volume = {655},
pages = {573--584},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-28694-0\_54},
doi = {10.1007/978-3-031-28694-0\_54},
timestamp = {Thu, 16 Mar 2023 10:36:01 +0100},
biburl = {https://dblp.org/rec/conf/aina/GheisariRH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/SpoerhaseKROG23,
author = {Joachim Spoerhase and
Kamyar Khodamoradi and
Benedikt Riegel and
Bruno Ordozgoiti and
Aristides Gionis},
editor = {Francisco J. R. Ruiz and
Jennifer G. Dy and
Jan{-}Willem van de Meent},
title = {A Constant-Factor Approximation Algorithm for Reconciliation k-Median},
booktitle = {International Conference on Artificial Intelligence and Statistics,
25-27 April 2023, Palau de Congressos, Valencia, Spain},
series = {Proceedings of Machine Learning Research},
volume = {206},
pages = {1719--1746},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v206/spoerhase23a.html},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aistats/SpoerhaseKROG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BajpaiC23,
author = {Tanvi Bajpai and
Chandra Chekuri},
editor = {Nicole Megow and
Adam D. Smith},
title = {Bicriteria Approximation Algorithms for Priority Matroid Median},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {7:1--7:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.7},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.7},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/BajpaiC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BergSS23,
author = {Mark de Berg and
Arpan Sadhukhan and
Frits C. R. Spieksma},
editor = {Nicole Megow and
Adam D. Smith},
title = {Stable Approximation Algorithms for Dominating Set and Independent
Set},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {27:1--27:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.27},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.27},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BergSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BlockiGMZ23,
author = {Jeremiah Blocki and
Elena Grigorescu and
Tamalika Mukherjee and
Samson Zhou},
editor = {Nicole Megow and
Adam D. Smith},
title = {How to Make Your Approximation Algorithm Private: {A} Black-Box Differentially-Private
Transformation for Tunable Approximation Algorithms of Functions with
Low Sensitivity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {59:1--59:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.59},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.59},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BlockiGMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DurrMW23,
author = {Anita D{\"{u}}rr and
Nicolas El Maalouly and
Lasse Wulf},
editor = {Nicole Megow and
Adam D. Smith},
title = {An Approximation Algorithm for the Exact Matching Problem in Bipartite
Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {18:1--18:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.18},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.18},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DurrMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GrigorescuKL23,
author = {Elena Grigorescu and
Nithish Kumar and
Young{-}San Lin},
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation Algorithms for Directed Weighted Spanners},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {8:1--8:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.8},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.8},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/GrigorescuKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KarakostasK23,
author = {George Karakostas and
Stavros G. Kolliopoulos},
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation Algorithms for Maximum Weighted Throughput on Unrelated
Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {5:1--5:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.5},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.5},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KarakostasK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LieskovskySF23,
author = {Matej Lieskovsk{\'{y}} and
Jir{\'{\i}} Sgall and
Andreas Emil Feldmann},
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation Algorithms and Lower Bounds for Graph Burning},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {9:1--9:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.9},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LieskovskySF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apsipa/ArakawaSSO23,
author = {Takahiko Arakawa and
Yuya Sato and
Hitoshi Sakano and
Tetsushi Ohki},
title = {Development of a Robust Ear Recognition Algorithm using Planar Approximation},
booktitle = {Asia Pacific Signal and Information Processing Association Annual
Summit and Conference, {APSIPA} {ASC} 2023, Taipei, Taiwan, October
31 - Nov. 3, 2023},
pages = {1811--1815},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/APSIPAASC58517.2023.10317234},
doi = {10.1109/APSIPAASC58517.2023.10317234},
timestamp = {Sat, 02 Dec 2023 14:05:45 +0100},
biburl = {https://dblp.org/rec/conf/apsipa/ArakawaSSO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/Gan0023,
author = {Jiarui Gan and
Bo Li and
Xiaowei Wu},
editor = {Noa Agmon and
Bo An and
Alessandro Ricci and
William Yeoh},
title = {Approximation Algorithm for Computing Budget-Feasible {EF1} Allocations},
booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} 2023, London, United Kingdom, 29 May
2023 - 2 June 2023},
pages = {170--178},
publisher = {{ACM}},
year = {2023},
url = {https://dl.acm.org/doi/10.5555/3545946.3598634},
doi = {10.5555/3545946.3598634},
timestamp = {Tue, 23 May 2023 14:27:14 +0200},
biburl = {https://dblp.org/rec/conf/atal/Gan0023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibm/SunJZ23,
author = {Chengcheng Sun and
Haitao Jiang and
Daming Zhu},
editor = {Xingpeng Jiang and
Haiying Wang and
Reda Alhajj and
Xiaohua Hu and
Felix Engel and
Mufti Mahmud and
Nadia Pisanti and
Xuefeng Cui and
Hong Song},
title = {Improved Approximation Algorithms for Sorting Unsigned Genomes by
Reversals},
booktitle = {{IEEE} International Conference on Bioinformatics and Biomedicine,
{BIBM} 2023, Istanbul, Turkiye, December 5-8, 2023},
pages = {36--42},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/BIBM58861.2023.10385794},
doi = {10.1109/BIBM58861.2023.10385794},
timestamp = {Thu, 14 Mar 2024 16:59:09 +0100},
biburl = {https://dblp.org/rec/conf/bibm/SunJZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biocas/Nasiri0Z23,
author = {Hamed Nasiri and
Cheng Li and
Lihong Zhang},
title = {A Successive Approximation Algorithm with Machine Learning for {ECG}
Signals},
booktitle = {{IEEE} Biomedical Circuits and Systems Conference, BioCAS 2023, Toronto,
ON, Canada, October 19-21, 2023},
pages = {1--5},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/BioCAS58349.2023.10388629},
doi = {10.1109/BIOCAS58349.2023.10388629},
timestamp = {Thu, 08 Feb 2024 15:34:19 +0100},
biburl = {https://dblp.org/rec/conf/biocas/Nasiri0Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/camsap/AbryCFP23,
author = {Patrice Abry and
Juliette Chevallier and
Gersende Fort and
Barbara Pascal},
title = {Pandemic Intensity Estimation from Stochastic Approximation-Based
Algorithms},
booktitle = {9th {IEEE} International Workshop on Computational Advances in Multi-Sensor
Adaptive Processing, {CAMSAP} 2023, Herradura, Costa Rica, December
10-13, 2023},
pages = {356--360},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/CAMSAP58249.2023.10403431},
doi = {10.1109/CAMSAP58249.2023.10403431},
timestamp = {Wed, 28 Feb 2024 00:17:42 +0100},
biburl = {https://dblp.org/rec/conf/camsap/AbryCFP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdc/SuL0023,
author = {Junyan Su and
Qiulin Lin and
Minghua Chen and
Haibo Zeng},
title = {Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness
and Approximation Algorithm},
booktitle = {62nd {IEEE} Conference on Decision and Control, {CDC} 2023, Singapore,
December 13-15, 2023},
pages = {7773--7778},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/CDC49753.2023.10383852},
doi = {10.1109/CDC49753.2023.10383852},
timestamp = {Mon, 29 Jan 2024 17:30:32 +0100},
biburl = {https://dblp.org/rec/conf/cdc/SuL0023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Nutov23,
author = {Zeev Nutov},
editor = {Gianluca Della Vedova and
Besik Dundua and
Steffen Lempp and
Florin Manea},
title = {An {\textdollar}O({\textbackslash}sqrt\{k\}){\textdollar}-Approximation
Algorithm for Minimum Power k Edge Disjoint st-Paths},
booktitle = {Unity of Logic and Computation - 19th Conference on Computability
in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13967},
pages = {287--296},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-36978-0\_23},
doi = {10.1007/978-3-031-36978-0\_23},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/Nutov23.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}
}
@inproceedings{DBLP:conf/cocoa/GongCLW23,
author = {Mingyang Gong and
Zhi{-}Zhong Chen and
Guohui Lin and
Lusheng Wang},
editor = {Weili Wu and
Jianxiong Guo},
title = {An Approximation Algorithm for Covering Vertices by 4\({}^{\mbox{+}}\)-Paths},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {459--470},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_33},
doi = {10.1007/978-3-031-49611-0\_33},
timestamp = {Thu, 04 Jan 2024 08:13:46 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/GongCLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LiuYLG23,
author = {Minqin Liu and
Wei Yu and
Zhaohui Liu and
Xinmeng Guo},
editor = {Weili Wu and
Jianxiong Guo},
title = {Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling
with Handling Time and Time Span Constraints},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {129--140},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_9},
doi = {10.1007/978-3-031-49611-0\_9},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/LiuYLG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/TangCWWJ23,
author = {Zhongzheng Tang and
Jingwen Chen and
Chenhao Wang and
Tian Wang and
Weijia Jia},
editor = {Weili Wu and
Jianxiong Guo},
title = {Greedy+Max: An Efficient Approximation Algorithm for k-Submodular
Knapsack Maximization},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {287--299},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_21},
doi = {10.1007/978-3-031-49611-0\_21},
timestamp = {Sat, 09 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/TangCWWJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZhangHLGC23,
author = {Jiale Zhang and
Xiuqi Huang and
Zifeng Liu and
Xiaofeng Gao and
Guihai Chen},
editor = {Weili Wu and
Jianxiong Guo},
title = {Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {380--391},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_27},
doi = {10.1007/978-3-031-49611-0\_27},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/ZhangHLGC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZhangZGWGL23,
author = {Kaiqi Zhang and
Siyuan Zhang and
Jirun Gao and
Hongzhi Wang and
Hong Gao and
Jianzhong Li},
editor = {Weili Wu and
Jianxiong Guo},
title = {A Novel Approximation Algorithm for Max-Covering Circle Problem},
booktitle = {Combinatorial Optimization and Applications - 17th International Conference,
{COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14461},
pages = {226--238},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49611-0\_16},
doi = {10.1007/978-3-031-49611-0\_16},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/ZhangZGWGL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ZhaoX23,
author = {Jingyang Zhao and
Mingyu Xiao},
editor = {Weili Wu and
Guangmo Tong},
title = {Improved Approximation Algorithms for Multidepot Capacitated Vehicle
Routing},
booktitle = {Computing and Combinatorics - 29th International Conference, {COCOON}
2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14423},
pages = {378--391},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49193-1\_29},
doi = {10.1007/978-3-031-49193-1\_29},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/ZhaoX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/QiQ23,
author = {Benjamin Qi and
Richard Qi},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {New Approximation Algorithms for Touring Regions},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {54:1--54:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.54},
doi = {10.4230/LIPICS.SOCG.2023.54},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/QiQ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/complexnetworks/Pozo23,
author = {Roldan Pozo},
editor = {Hocine Cherifi and
Luis M. Rocha and
Chantal Cherifi and
Murat Donduran},
title = {Approximation Algorithms for k-Median Problems on Complex Networks:
Theory and Practice},
booktitle = {Complex Networks {\&} Their Applications {XII} - Proceedings of
The Twelfth International Conference on Complex Networks and their
Applications: {COMPLEX} {NETWORKS} 2023, Menton, France, 28-30 November,
2023, Volume 3},
series = {Studies in Computational Intelligence},
volume = {1143},
pages = {89--101},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-53472-0\_8},
doi = {10.1007/978-3-031-53472-0\_8},
timestamp = {Mon, 15 Apr 2024 15:50:21 +0200},
biburl = {https://dblp.org/rec/conf/complexnetworks/Pozo23.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 = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/AsahiroEG0LMOT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csonet/PhamPH23,
author = {Canh V. Pham and
Quat V. Phu and
Dung T. K. Ha},
editor = {Minh Ho{\`{a}}ng H{\`{a}} and
Xingquan Zhu and
My T. Thai},
title = {Fast Bicriteria Approximation Algorithm for Minimum Cost Submodular
Cover Problem},
booktitle = {Computational Data and Social Networks - 12th International Conference,
CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14479},
pages = {186--197},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-981-97-0669-3\_18},
doi = {10.1007/978-981-97-0669-3\_18},
timestamp = {Mon, 11 Mar 2024 15:20:45 +0100},
biburl = {https://dblp.org/rec/conf/csonet/PhamPH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/data/HoseinMM23,
author = {Patrick Hosein and
Kris Manohar and
Ken Manohar},
editor = {Oleg Gusikhin and
Slimane Hammoudi and
Alfredo Cuzzocrea},
title = {A Successive Quadratic Approximation Approach for Tuning Parameters
in a Previously Proposed Regression Algorithm},
booktitle = {Proceedings of the 12th International Conference on Data Science,
Technology and Applications, {DATA} 2023, Rome, Italy, July 11-13,
2023},
pages = {629--633},
publisher = {{SCITEPRESS}},
year = {2023},
url = {https://doi.org/10.5220/0012148900003541},
doi = {10.5220/0012148900003541},
timestamp = {Mon, 31 Jul 2023 15:42:50 +0200},
biburl = {https://dblp.org/rec/conf/data/HoseinMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CarlsonJMMS23,
author = {Charlie Carlson and
Jafar Jafarov and
Konstantin Makarychev and
Yury Makarychev and
Liren Shan},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Approximation Algorithm for Norm Multiway Cut},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.32},
doi = {10.4230/LIPICS.ESA.2023.32},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/CarlsonJMMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GriesbachHKS23,
author = {Svenja M. Griesbach and
Felix Hommelsheim and
Max Klimm and
Kevin Schewior},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {Improved Approximation Algorithms for the Expanding Search Problem},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {54:1--54:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.54},
doi = {10.4230/LIPICS.ESA.2023.54},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GriesbachHKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KatzelnickP0S23,
author = {Dor Katzelnick and
Aditya Pillai and
Roy Schwartz and
Mohit Singh},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {An Improved Approximation Algorithm for the Max-3-Section Problem},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {69:1--69:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.69},
doi = {10.4230/LIPICS.ESA.2023.69},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KatzelnickP0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/KanasR23,
author = {Tomasz Kanas and
Krzysztof Rzadca},
editor = {Jos{\'{e}} Cano and
Marios D. Dikaiakos and
George A. Papadopoulos and
Miquel Peric{\`{a}}s and
Rizos Sakellariou},
title = {A Poisson-Based Approximation Algorithm for Stochastic Bin Packing
of Bernoulli Items},
booktitle = {Euro-Par 2023: Parallel Processing - 29th International Conference
on Parallel and Distributed Computing, Limassol, Cyprus, August 28
- September 1, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14100},
pages = {96--110},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-39698-4\_7},
doi = {10.1007/978-3-031-39698-4\_7},
timestamp = {Tue, 12 Sep 2023 07:57:22 +0200},
biburl = {https://dblp.org/rec/conf/europar/KanasR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/LiLZL23,
author = {YuYing Li and
Min Li and
Yang Zhou and
Qian Liu},
editor = {Minming Li and
Xiaoming Sun and
Xiaowei Wu},
title = {Random Approximation Algorithms for Monotone k-Submodular Function
Maximization with Size Constraints},
booktitle = {Frontiers of Algorithmics - 17th International Joint Conference, {IJTCS-FAW}
2023 Macau, China, August 14-18, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13933},
pages = {116--128},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-39344-0\_9},
doi = {10.1007/978-3-031-39344-0\_9},
timestamp = {Wed, 30 Aug 2023 14:45:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/LiLZL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/Zhong23,
author = {Zhixian Zhong},
editor = {Minming Li and
Xiaoming Sun and
Xiaowei Wu},
title = {Additive Approximation Algorithms for Sliding Puzzle},
booktitle = {Frontiers of Algorithmics - 17th International Joint Conference, {IJTCS-FAW}
2023 Macau, China, August 14-18, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13933},
pages = {129--146},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-39344-0\_10},
doi = {10.1007/978-3-031-39344-0\_10},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/Zhong23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrowneKMP23,
author = {Reilly Browne and
Prahlad Narasimhan Kasthurirangan and
Joseph S. B. Mitchell and
Valentin Polishchuk},
title = {Constant-Factor Approximation Algorithms for Convex Cover and Hidden
Set in a Simple Polygon},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1357--1365},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00083},
doi = {10.1109/FOCS57990.2023.00083},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrowneKMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DidimoFGIKS23,
author = {Walter Didimo and
Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Stephen G. Kobourov and
Marie Diana Sieper},
editor = {Michael A. Bekos and
Markus Chimani},
title = {Parameterized and Approximation Algorithms for the Maximum Bimodal
Subgraph Problem},
booktitle = {Graph Drawing and Network Visualization - 31st International Symposium,
{GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
Revised Selected Papers, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {14466},
pages = {189--202},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49275-4\_13},
doi = {10.1007/978-3-031-49275-4\_13},
timestamp = {Sat, 10 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/DidimoFGIKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/AltarabichiNPM23,
author = {Mohammed Ghaith Altarabichi and
Slawomir Nowaczyk and
Sepideh Pashami and
Peyman Sheikholharam Mashhadi},
editor = {Sara Silva and
Lu{\'{\i}}s Paquete},
title = {Fast Genetic Algorithm for feature selection - {A} qualitative approximation
approach},
booktitle = {Companion Proceedings of the Conference on Genetic and Evolutionary
Computation, {GECCO} 2023, Companion Volume, Lisbon, Portugal, July
15-19, 2023},
pages = {11--12},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583133.3595823},
doi = {10.1145/3583133.3595823},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gecco/AltarabichiNPM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/healthcom/ZhuLY23,
author = {Yongqi Zhu and
Nan Liu and
Qing Yang},
title = {A New Approximation Algorithm for Genomic Scaffold Filling Based on
Contig},
booktitle = {{IEEE} International Conference on E-health Networking, Application
{\&} Services, Healthcom 2023, Chongqing, China, December 15-17,
2023},
pages = {72--77},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/Healthcom56612.2023.10472402},
doi = {10.1109/HEALTHCOM56612.2023.10472402},
timestamp = {Wed, 10 Apr 2024 17:02:55 +0200},
biburl = {https://dblp.org/rec/conf/healthcom/ZhuLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BansalCGI23,
author = {Ishan Bansal and
Joseph Cheriyan and
Logan Grout and
Sharat Ibrahimpur},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Improved Approximation Algorithms by Generalizing the Primal-Dual
Method Beyond Uncrossable Functions},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.15},
doi = {10.4230/LIPICS.ICALP.2023.15},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BansalCGI23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BarmanK23,
author = {Siddharth Barman and
Pooja Kulkarni},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Approximation Algorithms for Envy-Free Cake Division with Connected
Pieces},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.16},
doi = {10.4230/LIPICS.ICALP.2023.16},
timestamp = {Wed, 05 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BarmanK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bergamaschi23,
author = {Thiago Bergamaschi},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Improved Product-State Approximation Algorithms for Quantum Local
Hamiltonians},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {20:1--20:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.20},
doi = {10.4230/LIPICS.ICALP.2023.20},
timestamp = {Wed, 05 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Bergamaschi23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriJ23,
author = {Chandra Chekuri and
Rhea Jain},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Approximation Algorithms for Network Design in Non-Uniform Fault Models},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {36:1--36:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.36},
doi = {10.4230/LIPICS.ICALP.2023.36},
timestamp = {Wed, 05 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Karlin23,
author = {Anna R. Karlin},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {A (Slightly) Improved Approximation Algorithm for the Metric Traveling
Salesperson Problem (Invited Talk)},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.1},
doi = {10.4230/LIPICS.ICALP.2023.1},
timestamp = {Wed, 05 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Karlin23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/0004M23,
author = {Rohit Kumar and
Joy Chandra Mukherjee},
title = {An Approximation Algorithm for Path Planning of Vehicles for Data
Collection in Wireless Rechargeable Sensor Networks},
booktitle = {24th International Conference on Distributed Computing and Networking,
{ICDCN} 2023, Kharagpur, India, January 4-7, 2023},
pages = {207--216},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3571306.3571405},
doi = {10.1145/3571306.3571405},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcn/0004M23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/Jana023,
author = {Saswata Jana and
Partha Sarathi Mandal},
title = {Approximation Algorithms for Drone Delivery Packing Problem},
booktitle = {24th International Conference on Distributed Computing and Networking,
{ICDCN} 2023, Kharagpur, India, January 4-7, 2023},
pages = {262--269},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3571306.3571411},
doi = {10.1145/3571306.3571411},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcn/Jana023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/Nguyen-TangA23,
author = {Thanh Nguyen{-}Tang and
Raman Arora},
title = {VIPeR: Provably Efficient Algorithm for Offline {RL} with Neural Function
Approximation},
booktitle = {The Eleventh International Conference on Learning Representations,
{ICLR} 2023, Kigali, Rwanda, May 1-5, 2023},
publisher = {OpenReview.net},
year = {2023},
url = {https://openreview.net/pdf?id=WOquZTLCBO1},
timestamp = {Fri, 30 Jun 2023 14:38:38 +0200},
biburl = {https://dblp.org/rec/conf/iclr/Nguyen-TangA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/HotegniMV23,
author = {S{\`{e}}djro Salomon Hotegni and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Approximation Algorithms for Fair Range Clustering},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {13270--13284},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/hotegni23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/HotegniMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Veldt23,
author = {Nate Veldt},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Optimal {LP} Rounding and Linear-Time Approximation Algorithms for
Clustering Edge-Colored Hypergraphs},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {34924--34951},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/veldt23a.html},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Veldt23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/VelingkerVWZ23,
author = {Ameya Velingker and
Maximilian V{\"{o}}tsch and
David P. Woodruff and
Samson Zhou},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Fast (1+{\(\epsilon\)})-Approximation Algorithms for Binary Matrix
Factorization},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {34952--34977},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/velingker23a.html},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/VelingkerVWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/DuttaWTS23,
author = {Shamak Dutta and
Nils Wilde and
Pratap Tokekar and
Stephen L. Smith},
title = {Approximation Algorithms for Robot Tours in Random Fields with Guaranteed
Estimation Accuracy},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2023, London, UK, May 29 - June 2, 2023},
pages = {7830--7836},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICRA48891.2023.10160912},
doi = {10.1109/ICRA48891.2023.10160912},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icra/DuttaWTS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icstcc/OrtmannO23,
author = {Jan Ortmann and
Mathis Ortmann},
editor = {Radu{-}Emil Precup},
title = {A Measurement based Predictive Maintenance Algorithm for Rigid-Body
Dynamical Systems using Radial Basis Function Approximation and Information
Theory},
booktitle = {27th International Conference on System Theory, Control and Computing,
{ICSTCC} 2023, Timisoara, Romania, October 11-13, 2023},
pages = {461--466},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICSTCC59206.2023.10308438},
doi = {10.1109/ICSTCC59206.2023.10308438},
timestamp = {Fri, 24 Nov 2023 20:33:23 +0100},
biburl = {https://dblp.org/rec/conf/icstcc/OrtmannO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/PengX0X23,
author = {Tao Peng and
Yulin Xue and
Jun Li and
Jianhua Xu},
title = {A Novel Label Selection Algorithm Based on Principal Component Analysis
and Sparse Approximation Solution for Multi-label Classification},
booktitle = {35th {IEEE} International Conference on Tools with Artificial Intelligence,
{ICTAI} 2023, Atlanta, GA, USA, November 6-8, 2023},
pages = {532--537},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICTAI59109.2023.00085},
doi = {10.1109/ICTAI59109.2023.00085},
timestamp = {Tue, 09 Jan 2024 16:43:57 +0100},
biburl = {https://dblp.org/rec/conf/ictai/PengX0X23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iiaiaai/MaedaI23,
author = {Kosuke Maeda and
Koji Iwanuma},
title = {An {\unicode{1013}}-Approximation On-line Algorithm for Quantiles
Based on Counters},
booktitle = {14th {IIAI} International Congress on Advanced Applied Informatics,
{IIAI-AAI} 2023, Koriyama, Japan, July 8-13, 2023},
pages = {721--724},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/IIAI-AAI59060.2023.00150},
doi = {10.1109/IIAI-AAI59060.2023.00150},
timestamp = {Thu, 18 Jan 2024 08:27:12 +0100},
biburl = {https://dblp.org/rec/conf/iiaiaai/MaedaI23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/PhamT0T23,
author = {Canh V. Pham and
Tan D. Tran and
Dung K. T. Ha and
My T. Thai},
title = {Linear Query Approximation Algorithms for Non-monotone Submodular
Maximization under Knapsack Constraint},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {4127--4135},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/459},
doi = {10.24963/IJCAI.2023/459},
timestamp = {Thu, 08 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/PhamT0T23.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 = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001M023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JinKW23,
author = {Billy Jin and
Nathan Klein and
David P. Williamson},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances
of the {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 = {217--230},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_16},
doi = {10.1007/978-3-031-32726-1\_16},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JinKW23.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 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KarlinKG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/DutotFPS23,
author = {Pierre{-}Fran{\c{c}}ois Dutot and
Yeu{-}Shin Fu and
Nikhil Prasad and
Oliver Sinnen},
title = {A Guaranteed Approximation Algorithm for Scheduling Fork-Joins with
Communication Delay},
booktitle = {{IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2023, St. Petersburg, FL, USA, May 15-19, 2023},
pages = {820--830},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/IPDPS54959.2023.00087},
doi = {10.1109/IPDPS54959.2023.00087},
timestamp = {Tue, 25 Jul 2023 16:27:14 +0200},
biburl = {https://dblp.org/rec/conf/ipps/DutotFPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iros/0001S23,
author = {Tanmoy Kundu and
Indranil Saha},
title = {Approximation Algorithms for Charging Station Placement for Mobile
Robots},
booktitle = {{IROS}},
pages = {4770--4776},
year = {2023},
url = {https://doi.org/10.1109/IROS55552.2023.10341361},
doi = {10.1109/IROS55552.2023.10341361},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iros/0001S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001N23,
author = {Yusuke Kobayashi and
Takashi Noguchi},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {An Approximation Algorithm for Two-Edge-Connected Subgraph Problem
via Triangle-Free Two-Edge-Cover},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {49:1--49:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.49},
doi = {10.4230/LIPICS.ISAAC.2023.49},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0001N23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Kao23,
author = {Mong{-}Jen Kao},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {Improved Approximation Algorithm for Capacitated Facility Location
with Uniform Facility Cost},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.45},
doi = {10.4230/LIPICS.ISAAC.2023.45},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Kao23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Dondi023,
author = {Riccardo Dondi and
Alexandru Popa},
editor = {Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms},
booktitle = {Combinatorial Algorithms - 34th International Workshop, {IWOCA} 2023,
Tainan, Taiwan, June 7-10, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13889},
pages = {173--184},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34347-6\_15},
doi = {10.1007/978-3-031-34347-6\_15},
timestamp = {Mon, 26 Jun 2023 15:55:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/Dondi023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ChenK23,
author = {Yixin Chen and
Alan Kuhnle},
editor = {Ambuj K. Singh and
Yizhou Sun and
Leman Akoglu and
Dimitrios Gunopulos and
Xifeng Yan and
Ravi Kumar and
Fatma Ozcan and
Jieping Ye},
title = {Approximation Algorithms for Size-Constrained Non-Monotone Submodular
Maximization in Deterministic Linear Time},
booktitle = {Proceedings of the 29th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, {KDD} 2023, Long Beach, CA, USA, August 6-10, 2023},
pages = {250--261},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580305.3599259},
doi = {10.1145/3580305.3599259},
timestamp = {Mon, 25 Sep 2023 08:29:22 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ChenK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ZhangY0X023,
author = {Shiqi Zhang and
Renchi Yang and
Jing Tang and
Xiaokui Xiao and
Bo Tang},
editor = {Ambuj K. Singh and
Yizhou Sun and
Leman Akoglu and
Dimitrios Gunopulos and
Xifeng Yan and
Ravi Kumar and
Fatma Ozcan and
Jieping Ye},
title = {Efficient Approximation Algorithms for Spanning Centrality},
booktitle = {Proceedings of the 29th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, {KDD} 2023, Long Beach, CA, USA, August 6-10, 2023},
pages = {3386--3395},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580305.3599323},
doi = {10.1145/3580305.3599323},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ZhangY0X023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/DakhlJA23,
author = {Abdesselem Dakhli and
Maher Jebali and
Chokri Ben Amar},
editor = {George A. Tsihrintzis and
Carlos Toro and
Sebasti{\'{a}}n A. R{\'{\i}}os and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Approximation of functions by a wavelet neural network built using
a hybrid approach based on the genetic algorithm and the Gram-Schmidt
Selection method},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 27th International Conference KES-2023, Athens,
Greece, 6-8 September 2023},
series = {Procedia Computer Science},
volume = {225},
pages = {1083--1093},
publisher = {Elsevier},
year = {2023},
url = {https://doi.org/10.1016/j.procs.2023.10.096},
doi = {10.1016/J.PROCS.2023.10.096},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kes/DakhlJA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kse/HaPTH23,
author = {Dung K. T. Ha and
Canh V. Pham and
Tan D. Tran and
Huan X. Hoang},
editor = {Huynh Thi Thanh Binh and
Van{-}Thuc Hoang and
Le{-}Minh Nguyen and
SyVinh Le and
Thi{-}Dao Vu and
Duy Trung Pham},
title = {Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization
Under a Knapsack Constraint},
booktitle = {15th International Conference on Knowledge and Systems Engineering,
{KSE} 2023, Hanoi, Vietnam, October 18-20, 2023},
pages = {1--6},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/KSE59128.2023.10299445},
doi = {10.1109/KSE59128.2023.10299445},
timestamp = {Tue, 21 Nov 2023 22:37:01 +0100},
biburl = {https://dblp.org/rec/conf/kse/HaPTH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/med/ErofeevaG23,
author = {Victoria Erofeeva and
Oleg N. Granichin},
title = {Improved Simultaneous Perturbation Stochastic Approximation-based
Consensus Algorithm for Tracking},
booktitle = {31st Mediterranean Conference on Control and Automatio, {MED} 2023,
Limassol, Cyprus, June 26-29, 2023},
pages = {850--855},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/MED59994.2023.10185823},
doi = {10.1109/MED59994.2023.10185823},
timestamp = {Mon, 31 Jul 2023 15:41:33 +0200},
biburl = {https://dblp.org/rec/conf/med/ErofeevaG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EeOSW23,
author = {Martijn van Ee and
Tim Oosterwijk and
Ren{\'{e}} Sitters and
Andreas Wiese},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Exact and Approximation Algorithms for Routing a Convoy Through a
Graph},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {86:1--86:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.86},
doi = {10.4230/LIPICS.MFCS.2023.86},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EeOSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FominG0K23,
author = {Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Tomohiro Koana},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {{FPT} Approximation and Subexponential Algorithms for Covering Few
or Many Edges},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {46:1--46:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.46},
doi = {10.4230/LIPICS.MFCS.2023.46},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/FominG0K23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nctcs/Cao23,
author = {Menghan Cao},
editor = {Zhiping Cai and
Mingyu Xiao and
Jialin Zhang},
title = {An Approximation Algorithm for Stochastic Power Cover Problem},
booktitle = {Theoretical Computer Science - 41st National Conference, {NCTCS} 2023,
Guangzhou, China, July 21-23, 2023, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {1944},
pages = {96--106},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-981-99-7743-7\_6},
doi = {10.1007/978-981-99-7743-7\_6},
timestamp = {Mon, 08 Jan 2024 16:42:23 +0100},
biburl = {https://dblp.org/rec/conf/nctcs/Cao23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/netys/JanaM23,
author = {Saswata Jana and
Partha Sarathi Mandal},
editor = {David Mohaisen and
Thomas Wies},
title = {Approximation Algorithms for Drone Delivery Scheduling Problem},
booktitle = {Networked Systems - 11th International Conference, {NETYS} 2023, Benguerir,
Morocco, May 22-24, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14067},
pages = {125--140},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-37765-5\_10},
doi = {10.1007/978-3-031-37765-5\_10},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/netys/JanaM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nice/TheilmanA23,
author = {Bradley H. Theilman and
James B. Aimone},
editor = {Dhireesha Kudithipudi and
Charlotte Frenkel and
Suma Cardwell and
James B. Aimone},
title = {Goemans-Williamson {MAXCUT} approximation algorithm on Loihi},
booktitle = {Neuro-Inspired Computational Elements Conference, NICE2023, San Antonio,
TX, USA, April 11-14, 2023},
pages = {1--5},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3584954.3584955},
doi = {10.1145/3584954.3584955},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nice/TheilmanA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ChenC23,
author = {Wenjing Chen and
Victoria G. Crawford},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Bicriteria Approximation Algorithms for the Submodular Cover Problem},
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/e5eaf67f3405be58cd12848a89cd8ace-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/ChenC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/JagharghH023a,
author = {Mohammad Reza Karimi Jaghargh and
Ya{-}Ping Hsieh and
Andreas Krause},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Stochastic Approximation Algorithms for Systems of Interacting Particles},
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/aebbbfa9680eafefd43a0edc85c101f9-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/JagharghH023a.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/norcas/KhanG23,
author = {Mohd. Tasleem Khan and
Oscar Gustafsson},
title = {Analyzing Step-Size Approximation for Fixed-Point Implementation of
{LMS} and {BLMS} Algorithms},
booktitle = {{IEEE} Nordic Circuits and Systems Conference, NorCAS 2023, Aalborg,
Denmark, October 31 - Nov. 1, 2023},
pages = {1--5},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/NorCAS58970.2023.10305481},
doi = {10.1109/NORCAS58970.2023.10305481},
timestamp = {Thu, 16 Nov 2023 09:03:47 +0100},
biburl = {https://dblp.org/rec/conf/norcas/KhanG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/prime/NasiriLZ23,
author = {Hamed Nasiri and
Cheng Li and
Lihong Zhang},
title = {A Power-Efficient Successive Approximation Algorithm for Low-Activity
Signals},
booktitle = {18th Conference on Ph.D Research in Microelectronics and Electronics,
{PRIME} 2023, Valencia, Spain, June 18-21, 2023},
pages = {265--268},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/PRIME58259.2023.10161935},
doi = {10.1109/PRIME58259.2023.10161935},
timestamp = {Wed, 05 Jul 2023 16:00:02 +0200},
biburl = {https://dblp.org/rec/conf/prime/NasiriLZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/0001MLF23,
author = {Yanhao Wang and
Michael Mathioudakis and
Jia Li and
Francesco Fabbri},
editor = {Shashi Shekhar and
Zhi{-}Hua Zhou and
Yao{-}Yi Chiang and
Gregor Stiglic},
title = {Max-Min Diversification with Fairness Constraints: Exact and Approximation
Algorithms},
booktitle = {Proceedings of the 2023 {SIAM} International Conference on Data Mining,
{SDM} 2023, Minneapolis-St. Paul Twin Cities, MN, USA, April 27-29,
2023},
pages = {91--99},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977653.ch11},
doi = {10.1137/1.9781611977653.CH11},
timestamp = {Sat, 28 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sdm/0001MLF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0001ZZ23,
author = {R. Ravi and
Weizhong Zhang and
Michael Zlatin},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Approximation Algorithms for Steiner Tree Augmentation Problems},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2429--2448},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch94},
doi = {10.1137/1.9781611977554.CH94},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/0001ZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/00010J023,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A simple polynomial-time approximation algorithm for the total variation
distance between two product distributions},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {343--347},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch30},
doi = {10.1137/1.9781611977585.CH30},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/00010J023.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 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/BreenMWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/CsajiKY23,
author = {Gergely K{\'{a}}l Cs{\'{a}}ji and
Tam{\'{a}}s Kir{\'{a}}ly and
Yu Yokoi},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Approximation Algorithms for Matroidal and Cardinal Generalizations
of Stable Matching},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {103--113},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch10},
doi = {10.1137/1.9781611977585.CH10},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/CsajiKY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BlinPRU23,
author = {Guillaume Blin and
Alexandru Popa and
Mathieu Raffinot and
Raluca Uricaru},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {Approximation and Fixed Parameter Algorithms for the Approximate Cover
Problem},
booktitle = {String Processing and Information Retrieval - 30th International Symposium,
{SPIRE} 2023, Pisa, Italy, September 26-28, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {75--88},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3\_7},
doi = {10.1007/978-3-031-43980-3\_7},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BlinPRU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DufayM023,
author = {Marc Dufay and
Claire Mathieu and
Hang Zhou},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {An Approximation Algorithm for Distance-Constrained Vehicle Routing
on Trees},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {27:1--27:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.27},
doi = {10.4230/LIPICS.STACS.2023.27},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DufayM023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SolomonU23,
author = {Shay Solomon and
Amitai Uzrad},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Dynamic ((1+{\(\epsilon\)}) ln n)-Approximation Algorithms for Minimum
Set Cover and Dominating Set},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1187--1200},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585211},
doi = {10.1145/3564246.3585211},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SolomonU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TraubZ23,
author = {Vera Traub and
Rico Zenklusen},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A (1.5+{\(\epsilon\)})-Approximation Algorithm for Weighted Connectivity
Augmentation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1820--1833},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585122},
doi = {10.1145/3564246.3585122},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TraubZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Woodruff023,
author = {David P. Woodruff and
Taisuke Yasuda},
editor = {Barna Saha and
Rocco A. Servedio},
title = {New Subset Selection Algorithms for Low Rank Approximation: Offline
and Online},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1802--1813},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585100},
doi = {10.1145/3564246.3585100},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Woodruff023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BandyapadhyayFIPS23,
author = {Sayan Bandyapadhyay and
Fedor V. Fomin and
Tanmay Inamdar and
Fahad Panolan and
Kirill Simonov},
editor = {Pat Morin and
Subhash Suri},
title = {Socially Fair Matching: Exact and Approximation Algorithms},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {79--92},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_6},
doi = {10.1007/978-3-031-38906-1\_6},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BandyapadhyayFIPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BatraDJ23,
author = {Jatin Batra and
Syamantak Das and
Agastya Vibhuti Jha},
editor = {Pat Morin and
Subhash Suri},
title = {Tight Approximation Algorithms for Ordered Covering},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {120--135},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_9},
doi = {10.1007/978-3-031-38906-1\_9},
timestamp = {Tue, 01 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BatraDJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/ZhangW023,
author = {Ke Zhang and
Xiaoqing Wang and
Gong Cheng},
editor = {Ying Ding and
Jie Tang and
Juan F. Sequeda and
Lora Aroyo and
Carlos Castillo and
Geert{-}Jan Houben},
title = {Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage
Group Steiner Tree Problem},
booktitle = {Proceedings of the {ACM} Web Conference 2023, {WWW} 2023, Austin,
TX, USA, 30 April 2023 - 4 May 2023},
pages = {199--209},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3543507.3583257},
doi = {10.1145/3543507.3583257},
timestamp = {Mon, 28 Aug 2023 21:17:10 +0200},
biburl = {https://dblp.org/rec/conf/www/ZhangW023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2023,
editor = {Nicole Megow and
Adam D. Smith},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-296-9},
isbn = {978-3-95977-296-9},
timestamp = {Sat, 09 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2023,
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2},
doi = {10.1007/978-3-031-49815-2},
isbn = {978-3-031-49814-5},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-02053,
author = {Yanhao Wang and
Michael Mathioudakis and
Jia Li and
Francesco Fabbri},
title = {Max-Min Diversification with Fairness Constraints: Exact and Approximation
Algorithms},
journal = {CoRR},
volume = {abs/2301.02053},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.02053},
doi = {10.48550/ARXIV.2301.02053},
eprinttype = {arXiv},
eprint = {2301.02053},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-02053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-03638,
author = {Svenja M. Griesbach and
Felix Hommelsheim and
Max Klimm and
Kevin Schewior},
title = {Improved Approximation Algorithms for the Expanding Search Problem},
journal = {CoRR},
volume = {abs/2301.03638},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.03638},
doi = {10.48550/ARXIV.2301.03638},
eprinttype = {arXiv},
eprint = {2301.03638},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-03638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-08920,
author = {Konstantinos Ameranis and
Antares Chen and
Lorenzo Orecchia and
Erasmo Tani},
title = {Efficient Flow-based Approximation Algorithms for Submodular Hypergraph
Partitioning via a Generalized Cut-Matching Game},
journal = {CoRR},
volume = {abs/2301.08920},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.08920},
doi = {10.48550/ARXIV.2301.08920},
eprinttype = {arXiv},
eprint = {2301.08920},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-08920.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-09247,
author = {Jiao Zhou and
Yingli Ran and
Zhao Zhang and
Shaojie Tang},
title = {Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected
Dominating Set},
journal = {CoRR},
volume = {abs/2301.09247},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.09247},
doi = {10.48550/ARXIV.2301.09247},
eprinttype = {arXiv},
eprint = {2301.09247},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-09247.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-11598,
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 = {CoRR},
volume = {abs/2301.11598},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.11598},
doi = {10.48550/ARXIV.2301.11598},
eprinttype = {arXiv},
eprint = {2301.11598},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-11598.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-13965,
author = {Ricardo Baptista and
Bamdad Hosseini and
Nikola B. Kovachki and
Youssef M. Marzouk and
Amir Sagiv},
title = {An Approximation Theory Framework for Measure-Transport Sampling Algorithms},
journal = {CoRR},
volume = {abs/2302.13965},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.13965},
doi = {10.48550/ARXIV.2302.13965},
eprinttype = {arXiv},
eprint = {2302.13965},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-13965.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-2303-06759,
author = {Benjamin Qi and
Richard Qi and
Xinyang Chen},
title = {New Approximation Algorithms for Touring Regions},
journal = {CoRR},
volume = {abs/2303.06759},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.06759},
doi = {10.48550/ARXIV.2303.06759},
eprinttype = {arXiv},
eprint = {2303.06759},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-06759.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-02558,
author = {Gergely Cs{\'{a}}ji},
title = {A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI
Problems},
journal = {CoRR},
volume = {abs/2304.02558},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.02558},
doi = {10.48550/ARXIV.2304.02558},
eprinttype = {arXiv},
eprint = {2304.02558},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-02558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-03813,
author = {Annan Yu and
Alex Townsend},
title = {Leveraging the Hankel norm approximation and block-AAA algorithms
in reduced order modeling},
journal = {CoRR},
volume = {abs/2304.03813},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.03813},
doi = {10.48550/ARXIV.2304.03813},
eprinttype = {arXiv},
eprint = {2304.03813},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-03813.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06664,
author = {Noah G. Singer},
title = {On streaming approximation algorithms for constraint satisfaction
problems},
journal = {CoRR},
volume = {abs/2304.06664},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06664},
doi = {10.48550/ARXIV.2304.06664},
eprinttype = {arXiv},
eprint = {2304.06664},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06664.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-09217,
author = {David P. Woodruff and
Taisuke Yasuda},
title = {New Subset Selection Algorithms for Low Rank Approximation: Offline
and Online},
journal = {CoRR},
volume = {abs/2304.09217},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.09217},
doi = {10.48550/ARXIV.2304.09217},
eprinttype = {arXiv},
eprint = {2304.09217},
timestamp = {Mon, 24 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-09217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-09600,
author = {Yair Censor and
Rafiq Mansour and
Daniel Reem},
title = {The alternating simultaneous Halpern-Lions-Wittmann-Bauschke algorithm
for finding the best approximation pair for two disjoint intersections
of convex sets},
journal = {CoRR},
volume = {abs/2304.09600},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.09600},
doi = {10.48550/ARXIV.2304.09600},
eprinttype = {arXiv},
eprint = {2304.09600},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-09600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-11281,
author = {Zipei Nie and
Hang Zhou},
title = {Euclidean Capacitated Vehicle Routing in Random Setting: {A} 1.55-Approximation
Algorithm},
journal = {CoRR},
volume = {abs/2304.11281},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.11281},
doi = {10.48550/ARXIV.2304.11281},
eprinttype = {arXiv},
eprint = {2304.11281},
timestamp = {Mon, 08 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-11281.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-12779,
author = {Mingyang Gong and
Zhi{-}Zhong Chen and
Guohui Lin and
Zhaohui Zhan},
title = {An Approximation Algorithm for Covering Vertices by 4+-Paths},
journal = {CoRR},
volume = {abs/2304.12779},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.12779},
doi = {10.48550/ARXIV.2304.12779},
eprinttype = {arXiv},
eprint = {2304.12779},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-12779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-13228,
author = {Yusuke Kobayashi and
Takashi Noguchi},
title = {An Approximation Algorithm for Two-Edge-Connected Subgraph Problem
via Triangle-free Two-Edge-Cover},
journal = {CoRR},
volume = {abs/2304.13228},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.13228},
doi = {10.48550/ARXIV.2304.13228},
eprinttype = {arXiv},
eprint = {2304.13228},
timestamp = {Wed, 03 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-13228.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-2305-10292,
author = {Canh V. Pham and
Tan D. Tran and
Dung K. T. Ha and
My T. Thai},
title = {Linear Query Approximation Algorithms for Non-monotone Submodular
Maximization under Knapsack Constraint},
journal = {CoRR},
volume = {abs/2305.10292},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.10292},
doi = {10.48550/ARXIV.2305.10292},
eprinttype = {arXiv},
eprint = {2305.10292},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-10292.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-16086,
author = {Shiqi Zhang and
Renchi Yang and
Jing Tang and
Xiaokui Xiao and
Bo Tang},
title = {Efficient Approximation Algorithms for Spanning Centrality},
journal = {CoRR},
volume = {abs/2305.16086},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.16086},
doi = {10.48550/ARXIV.2305.16086},
eprinttype = {arXiv},
eprint = {2305.16086},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-16086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-01826,
author = {Yongyu Chen},
title = {A survey of approximation algorithms for capacitated vehicle routing
problems},
journal = {CoRR},
volume = {abs/2306.01826},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.01826},
doi = {10.48550/ARXIV.2306.01826},
eprinttype = {arXiv},
eprint = {2306.01826},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-01826.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-2306-01869,
author = {Ameya Velingker and
Maximilian V{\"{o}}tsch and
David P. Woodruff and
Samson Zhou},
title = {Fast (1+{\(\epsilon\)})-Approximation Algorithms for Binary Matrix
Factorization},
journal = {CoRR},
volume = {abs/2306.01869},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.01869},
doi = {10.48550/ARXIV.2306.01869},
eprinttype = {arXiv},
eprint = {2306.01869},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-01869.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-02293,
author = {Chi{-}Yeh Chen},
title = {Efficient Approximation Algorithms for Scheduling Coflows with Total
Weighted Completion Time in Identical Parallel Networks},
journal = {CoRR},
volume = {abs/2306.02293},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.02293},
doi = {10.48550/ARXIV.2306.02293},
eprinttype = {arXiv},
eprint = {2306.02293},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-02293.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-2306-06778,
author = {S{\`{e}}djro Salomon Hotegni and
Sepideh Mahabadi and
Ali Vakilian},
title = {Approximation Algorithms for Fair Range Clustering},
journal = {CoRR},
volume = {abs/2306.06778},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.06778},
doi = {10.48550/ARXIV.2306.06778},
eprinttype = {arXiv},
eprint = {2306.06778},
timestamp = {Wed, 16 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-06778.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-07163,
author = {Jing Dong and
Yuichi Yoshida},
title = {General Transformation for Consistent Online Approximation Algorithms},
journal = {CoRR},
volume = {abs/2306.07163},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.07163},
doi = {10.48550/ARXIV.2306.07163},
eprinttype = {arXiv},
eprint = {2306.07163},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-07163.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-12418,
author = {Joel A. Tropp and
Robert J. Webber},
title = {Randomized algorithms for low-rank matrix approximation: Design, analysis,
and applications},
journal = {CoRR},
volume = {abs/2306.12418},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.12418},
doi = {10.48550/ARXIV.2306.12418},
eprinttype = {arXiv},
eprint = {2306.12418},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-12418.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-13996,
author = {Wei Liang and
Zhao Zhang},
title = {Approximation Algorithm for Unrooted Prize-Collecting Forest with
Multiple Components and Its Application on Prize-Collecting Sweep
Coverage},
journal = {CoRR},
volume = {abs/2306.13996},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.13996},
doi = {10.48550/ARXIV.2306.13996},
eprinttype = {arXiv},
eprint = {2306.13996},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-13996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-14520,
author = {Hao Xiao and
Qian Liu and
Yang Zhou and
Min Li},
title = {Approximation algorithms for k-submodular maximization subject to
a knapsack constraint},
journal = {CoRR},
volume = {abs/2306.14520},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.14520},
doi = {10.48550/ARXIV.2306.14520},
eprinttype = {arXiv},
eprint = {2306.14520},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-14520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-15331,
author = {Baris Can Esmer and
Ariel Kulik and
D{\'{a}}niel Marx and
Daniel Neuen and
Roohani Sharma},
title = {Optimally Repurposing Existing Algorithms to Obtain Exponential-Time
Approximations},
journal = {CoRR},
volume = {abs/2306.15331},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.15331},
doi = {10.48550/ARXIV.2306.15331},
eprinttype = {arXiv},
eprint = {2306.15331},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-15331.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-17308,
author = {Tyler Chen and
Anne Greenbaum and
Natalie Wellen},
title = {Optimal Polynomial Approximation to Rational Matrix Functions Using
the Arnoldi Algorithm},
journal = {CoRR},
volume = {abs/2306.17308},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.17308},
doi = {10.48550/ARXIV.2306.17308},
eprinttype = {arXiv},
eprint = {2306.17308},
timestamp = {Mon, 03 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-17308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-00115,
author = {Vladimir Kolmogorov},
title = {A simpler and parallelizable O({\(\surd\)}log n)-approximation algorithm
for Sparsest Cut},
journal = {CoRR},
volume = {abs/2307.00115},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.00115},
doi = {10.48550/ARXIV.2307.00115},
eprinttype = {arXiv},
eprint = {2307.00115},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-00115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-01639,
author = {Gregor Betz and
Vera Chekan and
Tamara Mchedlidze},
title = {Heuristic Algorithms for the Approximation of Mutual Coherence},
journal = {CoRR},
volume = {abs/2307.01639},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.01639},
doi = {10.48550/ARXIV.2307.01639},
eprinttype = {arXiv},
eprint = {2307.01639},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-01639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-01650,
author = {Zeev Nutov},
title = {Improved approximation algorithms for some capacitated k edge connectivity
problems},
journal = {CoRR},
volume = {abs/2307.01650},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.01650},
doi = {10.48550/ARXIV.2307.01650},
eprinttype = {arXiv},
eprint = {2307.01650},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-01650.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02205,
author = {Anita D{\"{u}}rr and
Nicolas El Maalouly and
Lasse Wulf},
title = {An Approximation Algorithm for the Exact Matching Problem in Bipartite
Graphs},
journal = {CoRR},
volume = {abs/2307.02205},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02205},
doi = {10.48550/ARXIV.2307.02205},
eprinttype = {arXiv},
eprint = {2307.02205},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02205.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02774,
author = {Elena Grigorescu and
Nithish Kumar and
Young{-}San Lin},
title = {Approximation Algorithms for Directed Weighted Spanners},
journal = {CoRR},
volume = {abs/2307.02774},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02774},
doi = {10.48550/ARXIV.2307.02774},
eprinttype = {arXiv},
eprint = {2307.02774},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02968,
author = {Sepehr Assadi},
title = {A Simple (1-{\(\epsilon\)})-Approximation Semi-Streaming Algorithm
for Maximum (Weighted) Matching},
journal = {CoRR},
volume = {abs/2307.02968},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02968},
doi = {10.48550/ARXIV.2307.02968},
eprinttype = {arXiv},
eprint = {2307.02968},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-04107,
author = {Chi{-}Yeh Chen},
title = {Efficient Approximation Algorithms for Scheduling Coflows with Precedence
Constraints in Identical Parallel Networks to Minimize Weighted Completion
Time},
journal = {CoRR},
volume = {abs/2307.04107},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.04107},
doi = {10.48550/ARXIV.2307.04107},
eprinttype = {arXiv},
eprint = {2307.04107},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-04107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-05750,
author = {Nicol{\'{a}}s Garc{\'{\i}}a Trillos and
Anna Little and
Daniel McKenzie and
James M. Murphy},
title = {Fermat Distances: Metric Approximation, Spectral Convergence, and
Clustering Algorithms},
journal = {CoRR},
volume = {abs/2307.05750},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.05750},
doi = {10.48550/ARXIV.2307.05750},
eprinttype = {arXiv},
eprint = {2307.05750},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-05750.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-06776,
author = {Rachel Vanucchi Saraiva and
Rafael C. S. Schouery},
title = {Approximation algorithms for the square min-sum bin packing problem},
journal = {CoRR},
volume = {abs/2307.06776},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.06776},
doi = {10.48550/ARXIV.2307.06776},
eprinttype = {arXiv},
eprint = {2307.06776},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-06776.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07433,
author = {Niklas Jost},
title = {An Approximation Algorithm for Multi Allocation Hub Location Problems},
journal = {CoRR},
volume = {abs/2307.07433},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07433},
doi = {10.48550/ARXIV.2307.07433},
eprinttype = {arXiv},
eprint = {2307.07433},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07433.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-2307-08505,
author = {Rahul Kumar Gautam and
Anjeneya Swami Kare and
S. Durga Bhavani},
title = {Approximation Algorithms for the Graph Burning on Cactus and Directed
Trees},
journal = {CoRR},
volume = {abs/2307.08505},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.08505},
doi = {10.48550/ARXIV.2307.08505},
eprinttype = {arXiv},
eprint = {2307.08505},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-08505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-02901,
author = {Zeev Nutov},
title = {A logarithmic approximation algorithm for the activation edge multicover
problem},
journal = {CoRR},
volume = {abs/2308.02901},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.02901},
doi = {10.48550/ARXIV.2308.02901},
eprinttype = {arXiv},
eprint = {2308.02901},
timestamp = {Mon, 21 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-02901.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-03516,
author = {Dor Katzelnick and
Aditya Pillai and
Roy Schwartz and
Mohit Singh},
title = {An Improved Approximation Algorithm for the Max-3-Section Problem},
journal = {CoRR},
volume = {abs/2308.03516},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.03516},
doi = {10.48550/ARXIV.2308.03516},
eprinttype = {arXiv},
eprint = {2308.03516},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-03516.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-04846,
author = {Varun Suriyanarayana and
Varun Sivashankar and
Siddharth Gollapudi and
David B. Shmoys},
title = {Improved Approximation Algorithms for the Joint Replenishment Problem
with Outliers, and with Fairness Constraints},
journal = {CoRR},
volume = {abs/2308.04846},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.04846},
doi = {10.48550/ARXIV.2308.04846},
eprinttype = {arXiv},
eprint = {2308.04846},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-04846.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-04882,
author = {Sandip Das and
Sk Samim Islam},
title = {Approximation algorithm for finding multipacking on Cactus},
journal = {CoRR},
volume = {abs/2308.04882},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.04882},
doi = {10.48550/ARXIV.2308.04882},
eprinttype = {arXiv},
eprint = {2308.04882},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-04882.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-06209,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
title = {Simpler constant factor approximation algorithms for weighted flow
time - now for any p-norm},
journal = {CoRR},
volume = {abs/2308.06209},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.06209},
doi = {10.48550/ARXIV.2308.06209},
eprinttype = {arXiv},
eprint = {2308.06209},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-06209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-06561,
author = {Mohammad{-}Hadi Foroughmand{-}Araabi and
Sama Goliaei and
Kasra Alishahi},
title = {An Approximation Algorithm for Ancestral Maximum-Likelihood and Phylogeography
Inference Problems under Time Reversible Markov Evolutionary Models},
journal = {CoRR},
volume = {abs/2308.06561},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.06561},
doi = {10.48550/ARXIV.2308.06561},
eprinttype = {arXiv},
eprint = {2308.06561},
timestamp = {Wed, 23 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-06561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-08373,
author = {Charlie Carlson and
Jafar Jafarov and
Konstantin Makarychev and
Yury Makarychev and
Liren Shan},
title = {Approximation Algorithms for Norm Multiway Cut},
journal = {CoRR},
volume = {abs/2308.08373},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.08373},
doi = {10.48550/ARXIV.2308.08373},
eprinttype = {arXiv},
eprint = {2308.08373},
timestamp = {Thu, 24 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-08373.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-08690,
author = {Daniel Hathcock and
Michael Zlatin},
title = {Improved Approximation Algorithms for Steiner Connectivity Augmentation
Problems},
journal = {CoRR},
volume = {abs/2308.08690},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.08690},
doi = {10.48550/ARXIV.2308.08690},
eprinttype = {arXiv},
eprint = {2308.08690},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-08690.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-09866,
author = {Junyan Su and
Qiulin Lin and
Minghua Chen and
Haibo Zeng},
title = {Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness
and Approximation Algorithm},
journal = {CoRR},
volume = {abs/2308.09866},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.09866},
doi = {10.48550/ARXIV.2308.09866},
eprinttype = {arXiv},
eprint = {2308.09866},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-09866.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13260,
author = {Songhua Li and
Lingjie Duan},
title = {Approximation Algorithms to Enhance Social Sharing of Fresh Point-of-Interest
Information},
journal = {CoRR},
volume = {abs/2308.13260},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13260},
doi = {10.48550/ARXIV.2308.13260},
eprinttype = {arXiv},
eprint = {2308.13260},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13512,
author = {Tomasz Kanas and
Krzysztof Rzadca},
title = {A Poisson-Based Approximation Algorithm for Stochastic Bin Packing
of Bernoulli Items},
journal = {CoRR},
volume = {abs/2308.13512},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13512},
doi = {10.48550/ARXIV.2308.13512},
eprinttype = {arXiv},
eprint = {2308.13512},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13512.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-13709,
author = {Cullen Haselby and
Mark A. Iwen and
Deanna Needell and
Elizaveta Rebrova and
William Swartworth},
title = {Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank
Tensor Approximation from Streamed Measurements},
journal = {CoRR},
volume = {abs/2308.13709},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.13709},
doi = {10.48550/ARXIV.2308.13709},
eprinttype = {arXiv},
eprint = {2308.13709},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-13709.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-14131,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {Improved Approximation Algorithms for Multidepot Capacitated Vehicle
Routing},
journal = {CoRR},
volume = {abs/2308.14131},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.14131},
doi = {10.48550/ARXIV.2308.14131},
eprinttype = {arXiv},
eprint = {2308.14131},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-14131.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15546,
author = {Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Tomohiro Koana},
title = {{FPT} Approximation and Subexponential Algorithms for Covering Few
or Many Edges},
journal = {CoRR},
volume = {abs/2308.15546},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15546},
doi = {10.48550/ARXIV.2308.15546},
eprinttype = {arXiv},
eprint = {2308.15546},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15546.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-15635,
author = {Walter Didimo and
Fedor V. Fomin and
Petr A. Golovach and
Tanmay Inamdar and
Stephen G. Kobourov and
Marie Diana Sieper},
title = {Parameterized and Approximation Algorithms for the Maximum Bimodal
Subgraph Problem},
journal = {CoRR},
volume = {abs/2308.15635},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.15635},
doi = {10.48550/ARXIV.2308.15635},
eprinttype = {arXiv},
eprint = {2308.15635},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-15635.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-16899,
author = {Reyhaneh Mohammadi and
Mehdi Behroozi},
title = {A Divide and Conquer Approximation Algorithm for Partitioning Rectangles},
journal = {CoRR},
volume = {abs/2308.16899},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.16899},
doi = {10.48550/ARXIV.2308.16899},
eprinttype = {arXiv},
eprint = {2308.16899},
timestamp = {Fri, 01 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-16899.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-01902,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {A 5-approximation Algorithm for the Traveling Tournament Problem},
journal = {CoRR},
volume = {abs/2309.01902},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.01902},
doi = {10.48550/ARXIV.2309.01902},
eprinttype = {arXiv},
eprint = {2309.01902},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-01902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-02877,
author = {Alberto Bucci and
Leonardo Robol},
title = {A multilinear Nystr{\"{o}}m algorithm for low-rank approximation
of tensors in Tucker format},
journal = {CoRR},
volume = {abs/2309.02877},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.02877},
doi = {10.48550/ARXIV.2309.02877},
eprinttype = {arXiv},
eprint = {2309.02877},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-02877.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-2309-12025,
author = {Dung T. K. Ha and
Canh V. Pham and
Tan D. Tran and
Huan X. Hoang},
title = {Robust Approximation Algorithms for Non-monotone k-Submodular Maximization
under a Knapsack Constraint},
journal = {CoRR},
volume = {abs/2309.12025},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.12025},
doi = {10.48550/ARXIV.2309.12025},
eprinttype = {arXiv},
eprint = {2309.12025},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-12025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-12031,
author = {Sven J{\"{a}}ger and
Philipp Warode},
title = {Simple Approximation Algorithms for Minimizing the Total Weighted
Completion Time of Precedence-Constrained Jobs},
journal = {CoRR},
volume = {abs/2309.12031},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.12031},
doi = {10.48550/ARXIV.2309.12031},
eprinttype = {arXiv},
eprint = {2309.12031},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-12031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-13428,
author = {Bengt J. Nilsson and
Eli Packer},
title = {Approximation Algorithms for the Two-Watchman Route in a Simple Polygon},
journal = {CoRR},
volume = {abs/2309.13428},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.13428},
doi = {10.48550/ARXIV.2309.13428},
eprinttype = {arXiv},
eprint = {2309.13428},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-13428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-14506,
author = {Jiaxiang Li and
Krishnakumar Balasubramanian and
Shiqian Ma},
title = {Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms},
journal = {CoRR},
volume = {abs/2309.14506},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.14506},
doi = {10.48550/ARXIV.2309.14506},
eprinttype = {arXiv},
eprint = {2309.14506},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-14506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-14558,
author = {Wenjing Chen and
Victoria G. Crawford},
title = {Bicriteria Approximation Algorithms for the Submodular Cover Problem},
journal = {CoRR},
volume = {abs/2309.14558},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.14558},
doi = {10.48550/ARXIV.2309.14558},
eprinttype = {arXiv},
eprint = {2309.14558},
timestamp = {Wed, 27 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-14558.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-00526,
author = {Morris Yau and
Eric Lu and
Nikolaos Karalias and
Jessica Xu and
Stefanie Jegelka},
title = {Are Graph Neural Networks Optimal Approximation Algorithms?},
journal = {CoRR},
volume = {abs/2310.00526},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.00526},
doi = {10.48550/ARXIV.2310.00526},
eprinttype = {arXiv},
eprint = {2310.00526},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-00526.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/corr/abs-2310-09196,
author = {Holger Heidrich and
Jannik Irmai and
Bjoern Andres},
title = {A 4-approximation algorithm for min max correlation clustering},
journal = {CoRR},
volume = {abs/2310.09196},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.09196},
doi = {10.48550/ARXIV.2310.09196},
eprinttype = {arXiv},
eprint = {2310.09196},
timestamp = {Wed, 25 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-09196.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-09638,
author = {Mojtaba Ostovari and
Alireza Zarei},
title = {A Combinatorial Approximation Algorithm for Correlation Clustering},
journal = {CoRR},
volume = {abs/2310.09638},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.09638},
doi = {10.48550/ARXIV.2310.09638},
eprinttype = {arXiv},
eprint = {2310.09638},
timestamp = {Wed, 25 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-09638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-10898,
author = {Samin Aref and
Mahdi Mostajabdaveh},
title = {Analyzing Modularity Maximization in Approximation, Heuristic, and
Graph Neural Network Algorithms for Community Detection},
journal = {CoRR},
volume = {abs/2310.10898},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.10898},
doi = {10.48550/ARXIV.2310.10898},
eprinttype = {arXiv},
eprint = {2310.10898},
timestamp = {Thu, 26 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-10898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-20325,
author = {Jana Cslovjecsek and
Michal Pilipczuk and
Karol Wegrzycki},
title = {A polynomial-time OPT\({}^{\mbox{{\(\epsilon\)}}}\)-approximation
algorithm for maximum independent set of connected subgraphs in a
planar graph},
journal = {CoRR},
volume = {abs/2310.20325},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.20325},
doi = {10.48550/ARXIV.2310.20325},
eprinttype = {arXiv},
eprint = {2310.20325},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-20325.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-02050,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Rahul Raychaudhury and
Stavros Sintos},
title = {Fast Approximation Algorithms for Piercing Boxes by Points},
journal = {CoRR},
volume = {abs/2311.02050},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.02050},
doi = {10.48550/ARXIV.2311.02050},
eprinttype = {arXiv},
eprint = {2311.02050},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-02050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-03230,
author = {Swati Gupta and
Jai Moondra and
Mohit Singh},
title = {Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio
of Solutions in Combinatorial Optimization},
journal = {CoRR},
volume = {abs/2311.03230},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.03230},
doi = {10.48550/ARXIV.2311.03230},
eprinttype = {arXiv},
eprint = {2311.03230},
timestamp = {Thu, 07 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-03230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-06111,
author = {Moritz Buchem and
Katja Ettmayr and
Hugo K. K. Rosado and
Andreas Wiese},
title = {A (3+{\(\epsilon\)})-approximation algorithm for the minimum sum of
radii problem with outliers and extensions for generalized lower bounds},
journal = {CoRR},
volume = {abs/2311.06111},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.06111},
doi = {10.48550/ARXIV.2311.06111},
eprinttype = {arXiv},
eprint = {2311.06111},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-06111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-11296,
author = {Chi{-}Yeh Chen},
title = {Improved Approximation Algorithms for Minimizing the Total Weighted
Completion Time of Coflows},
journal = {CoRR},
volume = {abs/2311.11296},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.11296},
doi = {10.48550/ARXIV.2311.11296},
eprinttype = {arXiv},
eprint = {2311.11296},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-11296.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-11332,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {Improved Approximation Algorithms for Cycle and Path Packings},
journal = {CoRR},
volume = {abs/2311.11332},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.11332},
doi = {10.48550/ARXIV.2311.11332},
eprinttype = {arXiv},
eprint = {2311.11332},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-11332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-14023,
author = {David Persson and
Raphael A. Meyer and
Christopher Musco},
title = {Algorithm-agnostic low-rank approximation of operator monotone matrix
functions},
journal = {CoRR},
volume = {abs/2311.14023},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.14023},
doi = {10.48550/ARXIV.2311.14023},
eprinttype = {arXiv},
eprint = {2311.14023},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-14023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-14652,
author = {Raghav Addanki and
Chenyang Li and
Zhao Song and
Chiwun Yang},
title = {One Pass Streaming Algorithm for Super Long Token Attention Approximation
in Sublinear Space},
journal = {CoRR},
volume = {abs/2311.14652},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.14652},
doi = {10.48550/ARXIV.2311.14652},
eprinttype = {arXiv},
eprint = {2311.14652},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-14652.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-15238,
author = {Heyang Zhao and
Jiafan He and
Quanquan Gu},
title = {A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning
with General Function Approximation},
journal = {CoRR},
volume = {abs/2311.15238},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.15238},
doi = {10.48550/ARXIV.2311.15238},
eprinttype = {arXiv},
eprint = {2311.15238},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-15238.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07644,
author = {Roldan Pozo},
title = {Approximation algorithms for k-median problems on complex networks:
theory and practice},
journal = {CoRR},
volume = {abs/2312.07644},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07644},
doi = {10.48550/ARXIV.2312.07644},
eprinttype = {arXiv},
eprint = {2312.07644},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07644.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-09162,
author = {Abu Mohammad Hammad Ali and
Boting Yang and
Sandra Zilles},
title = {Approximation Algorithms for Preference Aggregation Using CP-Nets},
journal = {CoRR},
volume = {abs/2312.09162},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.09162},
doi = {10.48550/ARXIV.2312.09162},
eprinttype = {arXiv},
eprint = {2312.09162},
timestamp = {Tue, 09 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-09162.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-16413,
author = {Chi{-}Yeh Chen},
title = {Improved Approximation Coflows Scheduling Algorithms for Minimizing
the Total Weighted Completion Time and Makespan in Heterogeneous Parallel
Networks},
journal = {CoRR},
volume = {abs/2312.16413},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.16413},
doi = {10.48550/ARXIV.2312.16413},
eprinttype = {arXiv},
eprint = {2312.16413},
timestamp = {Thu, 18 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-16413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-16765,
author = {Eric Culf and
Hamoon Mousavi and
Taro Spirig},
title = {Approximation algorithms for noncommutative constraint satisfaction
problems},
journal = {CoRR},
volume = {abs/2312.16765},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.16765},
doi = {10.48550/ARXIV.2312.16765},
eprinttype = {arXiv},
eprint = {2312.16765},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-16765.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-17625,
author = {Shay Solomon and
Amitai Uzrad},
title = {Dynamic ((1+{\(\epsilon\)})ln n)-Approximation Algorithms for Minimum
Set Cover and Dominating Set},
journal = {CoRR},
volume = {abs/2312.17625},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.17625},
doi = {10.48550/ARXIV.2312.17625},
eprinttype = {arXiv},
eprint = {2312.17625},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-17625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/SCSZH23,
author = {{Karthik {C. S.}} and
Parinya Chalermsook and
Joachim Spoerhase and
Meirav Zehavi and
Martin Herold},
title = {Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar
23291)},
journal = {Dagstuhl Reports},
volume = {13},
number = {7},
pages = {96--107},
year = {2023},
url = {https://doi.org/10.4230/DagRep.13.7.96},
doi = {10.4230/DAGREP.13.7.96},
timestamp = {Thu, 14 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/SCSZH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Saulpic22,
author = {David Saulpic},
title = {Approximation Algorithms and Sketches for Clustering. (Algorithmes
d'approximation et sketches pour les probl{\`{e}}mes de clustering)},
school = {Sorbonne University, Paris, France},
year = {2022},
url = {https://tel.archives-ouvertes.fr/tel-04027735},
timestamp = {Sun, 26 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/hal/Saulpic22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aarc/GornovAZS22,
author = {Alexandr Yu. Gornov and
Anton S. Anikin and
Tatiana S. Zarodnyuk and
Pavel Sorokovikov},
title = {Modification of the Confidence Bar Algorithm Based on Approximations
of the Main Diagonal of the Hessian Matrix for Solving Optimal Control
Problems},
journal = {Autom. Remote. Control.},
volume = {83},
number = {10},
pages = {1590--1599},
year = {2022},
url = {https://doi.org/10.1134/S00051179220100113},
doi = {10.1134/S00051179220100113},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aarc/GornovAZS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/Trejo-SanchezSG22,
author = {Joel Antonio Trejo{-}S{\'{a}}nchez and
Candelaria Elizabeth Sansores{-}P{\'{e}}rez and
Jesus Garcia{-}Diaz and
Jos{\'{e}} Alberto Fernndez{-}Zepeda},
title = {Approximation Algorithm for the Minimum Hub Cover Set Problem},
journal = {{IEEE} Access},
volume = {10},
pages = {51419--51427},
year = {2022},
url = {https://doi.org/10.1109/ACCESS.2022.3173615},
doi = {10.1109/ACCESS.2022.3173615},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/Trejo-SanchezSG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/YahayaKACAS22,
author = {Mahmoud Muhammad Yahaya and
Poom Kumam and
Aliyu Muhammed Awwal and
Parin Chaipunya and
Sani Aji and
Sani Salisu},
title = {A New Generalized Quasi-Newton Algorithm Based on Structured Diagonal
Hessian Approximation for Solving Nonlinear Least-Squares Problems
With Application to 3DOF Planar Robot Arm Manipulator},
journal = {{IEEE} Access},
volume = {10},
pages = {10816--10826},
year = {2022},
url = {https://doi.org/10.1109/ACCESS.2022.3144875},
doi = {10.1109/ACCESS.2022.3144875},
timestamp = {Fri, 04 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/access/YahayaKACAS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/ZorkunSR22,
author = {Aral Ertug Zorkun and
Miguel Alejandro Salas{-}Natera and
Ram{\'{o}}n Mart{\'{\i}}nez Rodr{\'{\i}}guez{-}Osorio},
title = {Improved Iterative Inverse Matrix Approximation Algorithm for Zero
Forcing Precoding in Large Antenna Arrays},
journal = {{IEEE} Access},
volume = {10},
pages = {100964--100975},
year = {2022},
url = {https://doi.org/10.1109/ACCESS.2022.3208155},
doi = {10.1109/ACCESS.2022.3208155},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/ZorkunSR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adcm/SaibabaMK22,
author = {Arvind K. Saibaba and
Rachel Minster and
Misha E. Kilmer},
title = {Efficient randomized tensor-based algorithms for function approximation
and low-rank kernel interactions},
journal = {Adv. Comput. Math.},
volume = {48},
number = {5},
pages = {66},
year = {2022},
url = {https://doi.org/10.1007/s10444-022-09979-7},
doi = {10.1007/S10444-022-09979-7},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/adcm/SaibabaMK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/afp/Karayel22d,
author = {Emin Karayel},
title = {Formalization of Randomized Approximation Algorithms for Frequency
Moments},
journal = {Arch. Formal Proofs},
volume = {2022},
year = {2022},
url = {https://www.isa-afp.org/entries/Frequency\_Moments.html},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/afp/Karayel22d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AhnKL22,
author = {Jungho Ahn and
Eun Jung Kim and
Euiwoong Lee},
title = {Towards Constant-Factor Approximation for Chordal/Distance-Hereditary
Vertex Deletion},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2106--2133},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00963-7},
doi = {10.1007/S00453-022-00963-7},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AhnKL22.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/BosmanEJMRS22,
author = {Thomas Bosman and
Martijn van Ee and
Yang Jiao and
Alberto Marchetti{-}Spaccamela and
R. Ravi and
Leen Stougie},
title = {Approximation Algorithms for Replenishment Problems with Fixed Turnover
Times},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2597--2621},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00974-4},
doi = {10.1007/S00453-022-00974-4},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BosmanEJMRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChengM22,
author = {Siu{-}Wing Cheng and
Yuchen Mao},
title = {Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1835--1874},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00942-y},
doi = {10.1007/S00453-022-00942-Y},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChengM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Elbassioni22,
author = {Khaled M. Elbassioni},
title = {Approximation Algorithms for Cost-robust Discrete Minimization Problems
Based on their LP-Relaxations},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3622--3654},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00987-z},
doi = {10.1007/S00453-022-00987-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Elbassioni22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FanRB22,
author = {Chenglin Fan and
Benjamin Raichel and
Gregory Van Buskirk},
title = {Metric Violation Distance: Hardness and Approximation},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1441--1465},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00940-0},
doi = {10.1007/S00453-022-00940-0},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FanRB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HungK22,
author = {Eunpyeong Hung and
Mong{-}Jen Kao},
title = {Approximation Algorithm for Vertex Cover with Multiple Covering Constraints},
journal = {Algorithmica},
volume = {84},
number = {1},
pages = {1--12},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00885-w},
doi = {10.1007/S00453-021-00885-W},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HungK22.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/algorithmica/RahgoshayS22,
author = {Mirmahdi Rahgoshay and
Mohammad R. Salavatipour},
title = {Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource
Minimization for Fire Containment},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2462--2479},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00972-6},
doi = {10.1007/S00453-022-00972-6},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RahgoshayS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/IntawichaiC22,
author = {Siriwan Intawichai and
Saifon Chaturantabut},
title = {A Missing Data Reconstruction Method Using an Accelerated Least-Squares
Approximation with Randomized {SVD}},
journal = {Algorithms},
volume = {15},
number = {6},
pages = {190},
year = {2022},
url = {https://doi.org/10.3390/a15060190},
doi = {10.3390/A15060190},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/IntawichaiC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/LartigueDA22,
author = {Thomas Lartigue and
Stanley Durrleman and
St{\'{e}}phanie Allassonni{\`{e}}re},
title = {Deterministic Approximate {EM} Algorithm; Application to the Riemann
Approximation {EM} and the Tempered {EM}},
journal = {Algorithms},
volume = {15},
number = {3},
pages = {78},
year = {2022},
url = {https://doi.org/10.3390/a15030078},
doi = {10.3390/A15030078},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/LartigueDA22.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/algorithms/Sepulveda-Garcia22,
author = {Sim{\'{o}}n Sep{\'{u}}lveda{-}Garc{\'{\i}}a and
Oscar Danilo Montoya and
Alejandro Garc{\'{e}}s},
title = {Power Flow Solution in Bipolar {DC} Networks Considering a Neutral
Wire and Unbalanced Loads: {A} Hyperbolic Approximation},
journal = {Algorithms},
volume = {15},
number = {10},
pages = {341},
year = {2022},
url = {https://doi.org/10.3390/a15100341},
doi = {10.3390/A15100341},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/Sepulveda-Garcia22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/YildizSN22,
author = {Sihmehmet Yildiz and
Hayriye Pehlivan Solak and
Melike Nikbay},
title = {Multi-Fidelity Low-Rank Approximations for Uncertainty Quantification
of a Supersonic Aircraft Design},
journal = {Algorithms},
volume = {15},
number = {7},
pages = {250},
year = {2022},
url = {https://doi.org/10.3390/a15070250},
doi = {10.3390/A15070250},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/YildizSN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/ZeileWS22,
author = {Clemens Zeile and
Tobias Weber and
Sebastian Sager},
title = {Combinatorial Integral Approximation Decompositions for Mixed-Integer
Optimal Control},
journal = {Algorithms},
volume = {15},
number = {4},
pages = {121},
year = {2022},
url = {https://doi.org/10.3390/a15040121},
doi = {10.3390/A15040121},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/ZeileWS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/ZvonarevG22,
author = {Nikita Zvonarev and
Nina Golyandina},
title = {Mixed Alternating Projections with Application to Hankel Low-Rank
Approximation},
journal = {Algorithms},
volume = {15},
number = {12},
pages = {460},
year = {2022},
url = {https://doi.org/10.3390/a15120460},
doi = {10.3390/A15120460},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/ZvonarevG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/SilvaKRW22,
author = {Luiz Augusto G. Silva and
Luis Antonio Brasil Kowada and
Nora{\'{\i}} Romeu Rocco and
Maria Em{\'{\i}}lia M. T. Walter},
title = {A new 1.375-approximation algorithm for sorting by transpositions},
journal = {Algorithms Mol. Biol.},
volume = {17},
number = {1},
pages = {1},
year = {2022},
url = {https://doi.org/10.1186/s13015-022-00205-z},
doi = {10.1186/S13015-022-00205-Z},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/SilvaKRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amcs/Junosza-Szaniawski22,
author = {Konstanty Junosza{-}Szaniawski and
Dariusz Nogalski and
Pawel Rzazewski},
title = {Exact and Approximation Algorithms for Sensor Placement Against DDoS
Attacks},
journal = {Int. J. Appl. Math. Comput. Sci.},
volume = {32},
number = {1},
pages = {35--49},
year = {2022},
url = {https://doi.org/10.34768/amcs-2022-0004},
doi = {10.34768/AMCS-2022-0004},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amcs/Junosza-Szaniawski22.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/apjor/LuoWX22,
author = {Yunxin Luo and
Chenchen Wu and
Chunming Xu},
title = {Approximation Algorithms for Non-Submodular Optimization Over Sliding
Windows},
journal = {Asia Pac. J. Oper. Res.},
volume = {39},
number = {5},
pages = {2150038:1--2150038:20},
year = {2022},
url = {https://doi.org/10.1142/S021759592150038X},
doi = {10.1142/S021759592150038X},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/LuoWX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/axioms/IzadiSA22,
author = {Mohammad Izadi and
Hari M. Srivastava and
Waleed Adel},
title = {An Effective Approximation Algorithm for Second-Order Singular Functional
Differential Equations},
journal = {Axioms},
volume = {11},
number = {3},
pages = {133},
year = {2022},
url = {https://doi.org/10.3390/axioms11030133},
doi = {10.3390/AXIOMS11030133},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/axioms/IzadiSA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/axioms/ZhangYXX22,
author = {Wenhui Zhang and
Peixin Ye and
Shuo Xing and
Xu Xu},
title = {Optimality of the Approximation and Learning by the Rescaled Pure
Super Greedy Algorithms},
journal = {Axioms},
volume = {11},
number = {9},
pages = {437},
year = {2022},
url = {https://doi.org/10.3390/axioms11090437},
doi = {10.3390/AXIOMS11090437},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/axioms/ZhangYXX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bib/HuZS22,
author = {Jialu Hu and
Yuanke Zhong and
Xuequn Shang},
title = {A versatile and scalable single-cell data integration algorithm based
on domain-adversarial and variational approximation},
journal = {Briefings Bioinform.},
volume = {23},
number = {1},
year = {2022},
url = {https://doi.org/10.1093/bib/bbab400},
doi = {10.1093/BIB/BBAB400},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bib/HuZS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/AmatASY22,
author = {Sergio Amat and
Juan Ruiz {\'{A}}lvarez and
Chi{-}Wang Shu and
Dionisio F. Y{\'{a}}{\~{n}}ez},
title = {On the approximation of derivative values using a {WENO} algorithm
with progressive order of accuracy close to discontinuities},
journal = {Comput. Appl. Math.},
volume = {41},
number = {6},
year = {2022},
url = {https://doi.org/10.1007/s40314-022-02004-z},
doi = {10.1007/S40314-022-02004-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cam/AmatASY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/ZhangGHL22,
author = {Jiaxuan Zhang and
Suogang Gao and
Bo Hou and
Wen Liu},
title = {An approximation algorithm for the group prize-collecting Steiner
tree problem with submodular penalties},
journal = {Comput. Appl. Math.},
volume = {41},
number = {6},
year = {2022},
url = {https://doi.org/10.1007/s40314-022-01984-2},
doi = {10.1007/S40314-022-01984-2},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cam/ZhangGHL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/Zhao22,
author = {Jianxi Zhao},
title = {A novel low-rank matrix approximation algorithm for face denoising
and background/foreground separation},
journal = {Comput. Appl. Math.},
volume = {41},
number = {4},
year = {2022},
url = {https://doi.org/10.1007/s40314-022-01871-w},
doi = {10.1007/S40314-022-01871-W},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cam/Zhao22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cam/ZhaoWLZ22,
author = {Xuanyi Zhao and
Ying Wang and
Jinggai Li and
Chungang Zhu},
title = {Algorithms for computing the approximation of offsets of toric B{\'{e}}zier
curves},
journal = {Comput. Appl. Math.},
volume = {41},
number = {5},
year = {2022},
url = {https://doi.org/10.1007/s40314-022-01941-z},
doi = {10.1007/S40314-022-01941-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cam/ZhaoWLZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cee/GaoGL22,
author = {Xuening Gao and
Longkun Guo and
Kewen Liao},
title = {Efficient approximation algorithms for offline and online unit disk
multiple coverage},
journal = {Comput. Electr. Eng.},
volume = {104},
number = {Part},
pages = {108444},
year = {2022},
url = {https://doi.org/10.1016/j.compeleceng.2022.108444},
doi = {10.1016/J.COMPELECENG.2022.108444},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cee/GaoGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/chinaf/WuSGZHW22,
author = {Xiaoliang Wu and
Feng Shi and
Yutian Guo and
Zhen Zhang and
Junyu Huang and
Jianxin Wang},
title = {An approximation algorithm for lower-bounded k-median with constant
factor},
journal = {Sci. China Inf. Sci.},
volume = {65},
number = {4},
year = {2022},
url = {https://doi.org/10.1007/s11432-021-3411-7},
doi = {10.1007/S11432-021-3411-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/chinaf/WuSGZHW22.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/computation/Dai22,
author = {Han Dai},
title = {An Improved Approximation Algorithm for the Minimum Power Cover Problem
with Submodular Penalty},
journal = {Comput.},
volume = {10},
number = {10},
pages = {189},
year = {2022},
url = {https://doi.org/10.3390/computation10100189},
doi = {10.3390/COMPUTATION10100189},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computation/Dai22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/concurrency/KavakliogluC22,
author = {Can Kavaklioglu and
Mucahit Cevik},
title = {Scalable grid-based approximation algorithms for partially observable
Markov decision processes},
journal = {Concurr. Comput. Pract. Exp.},
volume = {34},
number = {5},
year = {2022},
url = {https://doi.org/10.1002/cpe.6743},
doi = {10.1002/CPE.6743},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/concurrency/KavakliogluC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cssp/MouhouB22,
author = {Abdelaziz Mouhou and
Abdelmajid Badri},
title = {Low Integer-Order Approximation of Fractional-Order Systems Using
Grey Wolf Optimizer-Based Cuckoo Search Algorithm},
journal = {Circuits Syst. Signal Process.},
volume = {41},
number = {4},
pages = {1869--1894},
year = {2022},
url = {https://doi.org/10.1007/s00034-021-01872-w},
doi = {10.1007/S00034-021-01872-W},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cssp/MouhouB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cssp/VB22,
author = {Hareesh V. and
T. S. Bindiya},
title = {Design of Hardware Efficient Reconfigurable Merged Partial Cosine
Modulated Non-uniform Filter Bank Channelizer and its Power Efficient
Implementation Using a Novel Approximation Algorithm},
journal = {Circuits Syst. Signal Process.},
volume = {41},
number = {4},
pages = {2118--2135},
year = {2022},
url = {https://doi.org/10.1007/s00034-021-01877-5},
doi = {10.1007/S00034-021-01877-5},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cssp/VB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cuza/Czeizler0P22,
author = {Eugen Czeizler and
Alexandru Popa and
Victor Popescu},
title = {Fixed Parameter Algorithms and Hardness of Approximation Results for
the Structural Target Controllability Problem},
journal = {Sci. Ann. Comput. Sci.},
volume = {32},
number = {1},
pages = {109--136},
year = {2022},
url = {https://doi.org/10.7561/SACS.2022.1.109},
doi = {10.7561/SACS.2022.1.109},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cuza/Czeizler0P22.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 = {Fri, 13 May 2022 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/dam/ArifBGK22,
author = {Umair Arif and
Robert Benkoczi and
Daya Ram Gaur and
Ramesh Krishnamurti},
title = {A primal-dual approximation algorithm for Minsat},
journal = {Discret. Appl. Math.},
volume = {319},
pages = {372--381},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.07.016},
doi = {10.1016/J.DAM.2021.07.016},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ArifBGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KoppeW22,
author = {Matthias K{\"{o}}ppe and
Jiawei Wang},
title = {Dual-feasible functions for integer programming and combinatorial
optimization: Algorithms, characterizations, and approximations},
journal = {Discret. Appl. Math.},
volume = {308},
pages = {84--106},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2019.11.021},
doi = {10.1016/J.DAM.2019.11.021},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KoppeW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaoYLX22,
author = {Yuying Mao and
Wei Yu and
Zhaohui Liu and
Jiafeng Xiong},
title = {Approximation algorithms for some Minimum Postmen Cover Problems},
journal = {Discret. Appl. Math.},
volume = {319},
pages = {382--393},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.01.005},
doi = {10.1016/J.DAM.2022.01.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/MaoYLX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/AbubakarS22,
author = {Saidu Isah Abubakar and
Sadiq Shehu},
title = {Exploiting the security of {N} = prqs through approximation of {\(\phi\)}(N)},
journal = {Discret. Math. Algorithms Appl.},
volume = {14},
number = {4},
pages = {2150144:1--2150144:19},
year = {2022},
url = {https://doi.org/10.1142/S1793830921501445},
doi = {10.1142/S1793830921501445},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/AbubakarS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/GavrilSZ22,
author = {Fanica Gavril and
Mordechai Shalom and
Shmuel Zaks},
title = {Approximation algorithms for maximum weight k-coverings of graphs
by packings},
journal = {Discret. Math. Algorithms Appl.},
volume = {14},
number = {1},
pages = {2150099:1--2150099:14},
year = {2022},
url = {https://doi.org/10.1142/S1793830921500993},
doi = {10.1142/S1793830921500993},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/GavrilSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Kim22,
author = {Eunmi Kim},
title = {Deep learning-based approximation of Goldbach partition function},
journal = {Discret. Math. Algorithms Appl.},
volume = {14},
number = {5},
pages = {2150152:1--2150152:9},
year = {2022},
url = {https://doi.org/10.1142/S1793830921501524},
doi = {10.1142/S1793830921501524},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/Kim22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/Subramanian22,
author = {C. R. Subramanian},
title = {Inductive graph invariants and approximation algorithms},
journal = {Discret. Math. Algorithms Appl.},
volume = {14},
number = {6},
pages = {2250019:1--2250019:36},
year = {2022},
url = {https://doi.org/10.1142/S1793830922500197},
doi = {10.1142/S1793830922500197},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmaa/Subramanian22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ewc/FengLHLF22,
author = {Ruihan Feng and
Yang Liu and
Yaxin Hou and
Hong Li and
Zhichao Fang},
title = {Mixed element algorithm based on a second-order time approximation
scheme for a two-dimensional nonlinear time fractional coupled sub-diffusion
model},
journal = {Eng. Comput.},
volume = {38},
number = {1},
pages = {51--68},
year = {2022},
url = {https://doi.org/10.1007/s00366-020-01032-9},
doi = {10.1007/S00366-020-01032-9},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ewc/FengLHLF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ficn/ZenilMT22,
author = {Hector Zenil and
James A. R. Marshall and
Jesper Tegn{\'{e}}r},
title = {Approximations of algorithmic and structural complexity validate cognitive-behavioral
experimental results},
journal = {Frontiers Comput. Neurosci.},
volume = {16},
year = {2022},
url = {https://doi.org/10.3389/fncom.2022.956074},
doi = {10.3389/FNCOM.2022.956074},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ficn/ZenilMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieeenl/ChatterjeeSO22,
author = {Bijoy Chand Chatterjee and
Basavaprabhu S and
Eiji Oki},
title = {{BPA:} Approximation Batch-Processing Algorithm for Static Lightpath
Requests in Elastic Optical Networks},
journal = {{IEEE} Netw. Lett.},
volume = {4},
number = {4},
pages = {189--193},
year = {2022},
url = {https://doi.org/10.1109/LNET.2022.3211150},
doi = {10.1109/LNET.2022.3211150},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieeenl/ChatterjeeSO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcisys/ZhangZZLZ22,
author = {Yunhui Zhang and
Yongquan Zhou and
Guo Zhou and
Qifang Luo and
Binwen Zhu},
title = {A Curve Approximation Approach Using Bio-inspired Polar Coordinate
Bald Eagle Search Algorithm},
journal = {Int. J. Comput. Intell. Syst.},
volume = {15},
number = {1},
pages = {30},
year = {2022},
url = {https://doi.org/10.1007/s44196-022-00084-7},
doi = {10.1007/S44196-022-00084-7},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcisys/ZhangZZLZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/HermansLM22,
author = {Ben Hermans and
Roel Leus and
Jannik Matuschke},
title = {Exact and Approximation Algorithms for the Expanding Search Problem},
journal = {{INFORMS} J. Comput.},
volume = {34},
number = {1},
pages = {281--296},
year = {2022},
url = {https://doi.org/10.1287/ijoc.2020.1047},
doi = {10.1287/IJOC.2020.1047},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/HermansLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Xin22,
author = {Linwei Xin},
title = {1.79-Approximation Algorithms for Continuous Review Single-Sourcing
Lost-Sales and Dual-Sourcing Inventory Models},
journal = {Oper. Res.},
volume = {70},
number = {1},
pages = {111--128},
year = {2022},
url = {https://doi.org/10.1287/opre.2021.2150},
doi = {10.1287/OPRE.2021.2150},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ior/Xin22.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/ipl/YuL22,
author = {Wei Yu and
Zhaohui Liu},
title = {Approximation and polynomial algorithms for the data mule scheduling
with handling time and time span constraints},
journal = {Inf. Process. Lett.},
volume = {178},
pages = {106299},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2022.106299},
doi = {10.1016/J.IPL.2022.106299},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Kolomoitsev22,
author = {Yurii Kolomoitsev},
title = {Approximation by quasi-interpolation operators and Smolyak's algorithm},
journal = {J. Complex.},
volume = {69},
pages = {101601},
year = {2022},
url = {https://doi.org/10.1016/j.jco.2021.101601},
doi = {10.1016/J.JCO.2021.101601},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Kolomoitsev22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/DehghanS22,
author = {Mehdi Dehghan and
Akbar Shirilord},
title = {A new approximation algorithm for solving generalized Lyapunov matrix
equations},
journal = {J. Comput. Appl. Math.},
volume = {404},
pages = {113898},
year = {2022},
url = {https://doi.org/10.1016/j.cam.2021.113898},
doi = {10.1016/J.CAM.2021.113898},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcam/DehghanS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/JiangQ22,
author = {Nan Jiang and
Changxin Qiu},
title = {Numerical analysis of a second order ensemble algorithm for numerical
approximation of stochastic Stokes-Darcy equations},
journal = {J. Comput. Appl. Math.},
volume = {406},
pages = {113934},
year = {2022},
url = {https://doi.org/10.1016/j.cam.2021.113934},
doi = {10.1016/J.CAM.2021.113934},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcam/JiangQ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/ZamanSKA22,
author = {Sakhi Zaman and
Siraj{-}ul{-}Islam and
Muhammad Munib Khan and
Imtiaz Ahmad},
title = {New algorithms for approximation of Bessel transforms with high frequency
parameter},
journal = {J. Comput. Appl. Math.},
volume = {399},
pages = {113705},
year = {2022},
url = {https://doi.org/10.1016/j.cam.2021.113705},
doi = {10.1016/J.CAM.2021.113705},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcam/ZamanSKA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcloudc/Choi22,
author = {Deok{-}Kee Choi},
title = {Fog computing application of cyber-physical models of IoT devices
with symbolic approximation algorithms},
journal = {J. Cloud Comput.},
volume = {11},
pages = {63},
year = {2022},
url = {https://doi.org/10.1186/s13677-022-00337-y},
doi = {10.1186/S13677-022-00337-Y},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcloudc/Choi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BazganBG22,
author = {Cristina Bazgan and
Paul Beaujean and
{\'{E}}ric Gourdin},
title = {An approximation algorithm for the maximum spectral subgraph problem},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1880--1899},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00552-w},
doi = {10.1007/S10878-020-00552-W},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BazganBG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BazganHRTV22,
author = {Cristina Bazgan and
Arne Herzel and
Stefan Ruzika and
Clemens Thielen and
Daniel Vanderpooten},
title = {An approximation algorithm for a general class of parametric optimization
problems},
journal = {J. Comb. Optim.},
volume = {43},
number = {5},
pages = {1328--1358},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00646-5},
doi = {10.1007/S10878-020-00646-5},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BazganHRTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCCLLZ22,
author = {Guangting Chen and
Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin and
Tian Liu and
An Zhang},
title = {Approximation algorithms for the maximally balanced connected graph
tripartition problem},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1753--1773},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00544-w},
doi = {10.1007/S10878-020-00544-W},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenCCLLZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenGLLSTXZ22,
author = {Yong Chen and
Randy Goebel and
Guohui Lin and
Longcheng Liu and
Bing Su and
Weitian Tong and
Yao Xu and
An Zhang},
title = {A local search 4/3-approximation algorithm for the minimum 3-path
partition problem},
journal = {J. Comb. Optim.},
volume = {44},
number = {5},
pages = {3595--3610},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00915-5},
doi = {10.1007/S10878-022-00915-5},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenGLLSTXZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenZWD22,
author = {Weidong Chen and
Hao Zhong and
Lidong Wu and
Ding{-}Zhu Du},
title = {A general greedy approximation algorithm for finding minimum positive
influence dominating sets in social networks},
journal = {J. Comb. Optim.},
volume = {44},
number = {1},
pages = {1--20},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00812-3},
doi = {10.1007/S10878-021-00812-3},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenZWD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GongGLM22,
author = {Mingyang Gong and
Randy Goebel and
Guohui Lin and
Eiji Miyano},
title = {Improved approximation algorithms for non-preemptive multiprocessor
scheduling with testing},
journal = {J. Comb. Optim.},
volume = {44},
number = {1},
pages = {877--893},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00865-y},
doi = {10.1007/S10878-022-00865-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GongGLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuanW22,
author = {Lihe Guan and
Hong Wang},
title = {A heuristic approximation algorithm of minimum dominating set based
on rough set theory},
journal = {J. Comb. Optim.},
volume = {44},
number = {1},
pages = {752--769},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00834-x},
doi = {10.1007/S10878-021-00834-X},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuanW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanXDZ22,
author = {Lu Han and
Dachuan Xu and
Donglei Du and
Dongmei Zhang},
title = {An approximation algorithm for the uniform capacitated k-means problem},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1812--1823},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00550-y},
doi = {10.1007/S10878-020-00550-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanXDZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HelfrichHRT22,
author = {Stephan Helfrich and
Arne Herzel and
Stefan Ruzika and
Clemens Thielen},
title = {An approximation algorithm for a general class of multi-parametric
optimization problems},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1459--1494},
year = {2022},
url = {https://doi.org/10.1007/s10878-022-00902-w},
doi = {10.1007/S10878-022-00902-W},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HelfrichHRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JiXLW22,
author = {Sai Ji and
Dachuan Xu and
Min Li and
Yishui Wang},
title = {Approximation algorithms for two variants of correlation clustering
problem},
journal = {J. Comb. Optim.},
volume = {43},
number = {5},
pages = {933--952},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00612-1},
doi = {10.1007/S10878-020-00612-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JiXLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LichenLLY22,
author = {Junran Lichen and
Jianping Li and
Ko{-}Wei Lih and
Xingxing Yu},
title = {Approximation algorithms for constructing required subgraphs using
stock pieces of fixed length},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1774--1795},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00543-x},
doi = {10.1007/S10878-020-00543-X},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LichenLLY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuL22,
author = {Xiaofei Liu and
Weidong Li},
title = {Combinatorial approximation algorithms for the submodular multicut
problem in trees with submodular penalties},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1964--1976},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00568-2},
doi = {10.1007/S10878-020-00568-2},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuL22.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/SunSSDZ22,
author = {Jian Sun and
Haiyun Sheng and
Yuefang Sun and
Donglei Du and
Xiaoyan Zhang},
title = {Approximation algorithms for stochastic set cover and single sink
rent-or-buy with submodular penalty},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2626--2641},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00753-x},
doi = {10.1007/S10878-021-00753-X},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/SunSSDZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangLCHP22,
author = {Yinling Wang and
Yan Lan and
Xin Chen and
Xin Han and
Yong Piao},
title = {A tight approximation algorithm for problem {\textdollar}P2{\textbackslash}rightarrow
D{\(\vert\)}v=1, c=1{\(\vert\)}C{\_}\{{\textbackslash}max \}{\textdollar}},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2195--2206},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00593-1},
doi = {10.1007/S10878-020-00593-1},
timestamp = {Mon, 24 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WangLCHP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WangWZZ22,
author = {Yishui Wang and
Chenchen Wu and
Dongmei Zhang and
Juan Zou},
title = {An approximation algorithm for the spherical k-means problem with
outliers by local search},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2410--2422},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00734-0},
doi = {10.1007/S10878-021-00734-0},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WangWZZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuDK22,
author = {Chenchen Wu and
Donglei Du and
Yue Kang},
title = {An approximation algorithm for stochastic multi-level facility location
problem with soft capacities},
journal = {J. Comb. Optim.},
volume = {44},
number = {3},
pages = {1680--1692},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00538-8},
doi = {10.1007/S10878-020-00538-8},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuDK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangDGMS22,
author = {Xiaoyan Zhang and
Donglei Du and
Gregory Z. Gutin and
Qiaoxia Ming and
Jian Sun},
title = {Approximation algorithms with constant ratio for general cluster routing
problems},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2499--2514},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00772-8},
doi = {10.1007/S10878-021-00772-8},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhangDGMS22.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/jco/ZhangZB22,
author = {Long Zhang and
Yuzhong Zhang and
Qingguo Bai},
title = {An approximation algorithm for a supply-chain scheduling problem with
an assignable common due window and holding time},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2167--2179},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00594-0},
doi = {10.1007/S10878-020-00594-0},
timestamp = {Thu, 27 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangZB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhengGLWDH22,
author = {Hongye Zheng and
Suogang Gao and
Wen Liu and
Weili Wu and
Ding{-}Zhu Du and
Bo Hou},
title = {Approximation algorithm for the parallel-machine scheduling problem
with release dates and submodular rejection penalties},
journal = {J. Comb. Optim.},
volume = {44},
number = {1},
pages = {343--353},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00842-x},
doi = {10.1007/S10878-021-00842-X},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZhengGLWDH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcphy/YuZZZ22,
author = {Bing Yu and
Xiangcheng Zheng and
Pingwen Zhang and
Lei Zhang},
title = {Computing solution landscape of nonlinear space-fractional problems
via fast approximation algorithm},
journal = {J. Comput. Phys.},
volume = {468},
pages = {111513},
year = {2022},
url = {https://doi.org/10.1016/j.jcp.2022.111513},
doi = {10.1016/J.JCP.2022.111513},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcphy/YuZZZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DengLR22,
author = {Shichuan Deng and
Jian Li and
Yuval Rabani},
title = {Approximation algorithms for clustering with dynamic points},
journal = {J. Comput. Syst. Sci.},
volume = {130},
pages = {43--70},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.07.001},
doi = {10.1016/J.JCSS.2022.07.001},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DengLR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FairsteinKNRS22,
author = {Yaron Fairstein and
Ariel Kulik and
Joseph (Seffi) Naor and
Danny Raz and
Hadas Shachnai},
title = {An almost optimal approximation algorithm for monotone submodular
multiple knapsack},
journal = {J. Comput. Syst. Sci.},
volume = {125},
pages = {149--165},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.11.005},
doi = {10.1016/J.JCSS.2021.11.005},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FairsteinKNRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KadivarM22,
author = {Mehdi Kadivar and
Neda Mohammadi},
title = {A maximum clique based approximation algorithm for wireless link scheduling
under {SINR} model},
journal = {J. Comput. Syst. Sci.},
volume = {129},
pages = {72--89},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2022.05.001},
doi = {10.1016/J.JCSS.2022.05.001},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/KadivarM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jfi/DaiWKJL22,
author = {Jinyu Dai and
Zhengtian Wu and
Hamid Reza Karimi and
Baoping Jiang and
Guangquan Lu},
title = {An approximation lagrangian-based algorithm for the maximum clique
problem via deterministic annealing neural network},
journal = {J. Frankl. Inst.},
volume = {359},
number = {12},
pages = {6080--6098},
year = {2022},
url = {https://doi.org/10.1016/j.jfranklin.2022.06.009},
doi = {10.1016/J.JFRANKLIN.2022.06.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jfi/DaiWKJL22.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/BernalPKG22,
author = {David E. Bernal and
Zedong Peng and
Jan Kronqvist and
Ignacio E. Grossmann},
title = {Alternative regularizations for Outer-Approximation algorithms for
convex {MINLP}},
journal = {J. Glob. Optim.},
volume = {84},
number = {4},
pages = {807--842},
year = {2022},
url = {https://doi.org/10.1007/s10898-022-01178-4},
doi = {10.1007/S10898-022-01178-4},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/BernalPKG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/Demetriou22,
author = {Ioannis C. Demetriou},
title = {A binary search algorithm for univariate data approximation and estimation
of extrema by piecewise monotonic constraints},
journal = {J. Glob. Optim.},
volume = {82},
number = {4},
pages = {691--726},
year = {2022},
url = {https://doi.org/10.1007/s10898-021-01042-x},
doi = {10.1007/S10898-021-01042-X},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/Demetriou22.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/jgo/LiWLLP22,
author = {Jianping Li and
Wencheng Wang and
Junran Lichen and
Suding Liu and
Pengxiang Pan},
title = {Approximation algorithms for solving the line-capacitated minimum
Steiner tree problem},
journal = {J. Glob. Optim.},
volume = {84},
number = {3},
pages = {687--714},
year = {2022},
url = {https://doi.org/10.1007/s10898-022-01163-x},
doi = {10.1007/S10898-022-01163-X},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/LiWLLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/MaoY22,
author = {Xianpeng Mao and
Yuning Yang},
title = {Several approximation algorithms for sparse best rank-1 approximation
to higher-order tensors},
journal = {J. Glob. Optim.},
volume = {84},
number = {1},
pages = {229--253},
year = {2022},
url = {https://doi.org/10.1007/s10898-022-01140-4},
doi = {10.1007/S10898-022-01140-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/MaoY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocs/MaY22,
author = {Linjian Ma and
Chao Yang},
title = {Low rank approximation in simulations of quantum algorithms},
journal = {J. Comput. Sci.},
volume = {59},
pages = {101561},
year = {2022},
url = {https://doi.org/10.1016/j.jocs.2022.101561},
doi = {10.1016/J.JOCS.2022.101561},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocs/MaY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jossac/WuL22a,
author = {Yuanxiao Wu and
Xiwen Lu},
title = {A Tight Approximation Algorithm for Multi-Vehicle {CVRP} with Unsplittable
Demands on a Line},
journal = {J. Syst. Sci. Complex.},
volume = {35},
number = {5},
pages = {1902--1909},
year = {2022},
url = {https://doi.org/10.1007/s11424-022-0280-z},
doi = {10.1007/S11424-022-0280-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jossac/WuL22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/Yang22,
author = {Yuning Yang},
title = {On Approximation Algorithm for Orthogonal Low-Rank Tensor Approximation},
journal = {J. Optim. Theory Appl.},
volume = {194},
number = {3},
pages = {821--851},
year = {2022},
url = {https://doi.org/10.1007/s10957-022-02050-x},
doi = {10.1007/S10957-022-02050-X},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/Yang22.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/lmcs/EssmannNRS22,
author = {Robin E{\ss}mann and
Tobias Nipkow and
Simon Robillard and
Ujkan Sulejmani},
title = {Verified Approximation Algorithms},
journal = {Log. Methods Comput. Sci.},
volume = {18},
number = {1},
year = {2022},
url = {https://doi.org/10.46298/lmcs-18(1:36)2022},
doi = {10.46298/LMCS-18(1:36)2022},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/EssmannNRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mcss/SklyarBIR22,
author = {Grigory M. Sklyar and
Pavel Barkhayev and
Svetlana Yu. Ignatovich and
Viktor Rusakov},
title = {Implementation of the algorithm for constructing homogeneous approximations
of nonlinear control systems},
journal = {Math. Control. Signals Syst.},
volume = {34},
number = {4},
pages = {883--907},
year = {2022},
url = {https://doi.org/10.1007/s00498-022-00330-5},
doi = {10.1007/S00498-022-00330-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mcss/SklyarBIR22.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/mta/ShiLFXN22,
author = {Pengfei Shi and
Liang Lu and
Xinnan Fan and
Yuanxue Xin and
Jianjun Ni},
title = {A novel underwater sonar image enhancement algorithm based on approximation
spaces of random sets},
journal = {Multim. Tools Appl.},
volume = {81},
number = {4},
pages = {4569--4584},
year = {2022},
url = {https://doi.org/10.1007/s11042-020-10187-y},
doi = {10.1007/S11042-020-10187-Y},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mta/ShiLFXN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/BeckermannBL22,
author = {Bernhard Beckermann and
Joanna Bisch and
Robert Luce},
title = {On the rational approximation of Markov functions, with applications
to the computation of Markov functions of Toeplitz matrices},
journal = {Numer. Algorithms},
volume = {91},
number = {1},
pages = {109--144},
year = {2022},
url = {https://doi.org/10.1007/s11075-022-01256-4},
doi = {10.1007/S11075-022-01256-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/BeckermannBL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/CzyzewskaMP22,
author = {Natalia Czyzewska and
Pawel M. Morkisz and
Pawel Przybylowicz},
title = {Approximation of solutions of DDEs under nonstandard assumptions via
Euler scheme},
journal = {Numer. Algorithms},
volume = {91},
number = {4},
pages = {1829--1854},
year = {2022},
url = {https://doi.org/10.1007/s11075-022-01324-9},
doi = {10.1007/S11075-022-01324-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/CzyzewskaMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/EldenD22,
author = {Lars Eld{\'{e}}n and
Maryam Dehghan},
title = {A Krylov-Schur-like method for computing the best rank-(r\({}_{\mbox{1}}\),
r\({}_{\mbox{2}}\), r\({}_{\mbox{3}}\)) approximation of large and
sparse tensors},
journal = {Numer. Algorithms},
volume = {91},
number = {3},
pages = {1315--1347},
year = {2022},
url = {https://doi.org/10.1007/s11075-022-01303-0},
doi = {10.1007/S11075-022-01303-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/EldenD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/GergelitsNS22,
author = {Tom{\'{a}}s Gergelits and
Bj{\o}rn Fredrik Nielsen and
Zdenek Strakos},
title = {Numerical approximation of the spectrum of self-adjoint operators
in operator preconditioning},
journal = {Numer. Algorithms},
volume = {91},
number = {1},
pages = {301--325},
year = {2022},
url = {https://doi.org/10.1007/s11075-022-01263-5},
doi = {10.1007/S11075-022-01263-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/GergelitsNS22.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/Jawecki22,
author = {Tobias Jawecki},
title = {A study of defect-based error estimates for the Krylov approximation
of {\(\varphi\)}-functions},
journal = {Numer. Algorithms},
volume = {90},
number = {1},
pages = {323--361},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01190-x},
doi = {10.1007/S11075-021-01190-X},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Jawecki22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/JiangSZ22,
author = {Jie Jiang and
Hailin Sun and
Bin Zhou},
title = {Convergence analysis of sample average approximation for a class of
stochastic nonlinear complementarity problems: from two-stage to multistage},
journal = {Numer. Algorithms},
volume = {89},
number = {1},
pages = {167--194},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01110-z},
doi = {10.1007/S11075-021-01110-Z},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/JiangSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/PandeyV22,
author = {Kshitij Kumar Pandey and
P. Viswanathan},
title = {In reference to a self-referential approach towards smooth multivariate
approximation},
journal = {Numer. Algorithms},
volume = {91},
number = {1},
pages = {251--281},
year = {2022},
url = {https://doi.org/10.1007/s11075-022-01261-7},
doi = {10.1007/S11075-022-01261-7},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/PandeyV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/PlaskotaS22,
author = {Leszek Plaskota and
Pawel Samoraj},
title = {Automatic approximation using asymptotically optimal adaptive interpolation},
journal = {Numer. Algorithms},
volume = {89},
number = {1},
pages = {277--302},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01114-9},
doi = {10.1007/S11075-021-01114-9},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/PlaskotaS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/SiettosR22,
author = {Constantinos I. Siettos and
Lucia Russo},
title = {A numerical method for the approximation of stable and unstable manifolds
of microscopic simulators},
journal = {Numer. Algorithms},
volume = {89},
number = {3},
pages = {1335--1368},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01155-0},
doi = {10.1007/S11075-021-01155-0},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/SiettosR22.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/na/ZakyAHD22,
author = {Mahmoud A. Zaky and
Howayda Abo{-}Gabal and
Ramy M. Hafez and
Eid H. Doha},
title = {Computational and theoretical aspects of Romanovski-Bessel polynomials
and their applications in spectral approximations},
journal = {Numer. Algorithms},
volume = {89},
number = {4},
pages = {1567--1601},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01165-y},
doi = {10.1007/S11075-021-01165-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/ZakyAHD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/ZhuLZ22,
author = {Xiaogang Zhu and
Jimeng Li and
Yaping Zhang},
title = {A local RBFs-based {DQ} approximation for Riesz fractional derivatives
and its applications},
journal = {Numer. Algorithms},
volume = {90},
number = {1},
pages = {159--196},
year = {2022},
url = {https://doi.org/10.1007/s11075-021-01183-w},
doi = {10.1007/S11075-021-01183-W},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/ZhuLZ22.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/LiRZD22,
author = {Ke Li and
Yingli Ran and
Zhao Zhang and
Ding{-}Zhu Du},
title = {Nearly tight approximation algorithm for (connected) Roman dominating
set},
journal = {Optim. Lett.},
volume = {16},
number = {8},
pages = {2261--2276},
year = {2022},
url = {https://doi.org/10.1007/s11590-022-01862-0},
doi = {10.1007/S11590-022-01862-0},
timestamp = {Wed, 12 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LiRZD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LiuLX22,
author = {Xiaofei Liu and
Weidong Li and
Runtao Xie},
title = {A primal-dual approximation algorithm for the k-prize-collecting minimum
power cover problem},
journal = {Optim. Lett.},
volume = {16},
number = {8},
pages = {2373--2385},
year = {2022},
url = {https://doi.org/10.1007/s11590-021-01831-z},
doi = {10.1007/S11590-021-01831-Z},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/LiuLX22.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/ol/YangLY22,
author = {Yichen Yang and
Zhaohui Liu and
Wei Yu},
title = {Approximation algorithms for the k-depots Hamiltonian path problem},
journal = {Optim. Lett.},
volume = {16},
number = {4},
pages = {1215--1234},
year = {2022},
url = {https://doi.org/10.1007/s11590-021-01774-5},
doi = {10.1007/S11590-021-01774-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/YangLY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/LiuSW22,
author = {Xiao Liu and
Chungen Shen and
Li Wang},
title = {A dual active-set proximal Newton algorithm for sparse approximation
of correlation matrices},
journal = {Optim. Methods Softw.},
volume = {37},
number = {5},
pages = {1820--1844},
year = {2022},
url = {https://doi.org/10.1080/10556788.2021.1998491},
doi = {10.1080/10556788.2021.1998491},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/oms/LiuSW22.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/pami/LiuHCS22,
author = {Fanghui Liu and
Xiaolin Huang and
Yudong Chen and
Johan A. K. Suykens},
title = {Random Features for Kernel Approximation: {A} Survey on Algorithms,
Theory, and Beyond},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {44},
number = {10},
pages = {7128--7148},
year = {2022},
url = {https://doi.org/10.1109/TPAMI.2021.3097011},
doi = {10.1109/TPAMI.2021.3097011},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/LiuHCS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pc/AktilavO22,
author = {Busenur Aktilav and
Isil {\"{O}}z},
title = {Performance and accuracy predictions of approximation methods for
shortest-path algorithms on GPUs},
journal = {Parallel Comput.},
volume = {112},
pages = {102942},
year = {2022},
url = {https://doi.org/10.1016/j.parco.2022.102942},
doi = {10.1016/J.PARCO.2022.102942},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pc/AktilavO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/Foroughmand-Araabi22,
author = {Mohammad{-}Hadi Foroughmand{-}Araabi and
Sama Goliaei and
Alice C. McHardy},
title = {Scelestial: Fast and accurate single-cell lineage tree inference based
on a Steiner tree approximation algorithm},
journal = {PLoS Comput. Biol.},
volume = {18},
number = {8},
year = {2022},
url = {https://doi.org/10.1371/journal.pcbi.1009100},
doi = {10.1371/JOURNAL.PCBI.1009100},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/Foroughmand-Araabi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/questa/MeiB22,
author = {Rob van der Mei and
Sandjai Bhulai},
title = {A data-driven approach to deriving closed-form approximations for
queueing problems using genetic algorithms},
journal = {Queueing Syst. Theory Appl.},
volume = {100},
number = {3-4},
pages = {549--551},
year = {2022},
url = {https://doi.org/10.1007/s11134-022-09767-6},
doi = {10.1007/S11134-022-09767-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/questa/MeiB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ress/Yeh22b,
author = {Wei{-}Chang Yeh},
title = {Novel self-adaptive Monte Carlo simulation based on binary-addition-tree
algorithm for binary-state network reliability approximation},
journal = {Reliab. Eng. Syst. Saf.},
volume = {228},
pages = {108796},
year = {2022},
url = {https://doi.org/10.1016/j.ress.2022.108796},
doi = {10.1016/J.RESS.2022.108796},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ress/Yeh22b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Bhattacharjee22,
author = {Chinmoy Bhattacharjee},
title = {Gaussian approximation for rooted edges in a random minimal directed
spanning tree},
journal = {Random Struct. Algorithms},
volume = {61},
number = {3},
pages = {462--492},
year = {2022},
url = {https://doi.org/10.1002/rsa.21068},
doi = {10.1002/RSA.21068},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Bhattacharjee22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BhattacharyaFY22,
author = {Bhaswar B. Bhattacharya and
Xiao Fang and
Han Yan},
title = {Normal approximation and fourth moment theorems for monochromatic
triangles},
journal = {Random Struct. Algorithms},
volume = {60},
number = {1},
pages = {25--53},
year = {2022},
url = {https://doi.org/10.1002/rsa.21017},
doi = {10.1002/RSA.21017},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BhattacharyaFY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/LiuG22,
author = {Yang Liu and
Robert J. B. Goudie},
title = {Stochastic approximation cut algorithm for inference in modularized
Bayesian models},
journal = {Stat. Comput.},
volume = {32},
number = {1},
pages = {7},
year = {2022},
url = {https://doi.org/10.1007/s11222-021-10070-2},
doi = {10.1007/S11222-021-10070-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sac/LiuG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TraubV22,
author = {Vera Traub and
Jens Vygen},
title = {An Improved Approximation Algorithm for The Asymmetric Traveling Salesman
Problem},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {1},
pages = {139--173},
year = {2022},
url = {https://doi.org/10.1137/20m1339313},
doi = {10.1137/20M1339313},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TraubV22.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/soco/DasDM22,
author = {Rajeev Das and
Kedar Nath Das and
Saurabh Mallik},
title = {An improved quadratic approximation-based Jaya algorithm for two-echelon
fixed-cost transportation problem under uncertain environment},
journal = {Soft Comput.},
volume = {26},
number = {19},
pages = {10301--10320},
year = {2022},
url = {https://doi.org/10.1007/s00500-022-07344-w},
doi = {10.1007/S00500-022-07344-W},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/DasDM22.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/spl/Rusu22,
author = {Cristian Rusu},
title = {An Iterative Coordinate Descent Algorithm to Compute Sparse Low-Rank
Approximations},
journal = {{IEEE} Signal Process. Lett.},
volume = {29},
pages = {249--253},
year = {2022},
url = {https://doi.org/10.1109/lsp.2021.3132276},
doi = {10.1109/LSP.2021.3132276},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spl/Rusu22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcasII/VadhvanaYBG22,
author = {Sanket Vadhvana and
Shekhar Kumar Yadav and
Sankha Subhra Bhattacharjee and
Nithin V. George},
title = {An Improved Constrained {LMS} Algorithm for Fast Adaptive Beamforming
Based on a Low Rank Approximation},
journal = {{IEEE} Trans. Circuits Syst. {II} Express Briefs},
volume = {69},
number = {8},
pages = {3605--3609},
year = {2022},
url = {https://doi.org/10.1109/TCSII.2022.3157604},
doi = {10.1109/TCSII.2022.3157604},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcasII/VadhvanaYBG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tci/Abi-rizkOA22,
author = {Ralph Abi{-}rizk and
Fran{\c{c}}ois Orieux and
Alain Abergel},
title = {Super-Resolution Hyperspectral Reconstruction With Majorization-Minimization
Algorithm and Low-Rank Approximation},
journal = {{IEEE} Trans. Computational Imaging},
volume = {8},
pages = {260--272},
year = {2022},
url = {https://doi.org/10.1109/TCI.2022.3161849},
doi = {10.1109/TCI.2022.3161849},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tci/Abi-rizkOA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlimiDF22,
author = {Morteza Alimi and
Amir Daneshgar and
Mohammad{-}Hadi Foroughmand{-}Araabi},
title = {Mean isoperimetry with control on outliers: Exact and approximation
algorithms},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {348--365},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.022},
doi = {10.1016/J.TCS.2022.05.022},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlimiDF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaoXYS22,
author = {Xiaoguang Bao and
Lei Xu and
Wei Yu and
Wei Song},
title = {Approximation algorithms for the min-max clustered \emph{k}-traveling
salesmen problems},
journal = {Theor. Comput. Sci.},
volume = {933},
pages = {60--66},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.030},
doi = {10.1016/J.TCS.2022.08.030},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BaoXYS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGLPR22,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
title = {New approximation algorithms for the heterogeneous weighted delivery
problem},
journal = {Theor. Comput. Sci.},
volume = {932},
pages = {102--115},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.009},
doi = {10.1016/J.TCS.2022.08.009},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BiloGLPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DubloisLP22,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential
approximation},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {271--291},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.013},
doi = {10.1016/J.TCS.2022.05.013},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DubloisLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LemusAZQZ22,
author = {Vladimir Lemus and
Eduardo Acu{\~{n}}a{-}Yeomans and
V{\'{\i}}ctor Zamora and
Francisco Hern{\'{a}}ndez Quiroz and
Hector Zenil},
title = {Computable model discovery and high-level-programming approximations
to algorithmic complexity},
journal = {Theor. Comput. Sci.},
volume = {927},
pages = {31--41},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.026},
doi = {10.1016/J.TCS.2022.05.026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LemusAZQZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiangZ22,
author = {Wei Liang and
Zhao Zhang},
title = {Approximation algorithm for prize-collecting sweep cover with base
stations},
journal = {Theor. Comput. Sci.},
volume = {929},
pages = {1--10},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.06.026},
doi = {10.1016/J.TCS.2022.06.026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiangZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuLD22,
author = {Xiaofei Liu and
Weidong Li and
Han Dai},
title = {Approximation algorithms for the minimum power cover problem with
submodular/linear penalties},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {256--270},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.012},
doi = {10.1016/J.TCS.2022.05.012},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuLD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiaoY22,
author = {Runjie Miao and
Jinjiang Yuan},
title = {A note on LP-based approximation algorithms for capacitated facility
location problem},
journal = {Theor. Comput. Sci.},
volume = {932},
pages = {31--40},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.002},
doi = {10.1016/J.TCS.2022.08.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MiaoY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/XieFJZ22,
author = {Shengjun Xie and
Haodi Feng and
Haitao Jiang and
Daming Zhu},
title = {Approximation algorithms for sorting by bounded singleton moves},
journal = {Theor. Comput. Sci.},
volume = {917},
pages = {51--65},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.011},
doi = {10.1016/J.TCS.2022.03.011},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/XieFJZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tim/LiuTLYB22,
author = {Xuecong Liu and
Xichao Teng and
Zhang Li and
Qifeng Yu and
Yijie Bian},
title = {A Fast Algorithm for High Accuracy Airborne {SAR} Geolocation Based
on Local Linear Approximation},
journal = {{IEEE} Trans. Instrum. Meas.},
volume = {71},
pages = {1--12},
year = {2022},
url = {https://doi.org/10.1109/TIM.2022.3165255},
doi = {10.1109/TIM.2022.3165255},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tim/LiuTLYB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tits/HeZZK22,
author = {Dan He and
Thomas Zhou and
Xiaofang Zhou and
Jiwon Kim},
title = {An Efficient Algorithm for Maximum Trajectory Coverage Query With
Approximation Guarantee},
journal = {{IEEE} Trans. Intell. Transp. Syst.},
volume = {23},
number = {12},
pages = {24031--24043},
year = {2022},
url = {https://doi.org/10.1109/TITS.2022.3207499},
doi = {10.1109/TITS.2022.3207499},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tits/HeZZK22.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}
}
@article{DBLP:journals/tpds/BhattaM22,
author = {Dixit Bhatta and
Lena Mashayekhy},
title = {A Bifactor Approximation Algorithm for Cloudlet Placement in Edge
Computing},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {33},
number = {8},
pages = {1787--1798},
year = {2022},
url = {https://doi.org/10.1109/TPDS.2021.3126256},
doi = {10.1109/TPDS.2021.3126256},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/BhattaM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/IEEEcloud/BahreiniTY22,
author = {Tayebeh Bahreini and
Asser N. Tantawi and
Alaa Youssef},
editor = {Claudio Agostino Ardagna and
Nimanthi L. Atukorala and
Rajkumar Buyya and
Carl K. Chang and
Rong N. Chang and
Ernesto Damiani and
Gargi Banerjee Dasgupta and
Fabrizio Gagliardi and
Christoph Hagleitner and
Dejan S. Milojicic and
Tuan M. Hoang Trong and
Robert Ward and
Fatos Xhafa and
Jia Zhang},
title = {An Approximation Algorithm for Minimizing the Cloud Carbon Footprint
through Workload Scheduling},
booktitle = {{IEEE} 15th International Conference on Cloud Computing, {CLOUD} 2022,
Barcelona, Spain, July 10-16, 2022},
pages = {522--531},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/CLOUD55607.2022.00075},
doi = {10.1109/CLOUD55607.2022.00075},
timestamp = {Fri, 23 Jun 2023 11:36:46 +0200},
biburl = {https://dblp.org/rec/conf/IEEEcloud/BahreiniTY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BandyapadhyayFM22,
author = {Sayan Bandyapadhyay and
Zachary Friggstad and
Ramin Mousavi},
title = {Parameterized Approximation Algorithms for K-center Clustering and
Variants},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {3895--3903},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i4.20305},
doi = {10.1609/AAAI.V36I4.20305},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BandyapadhyayFM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/HouPGL22,
author = {Bo Hou and
Zhenzhen Pang and
Suogang Gao and
Wen Liu},
editor = {Qiufen Ni and
Weili Wu},
title = {Improved Approximation Algorithm for the Asymmetric Prize-Collecting
{TSP}},
booktitle = {Algorithmic Aspects in Information and Management - 16th International
Conference, {AAIM} 2022, Guangzhou, China, August 13-14, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13513},
pages = {28--32},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-16081-3\_3},
doi = {10.1007/978-3-031-16081-3\_3},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/HouPGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/ZhangGHL22,
author = {Jiaxuan Zhang and
Suogang Gao and
Bo Hou and
Wen Liu},
editor = {Qiufen Ni and
Weili Wu},
title = {An Approximation Algorithm for the Clustered Path Travelling Salesman
Problem},
booktitle = {Algorithmic Aspects in Information and Management - 16th International
Conference, {AAIM} 2022, Guangzhou, China, August 13-14, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13513},
pages = {15--27},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-16081-3\_2},
doi = {10.1007/978-3-031-16081-3\_2},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/ZhangGHL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/BarakatBL22,
author = {Anas Barakat and
Pascal Bianchi and
Julien Lehmann},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Analysis of a Target-Based Actor-Critic Algorithm with Linear Function
Approximation},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {991--1040},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/barakat22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/BarakatBL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/VakilianY22,
author = {Ali Vakilian and
Mustafa Yal{\c{c}}iner},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Improved Approximation Algorithms for Individually Fair Clustering},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {8758--8779},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/vakilian22a.html},
timestamp = {Fri, 20 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aistats/VakilianY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LiLWZ22,
author = {Yi Li and
Honghao Lin and
David P. Woodruff and
Yuheng Zhang},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Streaming Algorithms with Large Approximation Factors},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.13},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.13},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/LiLWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/DiakonikolasPPS22,
author = {Ilias Diakonikolas and
Chrystalla Pavlou and
John Peebles and
Alistair Stewart},
editor = {Piotr Faliszewski and
Viviana Mascardi and
Catherine Pelachaud and
Matthew E. Taylor},
title = {Efficient Approximation Algorithms for the Inverse Semivalue Problem},
booktitle = {21st International Conference on Autonomous Agents and Multiagent
Systems, {AAMAS} 2022, Auckland, New Zealand, May 9-13, 2022},
pages = {354--362},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems
{(IFAAMAS)}},
year = {2022},
url = {https://www.ifaamas.org/Proceedings/aamas2022/pdfs/p354.pdf},
doi = {10.5555/3535850.3535891},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/DiakonikolasPPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/IwanumaH22,
author = {Koji Iwanuma and
Ryo Hinata},
editor = {Shusaku Tsumoto and
Yukio Ohsawa and
Lei Chen and
Dirk Van den Poel and
Xiaohua Hu and
Yoichi Motomura and
Takuya Takagi and
Lingfei Wu and
Ying Xie and
Akihiro Abe and
Vijay Raghavan},
title = {A Fast On-Line {\unicode{1013}}-Approximation Algorithm for Mining
Strongly Closed Itemsets},
booktitle = {{IEEE} International Conference on Big Data, Big Data 2022, Osaka,
Japan, December 17-20, 2022},
pages = {6656--6659},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/BigData55660.2022.10020826},
doi = {10.1109/BIGDATA55660.2022.10020826},
timestamp = {Fri, 18 Aug 2023 17:39:03 +0200},
biburl = {https://dblp.org/rec/conf/bigdataconf/IwanumaH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/PrzyborowskiS22,
author = {Mateusz Przyborowski and
Dominik Slezak},
editor = {Shusaku Tsumoto and
Yukio Ohsawa and
Lei Chen and
Dirk Van den Poel and
Xiaohua Hu and
Yoichi Motomura and
Takuya Takagi and
Lingfei Wu and
Ying Xie and
Akihiro Abe and
Vijay Raghavan},
title = {Approximation of the expectation-maximization algorithm for Gaussian
mixture models on big data},
booktitle = {{IEEE} International Conference on Big Data, Big Data 2022, Osaka,
Japan, December 17-20, 2022},
pages = {6256--6260},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/BigData55660.2022.10020450},
doi = {10.1109/BIGDATA55660.2022.10020450},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bigdataconf/PrzyborowskiS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/BhabakH22,
author = {Puspal Bhabak and
Hovhannes A. Harutyunyan},
editor = {Niranjan Balachandran and
R. Inkulu},
title = {Approximation Algorithms in Graphs with Known Broadcast Time of the
Base Graph},
booktitle = {Algorithms and Discrete Applied Mathematics - 8th International Conference,
{CALDAM} 2022, Puducherry, India, February 10-12, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13179},
pages = {305--316},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-95018-7\_24},
doi = {10.1007/978-3-030-95018-7\_24},
timestamp = {Fri, 28 Jan 2022 16:21:27 +0100},
biburl = {https://dblp.org/rec/conf/caldam/BhabakH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/MouraOW22,
author = {Phablo F. S. Moura and
Matheus Jun Ota and
Yoshiko Wakabayashi},
editor = {Niranjan Balachandran and
R. Inkulu},
title = {Approximation and Parameterized Algorithms for Balanced Connected
Partition Problems},
booktitle = {Algorithms and Discrete Applied Mathematics - 8th International Conference,
{CALDAM} 2022, Puducherry, India, February 10-12, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13179},
pages = {211--223},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-95018-7\_17},
doi = {10.1007/978-3-030-95018-7\_17},
timestamp = {Tue, 08 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/MouraOW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cecnet/Ye22a,
author = {Xiao{-}Ming Ye},
editor = {Antonio J. Tall{\'{o}}n{-}Ballesteros},
title = {Robust Estimation Method Using Successive Approximation Algorithm
to Correct Errors},
booktitle = {Proceedings of CECNet 2022 - The 12th International Conference on
Electronics, Communications and Networks (CECNet 2022), 4-7 November
2022, Virtual Event / Xiamen, China},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {363},
pages = {518--532},
publisher = {{IOS} Press},
year = {2022},
url = {https://doi.org/10.3233/FAIA220573},
doi = {10.3233/FAIA220573},
timestamp = {Tue, 10 Jan 2023 15:52:10 +0100},
biburl = {https://dblp.org/rec/conf/cecnet/Ye22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HuangYL22,
author = {Liting Huang and
Wei Yu and
Zhaohui Liu},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover
Problem and Its Variants},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {36--48},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_4},
doi = {10.1007/978-3-031-22105-7\_4},
timestamp = {Mon, 09 Jan 2023 17:58:31 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/HuangYL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/JiangS22,
author = {Hongyi Jiang and
Samitha Samaranayake},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {Approximation Algorithms for Capacitated Assignment with Budget Constraints
and Applications in Transportation Systems},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {94--105},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_9},
doi = {10.1007/978-3-031-22105-7\_9},
timestamp = {Mon, 09 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/JiangS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LiXJWH22,
author = {Sizhe Li and
Jinghui Xue and
Mingming Jin and
Kai Wang and
Kun He},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {394--405},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_35},
doi = {10.1007/978-3-031-22105-7\_35},
timestamp = {Fri, 20 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/LiXJWH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MakarychevMO22,
author = {Yury Makarychev and
Naren Sarayu Manoj and
Max Ovsiankin},
editor = {Po{-}Ling Loh and
Maxim Raginsky},
title = {Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes},
booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}},
series = {Proceedings of Machine Learning Research},
volume = {178},
pages = {3070--3093},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v178/makarychev22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:51 +0200},
biburl = {https://dblp.org/rec/conf/colt/MakarychevMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Har-PeledY22,
author = {Sariel Har{-}Peled and
Everett Yang},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Approximation Algorithms for Maximum Matchings in Geometric Intersection
Graphs},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {47:1--47:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.47},
doi = {10.4230/LIPICS.SOCG.2022.47},
timestamp = {Wed, 01 Jun 2022 16:45:26 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Har-PeledY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csae/LiuZL22,
author = {Nan Liu and
Yongqi Zhu and
Shenghua Li},
editor = {Ali Emrouznejad},
title = {A New Approximation Algorithm for the Contig-Based One-Sided Repetitive
Genomic Scaffold Filling Problem},
booktitle = {The 6th International Conference on Computer Science and Application
Engineering, {CSAE} 2022, Virtual Event, China, October 21-23, 2022},
pages = {22:1--22:5},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3565387.3565409},
doi = {10.1145/3565387.3565409},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csae/LiuZL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChakrabartyNS22,
author = {Deeparnab Chakrabarty and
Maryam Negahbani and
Ankita Sarkar},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Approximation Algorithms for Continuous Clustering and Facility Location
Problems},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {33:1--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.33},
doi = {10.4230/LIPICS.ESA.2022.33},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/ChakrabartyNS22.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 = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/EsmerKMNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Kar0W22,
author = {Debajyoti Kar and
Arindam Khan and
Andreas Wiese},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Approximation Algorithms for Round-UFP and Round-SAP},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {71:1--71:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.71},
doi = {10.4230/LIPICS.ESA.2022.71},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Kar0W22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/DaiLL22,
author = {Han Dai and
Weidong Li and
Xiaofei Liu},
editor = {Minming Li and
Xiaoming Sun},
title = {An Approximation Algorithm for the H-Prize-Collecting Power Cover
Problem},
booktitle = {Frontiers of Algorithmic Wisdom - International Joint Conference,
{IJTCS-FAW} 2022, Hong Kong, China, August 15-19, 2022, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {13461},
pages = {89--98},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20796-9\_7},
doi = {10.1007/978-3-031-20796-9\_7},
timestamp = {Thu, 27 Apr 2023 09:01:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/DaiLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/HanCF22,
author = {Lu Han and
Vincent Chau and
Chi Kit Ken Fong},
editor = {Minming Li and
Xiaoming Sun},
title = {Approximation Algorithms for Prize-Collecting Capacitated Network
Design Problems},
booktitle = {Frontiers of Algorithmic Wisdom - International Joint Conference,
{IJTCS-FAW} 2022, Hong Kong, China, August 15-19, 2022, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {13461},
pages = {219--232},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20796-9\_16},
doi = {10.1007/978-3-031-20796-9\_16},
timestamp = {Mon, 09 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/faw/HanCF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DalirrooyfardJW22,
author = {Mina Dalirrooyfard and
Ce Jin and
Virginia Vassilevska Williams and
Nicole Wein},
title = {Approximation Algorithms and Hardness for n-Pairs Shortest Paths and
All-Nodes Shortest Cycles},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {290--300},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00034},
doi = {10.1109/FOCS54457.2022.00034},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DalirrooyfardJW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/0001SS22,
author = {Arindam Khan and
Eklavya Sharma and
K. V. N. Sreenivas},
editor = {Anuj Dawar and
Venkatesan Guruswami},
title = {Geometry Meets Vectors: Approximation Algorithms for Multidimensional
Packing},
booktitle = {42nd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022,
{IIT} Madras, Chennai, India},
series = {LIPIcs},
volume = {250},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2022.23},
doi = {10.4230/LIPICS.FSTTCS.2022.23},
timestamp = {Wed, 14 Dec 2022 11:57:55 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/0001SS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001KS22,
author = {Debarati Das and
Tomasz Kociumaka and
Barna Saha},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Improved Approximation Algorithms for Dyck Edit Distance and {RNA}
Folding},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {49:1--49:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.49},
doi = {10.4230/LIPICS.ICALP.2022.49},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0001KS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001LMSW22,
author = {Arindam Khan and
Aditya Lonkar and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Tight Approximation Algorithms for Two-Dimensional Guillotine Strip
Packing},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {80:1--80:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.80},
doi = {10.4230/LIPICS.ICALP.2022.80},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0001LMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbboudCLM22,
author = {Amir Abboud and
Vincent Cohen{-}Addad and
Euiwoong Lee and
Pasin Manurangsi},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Improved Approximation Algorithms and Lower Bounds for Search-Diversification
Problems},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.7},
doi = {10.4230/LIPICS.ICALP.2022.7},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AbboudCLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenWZ22,
author = {Lin Chen and
Xiaoyu Wu and
Guochuan Zhang},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Approximation Algorithms for Interdiction Problem with Packing Constraints},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {39:1--39:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.39},
doi = {10.4230/LIPICS.ICALP.2022.39},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icc/0001NPLN22,
author = {Tu N. Nguyen and
Dung H. P. Nguyen and
Dang H. Pham and
Bing{-}Hong Liu and
Hoa Ngoc Nguyen},
title = {{LP} Relaxation-Based Approximation Algorithms for Maximizing Entangled
Quantum Routing Rate},
booktitle = {{IEEE} International Conference on Communications, {ICC} 2022, Seoul,
Korea, May 16-20, 2022},
pages = {3269--3274},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ICC45855.2022.9838825},
doi = {10.1109/ICC45855.2022.9838825},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icc/0001NPLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/OrecchiaATT22,
author = {Lorenzo Orecchia and
Konstantinos Ameranis and
Charalampos E. Tsourakakis and
Kunal Talwar},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {Practical Almost-Linear-Time Approximation Algorithms for Hybrid and
Overlapping Graph Clustering},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {17071--17093},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/orecchia22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/OrecchiaATT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Veldt22,
author = {Nate Veldt},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation
Algorithms and Practical Lower Bounds},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {22060--22083},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/veldt22a.html},
timestamp = {Tue, 12 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/Veldt22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ihci/DuttaS22,
author = {Ayan Dutta and
Gokarna Sharma},
editor = {Hakimjon Zaynidinov and
Madhusudan Singh and
Uma Shanker Tiwary and
Dhananjay Singh},
title = {A Constant-Factor Approximation Algorithm for Online Coverage Path
Planning with Energy Constraint},
booktitle = {Intelligent Human Computer Interaction - 14th International Conference,
{IHCI} 2022, Tashkent, Uzbekistan, October 20-22, 2022, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {13741},
pages = {257--270},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-27199-1\_27},
doi = {10.1007/978-3-031-27199-1\_27},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ihci/DuttaS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BamasDS22,
author = {{\'{E}}tienne Bamas and
Marina Drygala and
Ola Svensson},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {A Simple LP-Based Approximation Algorithm for the Matching Augmentation
Problem},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {57--69},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_5},
doi = {10.1007/978-3-031-06901-7\_5},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BamasDS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FriggstadM22,
author = {Zachary Friggstad and
Ramin Mousavi},
editor = {Sang Won Bae and
Heejin Park},
title = {Bi-Criteria Approximation Algorithms for Bounded-Degree Subset {TSP}},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {8:1--8:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.8},
doi = {10.4230/LIPICS.ISAAC.2022.8},
timestamp = {Wed, 14 Dec 2022 11:53:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FriggstadM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ZhouLG22,
author = {Jianqi Zhou and
Peihua Li and
Jiong Guo},
editor = {Sang Won Bae and
Heejin Park},
title = {Parameterized Approximation Algorithms for {TSP}},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {50:1--50:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.50},
doi = {10.4230/LIPICS.ISAAC.2022.50},
timestamp = {Wed, 14 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ZhouLG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/FampaL22,
author = {Marcia Fampa and
Jon Lee},
editor = {Ivana Ljubic and
Francisco Barahona and
Santanu S. Dey and
Ali Ridha Mahjoub},
title = {An Outer-Approximation Algorithm for Maximum-Entropy Sampling},
booktitle = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
Virtual Event, May 18-20, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13526},
pages = {130--142},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18530-4\_10},
doi = {10.1007/978-3-031-18530-4\_10},
timestamp = {Mon, 06 Nov 2023 13:38:03 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/FampaL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itp/Karayel22,
author = {Emin Karayel},
editor = {June Andronick and
Leonardo de Moura},
title = {Formalization of Randomized Approximation Algorithms for Frequency
Moments},
booktitle = {13th International Conference on Interactive Theorem Proving, {ITP}
2022, August 7-10, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {237},
pages = {21:1--21:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITP.2022.21},
doi = {10.4230/LIPICS.ITP.2022.21},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/itp/Karayel22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcsse/BurathepF22,
author = {Kunanon Burathep and
Jittat Fakcharoenphol},
title = {An Approximation Algorithm for the Vertex Multicut on Trees with an
Application to the Tracking Paths Problem},
booktitle = {19th International Joint Conference on Computer Science and Software
Engineering, {JCSSE} 2022, Bangkok, Thailand, June 22-25, 2022},
pages = {1--5},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/JCSSE54890.2022.9836254},
doi = {10.1109/JCSSE54890.2022.9836254},
timestamp = {Tue, 02 Aug 2022 22:23:52 +0200},
biburl = {https://dblp.org/rec/conf/jcsse/BurathepF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ThejaswiGOO22,
author = {Suhas Thejaswi and
Ameet Gadekar and
Bruno Ordozgoiti and
Michal Osadnik},
editor = {Aidong Zhang and
Huzefa Rangwala},
title = {Clustering with Fair-Center Representation: Parameterized Approximation
Algorithms and Heuristics},
booktitle = {{KDD} '22: The 28th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Washington, DC, USA, August 14 - 18, 2022},
pages = {1749--1759},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3534678.3539487},
doi = {10.1145/3534678.3539487},
timestamp = {Mon, 28 Aug 2023 21:17:29 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ThejaswiGOO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lascas/SonodaSO22,
author = {Shoya Sonoda and
Jun Shiomi and
Hidetoshi Onodera},
title = {Approximation-Based Implementation for a Minimum Energy Point Tracking
Algorithm over a Wide Operating Performance Region},
booktitle = {13th {IEEE} Latin America Symposium on Circuits and System, {LASCAS}
2022, Puerto Varas, Chile, March 1-4, 2022},
pages = {1--4},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/LASCAS53948.2022.9789067},
doi = {10.1109/LASCAS53948.2022.9789067},
timestamp = {Mon, 13 Jun 2022 16:53:37 +0200},
biburl = {https://dblp.org/rec/conf/lascas/SonodaSO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BeneditoMP22,
author = {Marcelo Pinheiro Leite Benedito and
Lucas P. Melo and
Lehilton L. C. Pedrosa},
editor = {Armando Casta{\~{n}}eda and
Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
title = {A Parameterized Approximation Algorithm for the Multiple Allocation
k-Hub Center},
booktitle = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
Guanajuato, Mexico, November 7-11, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13568},
pages = {141--156},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20624-5\_9},
doi = {10.1007/978-3-031-20624-5\_9},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BeneditoMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DereniowskiW22,
author = {Dariusz Dereniowski and
Izajasz P. Wrosz},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Constant-Factor Approximation Algorithm for Binary Search in Trees
with Monotonic Query Times},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {42:1--42:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.42},
doi = {10.4230/LIPICS.MFCS.2022.42},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DereniowskiW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GongFLM22,
author = {Mingyang Gong and
Jing Fan and
Guohui Lin and
Eiji Miyano},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Approximation Algorithms for Covering Vertices by Long Paths},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {53:1--53:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.53},
doi = {10.4230/LIPICS.MFCS.2022.53},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GongFLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ZhaoXX22,
author = {Jingyang Zhao and
Mingyu Xiao and
Chao Xu},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Improved Approximation Algorithms for the Traveling Tournament Problem},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {83:1--83:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.83},
doi = {10.4230/LIPICS.MFCS.2022.83},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ZhaoXX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nctcs/Dai22,
author = {Han Dai},
editor = {Zhiping Cai and
Yijia Chen and
Jialin Zhang},
title = {An Approximation Algorithm for the Minimum Soft Capacitated Disk Multi-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 = {96--104},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-981-19-8152-4\_6},
doi = {10.1007/978-981-19-8152-4\_6},
timestamp = {Tue, 13 Dec 2022 15:09:40 +0100},
biburl = {https://dblp.org/rec/conf/nctcs/Dai22.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 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nctcs/Lan22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/npc/GuoWWWRQ22,
author = {Hao Guo and
Xiaohui Wei and
Xingwang Wang and
Xiaonan Wang and
Chenghao Ren and
Meikang Qiu},
editor = {Shaoshan Liu and
Xiaohui Wei},
title = {Approximation Algorithms for Reliability-Aware Maximum VoI on AUV-Aided
Data Collections},
booktitle = {Network and Parallel Computing - 19th {IFIP} {WG} 10.3 International
Conference, {NPC} 2022, Jinan, China, September 24-25, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13615},
pages = {219--230},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-21395-3\_20},
doi = {10.1007/978-3-031-21395-3\_20},
timestamp = {Thu, 08 Dec 2022 15:05:28 +0100},
biburl = {https://dblp.org/rec/conf/npc/GuoWWWRQ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/EmekGH22,
author = {Yuval Emek and
Yuval Gil and
Noga Harlev},
editor = {Eshcar Hillel and
Roberto Palmieri and
Etienne Rivi{\`{e}}re},
title = {Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual
Approach},
booktitle = {26th International Conference on Principles of Distributed Systems,
{OPODIS} 2022, December 13-15, 2022, Brussels, Belgium},
series = {LIPIcs},
volume = {253},
pages = {27:1--27:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2022.27},
doi = {10.4230/LIPICS.OPODIS.2022.27},
timestamp = {Wed, 15 Feb 2023 17:36:11 +0100},
biburl = {https://dblp.org/rec/conf/opodis/EmekGH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/optima/Grigoreva22,
author = {Natalia Grigoreva},
editor = {Nicholas N. Olenev and
Yuri Evtushenko and
Milojica Jacimovic and
Michael Yu. Khachay and
Vlasta Malkova and
Igor G. Pospelov},
title = {An 11/7 - Approximation Algorithm for Single Machine Scheduling Problem
with Release and Delivery Times},
booktitle = {Advances in Optimization and Applications - 13th International Conference,
{OPTIMA} 2022, Petrovac, Montenegro, September 26-30, 2022, Revised
Selected Papers, Volume 2},
series = {Communications in Computer and Information Science},
volume = {1739},
pages = {76--89},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22990-9\_6},
doi = {10.1007/978-3-031-22990-9\_6},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/optima/Grigoreva22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdp/GhalamiG22,
author = {Laleh Ghalami and
Daniel Grosu},
editor = {Arturo Gonz{\'{a}}lez{-}Escribano and
Jos{\'{e}} Daniel Garc{\'{\i}}a and
Massimo Torquati and
Amund Skavhaug},
title = {A Parallel Approximation Algorithm for the Steiner Forest Problem},
booktitle = {30th Euromicro International Conference on Parallel, Distributed and
Network-based Processing, {PDP} 2022, Valladolid, Spain, March 9-11,
2022},
pages = {47--54},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/PDP55904.2022.00016},
doi = {10.1109/PDP55904.2022.00016},
timestamp = {Mon, 25 Apr 2022 07:42:26 +0200},
biburl = {https://dblp.org/rec/conf/pdp/GhalamiG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppsn/Valencia-Rodriguez22,
author = {Diana Cristina Valencia{-}Rodr{\'{\i}}guez and
Carlos Artemio Coello Coello},
editor = {G{\"{u}}nter Rudolph and
Anna V. Kononova and
Hern{\'{a}}n E. Aguirre and
Pascal Kerschke and
Gabriela Ochoa and
Tea Tusar},
title = {Multi-Objective Evolutionary Algorithm Based on the Linear Assignment
Problem and the Hypervolume Approximation Using Polar Coordinates
{(MOEA-LAPCO)}},
booktitle = {Parallel Problem Solving from Nature - {PPSN} {XVII} - 17th International
Conference, {PPSN} 2022, Dortmund, Germany, September 10-14, 2022,
Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {13399},
pages = {221--233},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-14721-0\_16},
doi = {10.1007/978-3-031-14721-0\_16},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ppsn/Valencia-Rodriguez22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qest/SquillaceTTV22,
author = {Giuseppe Squillace and
Mirco Tribastone and
Max Tschaikowski and
Andrea Vandin},
editor = {Erika {\'{A}}brah{\'{a}}m and
Marco Paolieri},
title = {An Algorithm for the Formal Reduction of Differential Equations as
Over-Approximations},
booktitle = {Quantitative Evaluation of Systems - 19th International Conference,
{QEST} 2022, Warsaw, Poland, September 12-16, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13479},
pages = {173--191},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-16336-4\_9},
doi = {10.1007/978-3-031-16336-4\_9},
timestamp = {Tue, 21 Mar 2023 20:54:44 +0100},
biburl = {https://dblp.org/rec/conf/qest/SquillaceTTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/ChowdhuryBZWD22,
author = {Agniva Chowdhury and
Aritra Bose and
Samson Zhou and
David P. Woodruff and
Petros Drineas},
editor = {Itsik Pe'er},
title = {A Fast, Provably Accurate Approximation Algorithm for Sparse Principal
Component Analysis Reveals Human Genetic Variation Across the World},
booktitle = {Research in Computational Molecular Biology - 26th Annual International
Conference, {RECOMB} 2022, San Diego, CA, USA, May 22-25, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13278},
pages = {86--106},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-04749-7\_6},
doi = {10.1007/978-3-031-04749-7\_6},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/recomb/ChowdhuryBZWD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rivf/ThaiH22,
author = {Tin Trung Thai and
Synh Viet{-}Uyen Ha},
title = {Post Processing Algorithm for Background Subtraction Model based on
Entropy Approximation and Style Transfer Neural Network},
booktitle = {{RIVF} International Conference on Computing and Communication Technologies,
{RIVF} 2022, Ho Chi Minh City, Vietnam, December 20-22, 2022},
pages = {422--427},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/RIVF55975.2022.10013805},
doi = {10.1109/RIVF55975.2022.10013805},
timestamp = {Mon, 30 Jan 2023 14:34:17 +0100},
biburl = {https://dblp.org/rec/conf/rivf/ThaiH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EsfandiariMN22,
author = {Hossein Esfandiari and
Vahab S. Mirrokni and
Shyam Narayanan},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Almost Tight Approximation Algorithms for Explainable Clustering},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2641--2663},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.103},
doi = {10.1137/1.9781611977073.103},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/EsfandiariMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GalvezKMMPW22,
author = {Waldo G{\'{a}}lvez and
Arindam Khan and
Mathieu Mari and
Tobias M{\"{o}}mke and
Madhusudhan Reddy Pittu and
Andreas Wiese},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {A 3-Approximation Algorithm for Maximum Independent Set of Rectangles},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {894--905},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.38},
doi = {10.1137/1.9781611977073.38},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GalvezKMMPW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KadriaRSWZ22,
author = {Avi Kadria and
Liam Roditty and
Aaron Sidford and
Virginia Vassilevska Williams and
Uri Zwick},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Algorithmic trade-offs for girth approximation in undirected graphs},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {1471--1492},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.62},
doi = {10.1137/1.9781611977073.62},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KadriaRSWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/WoodruffY22,
author = {David P. Woodruff and
Taisuke Yasuda},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Improved Algorithms for Low Rank Approximation from Sparsity},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2358--2403},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.95},
doi = {10.1137/1.9781611977073.95},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/WoodruffY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/IbrahimpurS22,
author = {Sharat Ibrahimpur and
Chaitanya Swamy},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {A Simple Approximation Algorithm for Vector Scheduling and Applications
to Stochastic Min-Norm Load Balancing},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {247--256},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.18},
doi = {10.1137/1.9781611977066.18},
timestamp = {Sat, 19 Aug 2023 18:10:48 +0200},
biburl = {https://dblp.org/rec/conf/sosa/IbrahimpurS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgarwalCRX22,
author = {Pankaj K. Agarwal and
Hsien{-}Chih Chang and
Sharath Raghvendra and
Allen Xiao},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic, near-linear \emph{{\(\epsilon\)}}-approximation algorithm
for geometric bipartite matching},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1052--1065},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519977},
doi = {10.1145/3519935.3519977},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AgarwalCRX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyT22,
author = {Julia Chuzhoy and
Zihan Tan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A subpolynomial approximation algorithm for graph crossing number
in low-degree graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {303--316},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519984},
doi = {10.1145/3519935.3519984},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKG022,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan and
Xinzhi Zhang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {An improved approximation algorithm for the minimum \emph{k}-edge
connected multi-subgraph problem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1612--1620},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520062},
doi = {10.1145/3519935.3520062},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKG022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalRSS22,
author = {Pankaj K. Agarwal and
Sharath Raghvendra and
Pouyan Shirzadian and
Rachita Sowle},
editor = {Artur Czumaj and
Qin Xin},
title = {An Improved {\(\epsilon\)}-Approximation Algorithm for Geometric Bipartite
Matching},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.6},
doi = {10.4230/LIPICS.SWAT.2022.6},
timestamp = {Thu, 23 Jun 2022 13:34:22 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalRSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergSS22,
author = {Mark de Berg and
Arpan Sadhukhan and
Frits C. R. Spieksma},
editor = {Artur Czumaj and
Qin Xin},
title = {Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment
Problem},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.15},
doi = {10.4230/LIPICS.SWAT.2022.15},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/AmanoM22,
author = {Yuki Amano and
Kazuhisa Makino},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {A 3/4 Differential Approximation Algorithm for Traveling Salesman
Problem},
booktitle = {Theory and Applications of Models of Computation - 17th Annual Conference,
{TAMC} 2022, Tianjin, China, September 16-18, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13571},
pages = {237--248},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20350-3\_19},
doi = {10.1007/978-3-031-20350-3\_19},
timestamp = {Mon, 09 Jan 2023 17:58:31 +0100},
biburl = {https://dblp.org/rec/conf/tamc/AmanoM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DaiGGZ22,
author = {Sijia Dai and
Guichen Gao and
Xinru Guo and
Yong Zhang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Exact and Approximation Algorithms for {PMMS} Under Identical Constraints},
booktitle = {Theory and Applications of Models of Computation - 17th Annual Conference,
{TAMC} 2022, Tianjin, China, September 16-18, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13571},
pages = {322--333},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20350-3\_26},
doi = {10.1007/978-3-031-20350-3\_26},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/DaiGGZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HanLXZ22,
author = {Lu Han and
Shuilian Liu and
Yicheng Xu and
Yong Zhang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Approximation Algorithms for Diversity-Bounded Center Problems},
booktitle = {Theory and Applications of Models of Computation - 17th Annual Conference,
{TAMC} 2022, Tianjin, China, September 16-18, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13571},
pages = {402--413},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20350-3\_33},
doi = {10.1007/978-3-031-20350-3\_33},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/HanLXZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LiuL22,
author = {Xiaofei Liu and
Weidong Li},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {An Approximation Algorithm for the B-prize-collecting Multicut Problem
in Trees},
booktitle = {Theory and Applications of Models of Computation - 17th Annual Conference,
{TAMC} 2022, Tianjin, China, September 16-18, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13571},
pages = {262--271},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20350-3\_21},
doi = {10.1007/978-3-031-20350-3\_21},
timestamp = {Mon, 09 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/LiuL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vtc/JiangYHW22,
author = {Dandan Jiang and
Lu Yang and
Han Hao and
Rui Wang},
title = {{TOSE:} {A} Fast Capacity Estimation Algorithm Based on Spike Approximations},
booktitle = {96th Vehicular Technology Conference, {VTC} Fall 2022, London, United
Kingdom, September 26-29, 2022},
pages = {1--6},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/VTC2022-Fall57202.2022.10012746},
doi = {10.1109/VTC2022-FALL57202.2022.10012746},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vtc/JiangYHW22.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}
}
@inproceedings{DBLP:conf/wowmom/GaoGL22,
author = {Xuening Gao and
Longkun Guo and
Kewen Liao},
title = {Fast Approximation Algorithms for Multiple Coverage with Unit Disks},
booktitle = {23rd {IEEE} International Symposium on a World of Wireless, Mobile
and Multimedia Networks, WoWMoM 2022, Belfast, United Kingdom, June
14-17, 2022},
pages = {185--193},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/WoWMoM54355.2022.00037},
doi = {10.1109/WOWMOM54355.2022.00037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wowmom/GaoGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/degruyter/22/PiatkowskiMK0FWBE0P22-4,
author = {Nico Bertram and
Jonas Ellert and
Johannes Fischer},
editor = {Katharina Morik and
Peter Marwedel},
title = {High-Quality Parallel Max-Cut Approximation Algorithms forShared Memory},
booktitle = {Machine Learning under Resource Constraints - Volume 1: Fundamentals},
series = {De Gruyter {STEM}},
pages = {144--159},
publisher = {De Gruyter},
year = {2022},
url = {https://doi.org/10.1515/9783110785944-004},
doi = {10.1515/9783110785944-004},
timestamp = {Fri, 28 Jul 2023 11:13:07 +0200},
biburl = {https://dblp.org/rec/books/degruyter/22/PiatkowskiMK0FWBE0P22-4.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2022,
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-249-5},
isbn = {978-3-95977-249-5},
timestamp = {Sat, 17 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2022,
editor = {Parinya Chalermsook and
Bundit Laekhanukit},
title = {Approximation and Online Algorithms - 20th International Workshop,
{WAOA} 2022, Potsdam, Germany, September 8-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13538},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18367-6},
doi = {10.1007/978-3-031-18367-6},
isbn = {978-3-031-18366-9},
timestamp = {Tue, 25 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-01849,
author = {Sariel Har{-}Peled and
Everett Yang},
title = {Approximation Algorithms for Maximum Matchings in Geometric Intersection
Graphs},
journal = {CoRR},
volume = {abs/2201.01849},
year = {2022},
url = {https://arxiv.org/abs/2201.01849},
eprinttype = {arXiv},
eprint = {2201.01849},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-01849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05764,
author = {Wei{-}Chang Yeh},
title = {Self-Adaptive Binary-Addition-Tree Algorithm-Based Novel Monte Carlo
Simulation for Binary-State Network Reliability Approximation},
journal = {CoRR},
volume = {abs/2201.05764},
year = {2022},
url = {https://arxiv.org/abs/2201.05764},
eprinttype = {arXiv},
eprint = {2201.05764},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05764.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08424,
author = {Felix Kastner and
Andreas R{\"{o}}{\ss}ler},
title = {An Analysis of Approximation Algorithms for Iterated Stochastic Integrals
and a Julia and {MATLAB} Simulation Toolbox},
journal = {CoRR},
volume = {abs/2201.08424},
year = {2022},
url = {https://arxiv.org/abs/2201.08424},
eprinttype = {arXiv},
eprint = {2201.08424},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08647,
author = {Kazuhiro Kurita and
Kunihiro Wasa},
title = {An Approximation Algorithm for K-best Enumeration of Minimal Connected
Edge Dominating Sets with Cardinality Constraints},
journal = {CoRR},
volume = {abs/2201.08647},
year = {2022},
url = {https://arxiv.org/abs/2201.08647},
eprinttype = {arXiv},
eprint = {2201.08647},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08647.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08940,
author = {Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {A Framework to Design Approximation Algorithms for Finding Diverse
Solutions in Combinatorial Problems},
journal = {CoRR},
volume = {abs/2201.08940},
year = {2022},
url = {https://arxiv.org/abs/2201.08940},
eprinttype = {arXiv},
eprint = {2201.08940},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-10758,
author = {Daniel Beaglehole},
title = {An Efficient Approximation Algorithm for the Colonel Blotto Game},
journal = {CoRR},
volume = {abs/2201.10758},
year = {2022},
url = {https://arxiv.org/abs/2201.10758},
eprinttype = {arXiv},
eprint = {2201.10758},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-10758.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-12301,
author = {Stanislav Morozov and
Nikolai L. Zamarashkin and
Eugene Tyrtyshnikov},
title = {On the algorithm of best approximation by low rank matrices in the
Chebyshev norm},
journal = {CoRR},
volume = {abs/2201.12301},
year = {2022},
url = {https://arxiv.org/abs/2201.12301},
eprinttype = {arXiv},
eprint = {2201.12301},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-12301.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-13450,
author = {Lior Eldar and
Sean Hallgren},
title = {An efficient quantum algorithm for lattice problems achieving subexponential
approximation factor},
journal = {CoRR},
volume = {abs/2201.13450},
year = {2022},
url = {https://arxiv.org/abs/2201.13450},
eprinttype = {arXiv},
eprint = {2201.13450},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-13450.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03492,
author = {Debajyoti Kar and
Arindam Khan and
Andreas Wiese},
title = {Approximation Algorithms for {ROUND-UFP} and {ROUND-SAP}},
journal = {CoRR},
volume = {abs/2202.03492},
year = {2022},
url = {https://arxiv.org/abs/2202.03492},
eprinttype = {arXiv},
eprint = {2202.03492},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03492.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05989,
author = {Arindam Khan and
Aditya Lonkar and
Arnab Maiti and
Amatya Sharma and
Andreas Wiese},
title = {Tight Approximation Algorithms for Two Dimensional Guillotine Strip
Packing},
journal = {CoRR},
volume = {abs/2202.05989},
year = {2022},
url = {https://arxiv.org/abs/2202.05989},
eprinttype = {arXiv},
eprint = {2202.05989},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05989.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06259,
author = {Di Wu and
Qilong Feng and
Jianxin Wang},
title = {New Approximation Algorithms for Fair k-median Problem},
journal = {CoRR},
volume = {abs/2202.06259},
year = {2022},
url = {https://arxiv.org/abs/2202.06259},
eprinttype = {arXiv},
eprint = {2202.06259},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06827,
author = {Julia Chuzhoy and
Zihan Tan},
title = {A Subpolynomial Approximation Algorithm for Graph Crossing Number
in Low-Degree Graphs},
journal = {CoRR},
volume = {abs/2202.06827},
year = {2022},
url = {https://arxiv.org/abs/2202.06827},
eprinttype = {arXiv},
eprint = {2202.06827},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-07283,
author = {{\'{E}}tienne Bamas and
Marina Drygala and
Ola Svensson},
title = {A Simple LP-Based Approximation Algorithm for the Matching Augmentation
Problem},
journal = {CoRR},
volume = {abs/2202.07283},
year = {2022},
url = {https://arxiv.org/abs/2202.07283},
eprinttype = {arXiv},
eprint = {2202.07283},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-07283.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-13298,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Arash Haddadan and
Sharat Ibrahimpur},
title = {Approximation Algorithms for Flexible Graph Connectivity},
journal = {CoRR},
volume = {abs/2202.13298},
year = {2022},
url = {https://arxiv.org/abs/2202.13298},
eprinttype = {arXiv},
eprint = {2202.13298},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-13298.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-13727,
author = {Eiichiro Sato},
title = {Improved Combinatorial Approximation Algorithms for {MAX} {CUT} in
Sparse Graphs},
journal = {CoRR},
volume = {abs/2202.13727},
year = {2022},
url = {https://arxiv.org/abs/2202.13727},
eprinttype = {arXiv},
eprint = {2202.13727},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-13727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-01857,
author = {Amir Abboud and
Vincent Cohen{-}Addad and
Euiwoong Lee and
Pasin Manurangsi},
title = {Improved Approximation Algorithms and Lower Bounds for Search-Diversification
Problems},
journal = {CoRR},
volume = {abs/2203.01857},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.01857},
doi = {10.48550/ARXIV.2203.01857},
eprinttype = {arXiv},
eprint = {2203.01857},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-01857.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-13908,
author = {Ben Adcock and
Simone Brugiapaglia and
Nick C. Dexter and
Sebastian Moraga},
title = {On efficient algorithms for computing near-best polynomial approximations
to high-dimensional, Hilbert-valued functions from limited samples},
journal = {CoRR},
volume = {abs/2203.13908},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.13908},
doi = {10.48550/ARXIV.2203.13908},
eprinttype = {arXiv},
eprint = {2203.13908},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-13908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-14740,
author = {Donglei Du and
Zhicheng Liu and
Chenchen Wu and
Dachuan Xu and
Yang Zhou},
title = {An improved approximation algorithm for maximizing a DR-submodular
function over a convex set},
journal = {CoRR},
volume = {abs/2203.14740},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.14740},
doi = {10.48550/ARXIV.2203.14740},
eprinttype = {arXiv},
eprint = {2203.14740},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-14740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-15509,
author = {Diptendu Chatterjee and
Rishiraj Bhattacharyya},
title = {Firefighter Problem with Minimum Budget: Hardness and Approximation
Algorithm for Unit Disk Graphs},
journal = {CoRR},
volume = {abs/2203.15509},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.15509},
doi = {10.48550/ARXIV.2203.15509},
eprinttype = {arXiv},
eprint = {2203.15509},
timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-15509.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-03076,
author = {Mina Dalirrooyfard and
Ce Jin and
Virginia Vassilevska Williams and
Nicole Wein},
title = {Approximation Algorithms and Hardness for n-Pairs Shortest Paths and
All-Nodes Shortest Cycles},
journal = {CoRR},
volume = {abs/2204.03076},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.03076},
doi = {10.48550/ARXIV.2204.03076},
eprinttype = {arXiv},
eprint = {2204.03076},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-03076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-03875,
author = {Pankaj K. Agarwal and
Hsien{-}Chih Chang and
Sharath Raghvendra and
Allen Xiao},
title = {Deterministic, Near-Linear {\(\epsilon\)}-Approximation Algorithm
for Geometric Bipartite Matching},
journal = {CoRR},
volume = {abs/2204.03875},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.03875},
doi = {10.48550/ARXIV.2204.03875},
eprinttype = {arXiv},
eprint = {2204.03875},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-03875.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-11106,
author = {Lin Chen and
Xiaoyu Wu and
Guochuan Zhang},
title = {Approximation Algorithms for Interdiction Problem with Packing Constraints},
journal = {CoRR},
volume = {abs/2204.11106},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.11106},
doi = {10.48550/ARXIV.2204.11106},
eprinttype = {arXiv},
eprint = {2204.11106},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-11106.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-12609,
author = {Dilson Lucas Pereira and
Michel Wan Der Maas Soares},
title = {A 3-Approximation Algorithm for a Particular Case of the Hamiltonian
p-Median Problem},
journal = {CoRR},
volume = {abs/2204.12609},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.12609},
doi = {10.48550/ARXIV.2204.12609},
eprinttype = {arXiv},
eprint = {2204.12609},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-12609.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-04019,
author = {Cong Zheng and
Cheng Cheng and
Qiyu Sun},
title = {Wiener filters on graphs and distributed polynomial approximation
algorithms},
journal = {CoRR},
volume = {abs/2205.04019},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.04019},
doi = {10.48550/ARXIV.2205.04019},
eprinttype = {arXiv},
eprint = {2205.04019},
timestamp = {Thu, 12 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-04019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-09639,
author = {Ariel Neufeld and
Sizhou Wu},
title = {Multilevel Picard approximation algorithm for semilinear partial integro-differential
equations and its complexity analysis},
journal = {CoRR},
volume = {abs/2205.09639},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.09639},
doi = {10.48550/ARXIV.2205.09639},
eprinttype = {arXiv},
eprint = {2205.09639},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-09639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-12442,
author = {Donglei Du},
title = {Lyapunov function approach for approximation algorithm design and
analysis: with applications in submodular maximization},
journal = {CoRR},
volume = {abs/2205.12442},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.12442},
doi = {10.48550/ARXIV.2205.12442},
eprinttype = {arXiv},
eprint = {2205.12442},
timestamp = {Tue, 31 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-12442.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-13030,
author = {Marcelo Pinheiro Leite Benedito and
Lucas P. Melo and
Lehilton L. C. Pedrosa},
title = {A parameterized approximation algorithm for the Multiple Allocation
k-Hub Center},
journal = {CoRR},
volume = {abs/2205.13030},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.13030},
doi = {10.48550/ARXIV.2205.13030},
eprinttype = {arXiv},
eprint = {2205.13030},
timestamp = {Mon, 30 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-13030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-04774,
author = {Michel Grabisch and
Christophe Labreuche and
Peiqi Sun},
title = {An approximation algorithm for random generation of capacities},
journal = {CoRR},
volume = {abs/2206.04774},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.04774},
doi = {10.48550/ARXIV.2206.04774},
eprinttype = {arXiv},
eprint = {2206.04774},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-04774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07250,
author = {Yury Makarychev and
Naren Sarayu Manoj and
Max Ovsiankin},
title = {Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes},
journal = {CoRR},
volume = {abs/2206.07250},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07250},
doi = {10.48550/ARXIV.2206.07250},
eprinttype = {arXiv},
eprint = {2206.07250},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07250.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11210,
author = {Mehrdad Ghadiri and
Mohit Singh and
Santosh S. Vempala},
title = {Constant-Factor Approximation Algorithms for Socially Fair k-Clustering},
journal = {CoRR},
volume = {abs/2206.11210},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11210},
doi = {10.48550/ARXIV.2206.11210},
eprinttype = {arXiv},
eprint = {2206.11210},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11210.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/corr/abs-2206-15105,
author = {Deeparnab Chakrabarty and
Maryam Negahbani and
Ankita Sarkar},
title = {Approximation Algorithms for Continuous Clustering and Facility Location
Problems},
journal = {CoRR},
volume = {abs/2206.15105},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.15105},
doi = {10.48550/ARXIV.2206.15105},
eprinttype = {arXiv},
eprint = {2206.15105},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-15105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07983,
author = {R. Ravi and
Weizhong Zhang and
Michael Zlatin},
title = {New and improved approximation algorithms for Steiner Tree Augmentation
Problems},
journal = {CoRR},
volume = {abs/2207.07983},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07983},
doi = {10.48550/ARXIV.2207.07983},
eprinttype = {arXiv},
eprint = {2207.07983},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-08075,
author = {Yi Li and
Honghao Lin and
David P. Woodruff and
Yuheng Zhang},
title = {Streaming Algorithms with Large Approximation Factors},
journal = {CoRR},
volume = {abs/2207.08075},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.08075},
doi = {10.48550/ARXIV.2207.08075},
eprinttype = {arXiv},
eprint = {2207.08075},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-08075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-09545,
author = {Hu Fu and
Jiawei Li and
Daogao Liu},
title = {Pandora Box Problem with Nonobligatory Inspection: Hardness and Improved
Approximation Algorithms},
journal = {CoRR},
volume = {abs/2207.09545},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.09545},
doi = {10.48550/ARXIV.2207.09545},
eprinttype = {arXiv},
eprint = {2207.09545},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-09545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-11821,
author = {Tu N. Nguyen and
Dung H. P. Nguyen and
Dang H. Pham and
Bing{-}Hong Liu and
Hoa Ngoc Nguyen},
title = {Maximizing Entanglement Routing Rate in Quantum Networks: Approximation
Algorithms},
journal = {CoRR},
volume = {abs/2207.11821},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.11821},
doi = {10.48550/ARXIV.2207.11821},
eprinttype = {arXiv},
eprint = {2207.11821},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-11821.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-13121,
author = {Rajmohan Rajaraman and
David Stalfa and
Sheng Yang},
title = {Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent
Delays},
journal = {CoRR},
volume = {abs/2207.13121},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.13121},
doi = {10.48550/ARXIV.2207.13121},
eprinttype = {arXiv},
eprint = {2207.13121},
timestamp = {Mon, 01 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-13121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-00740,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
title = {A simple polynomial-time approximation algorithm for total variation
distances between product distributions},
journal = {CoRR},
volume = {abs/2208.00740},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.00740},
doi = {10.48550/ARXIV.2208.00740},
eprinttype = {arXiv},
eprint = {2208.00740},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-00740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-03294,
author = {Mingyang Gong and
Brett Edgar and
Jing Fan and
Guohui Lin and
Eiji Miyano},
title = {Approximation algorithms for covering vertices by long paths},
journal = {CoRR},
volume = {abs/2208.03294},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.03294},
doi = {10.48550/ARXIV.2208.03294},
eprinttype = {arXiv},
eprint = {2208.03294},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-03294.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-04410,
author = {Majid Farhadi and
Jai Moondra and
Prasad Tetali and
Alejandro Toriello},
title = {Multi Purpose Routing: New Perspectives and Approximation Algorithms},
journal = {CoRR},
volume = {abs/2208.04410},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.04410},
doi = {10.48550/ARXIV.2208.04410},
eprinttype = {arXiv},
eprint = {2208.04410},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-04410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-08670,
author = {Siddharth Barman and
Pooja Kulkarni},
title = {Approximation Algorithms for Envy-Free Cake Division with Connected
Pieces},
journal = {CoRR},
volume = {abs/2208.08670},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.08670},
doi = {10.48550/ARXIV.2208.08670},
eprinttype = {arXiv},
eprint = {2208.08670},
timestamp = {Mon, 22 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-08670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09373,
author = {Zeev Nutov},
title = {An {\textdollar}O({\textbackslash}sqrt\{k\}){\textdollar}-approximation
algorithm for minimum power {\textdollar}k{\textdollar} edge disjoint
{\textdollar}st{\textdollar} -paths},
journal = {CoRR},
volume = {abs/2208.09373},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09373},
doi = {10.48550/ARXIV.2208.09373},
eprinttype = {arXiv},
eprint = {2208.09373},
timestamp = {Mon, 22 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09373.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-09583,
author = {Gergely K{\'{a}}l Cs{\'{a}}ji and
Tam{\'{a}}s Kir{\'{a}}ly and
Yu Yokoi},
title = {Approximation Algorithms for Matroidal and Cardinal Generalizations
of Stable Matching},
journal = {CoRR},
volume = {abs/2208.09583},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.09583},
doi = {10.48550/ARXIV.2208.09583},
eprinttype = {arXiv},
eprint = {2208.09583},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-09583.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-14264,
author = {Yingli Ran and
Zhao Zhang},
title = {Approximation Algorithm for Minimum p Union Under a Geometric Setting},
journal = {CoRR},
volume = {abs/2208.14264},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.14264},
doi = {10.48550/ARXIV.2208.14264},
eprinttype = {arXiv},
eprint = {2208.14264},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-14264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-14304,
author = {Saswata Jana and
Partha Sarathi Mandal},
title = {Approximation Algorithms for Drone Delivery Packing Problem},
journal = {CoRR},
volume = {abs/2208.14304},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.14304},
doi = {10.48550/ARXIV.2208.14304},
eprinttype = {arXiv},
eprint = {2208.14304},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-14304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-01002,
author = {Frances Y. Kuo and
Weiwen Mo and
Dirk Nuyens},
title = {Constructing Embedded Lattice-based Algorithms for Multivariate Function
Approximation with a Composite Number of Points},
journal = {CoRR},
volume = {abs/2209.01002},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.01002},
doi = {10.48550/ARXIV.2209.01002},
eprinttype = {arXiv},
eprint = {2209.01002},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-01002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-01147,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa},
title = {Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple,
and Practical},
journal = {CoRR},
volume = {abs/2209.01147},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.01147},
doi = {10.48550/ARXIV.2209.01147},
eprinttype = {arXiv},
eprint = {2209.01147},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-01147.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-2209-07860,
author = {Vera Traub and
Rico Zenklusen},
title = {A (1.5+{\(\epsilon\)})-Approximation Algorithm for Weighted Connectivity
Augmentation},
journal = {CoRR},
volume = {abs/2209.07860},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.07860},
doi = {10.48550/ARXIV.2209.07860},
eprinttype = {arXiv},
eprint = {2209.07860},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-07860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-09670,
author = {Ian Davidson and
Michael J. Livanos and
Antoine Gourru and
Peter B. Walker and
Julien Velcin and
S. S. Ravi},
title = {Explainable Clustering via Exemplars: Complexity and Efficient Approximation
Algorithms},
journal = {CoRR},
volume = {abs/2209.09670},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.09670},
doi = {10.48550/ARXIV.2209.09670},
eprinttype = {arXiv},
eprint = {2209.09670},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-09670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-12273,
author = {Chandra Chekuri and
Rhea Jain},
title = {Augmentation based Approximation Algorithms for Flexible Network Design},
journal = {CoRR},
volume = {abs/2209.12273},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.12273},
doi = {10.48550/ARXIV.2209.12273},
eprinttype = {arXiv},
eprint = {2209.12273},
timestamp = {Wed, 05 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-12273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-01888,
author = {Tanvi Bajpai and
Chandra Chekuri},
title = {Bicriteria Approximation Algorithms for Priority Matroid Median},
journal = {CoRR},
volume = {abs/2210.01888},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.01888},
doi = {10.48550/ARXIV.2210.01888},
eprinttype = {arXiv},
eprint = {2210.01888},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-01888.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-03811,
author = {Marc Dufay and
Claire Mathieu and
Hang Zhou},
title = {An Approximation Algorithm for Distance-Constrained Vehicle Routing
on Trees},
journal = {CoRR},
volume = {abs/2210.03811},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.03811},
doi = {10.48550/ARXIV.2210.03811},
eprinttype = {arXiv},
eprint = {2210.03811},
timestamp = {Wed, 12 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-03811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-03831,
author = {Jeremiah Blocki and
Elena Grigorescu and
Tamalika Mukherjee and
Samson Zhou},
title = {How to Make Your Approximation Algorithm Private: {A} Black-Box Differentially-Private
Transformation for Tunable Approximation Algorithms of Functions with
Low Sensitivity},
journal = {CoRR},
volume = {abs/2210.03831},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.03831},
doi = {10.48550/ARXIV.2210.03831},
eprinttype = {arXiv},
eprint = {2210.03831},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-03831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-06559,
author = {Konstanty Junosza{-}Szaniawski and
Dariusz Nogalski and
Pawel Rzazewski},
title = {Exact and approximation algorithms for sensor placement against DDoS
attacks},
journal = {CoRR},
volume = {abs/2210.06559},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.06559},
doi = {10.48550/ARXIV.2210.06559},
eprinttype = {arXiv},
eprint = {2210.06559},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-06559.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-08107,
author = {Shamak Dutta and
Nils Wilde and
Pratap Tokekar and
Stephen L. Smith},
title = {Approximation Algorithms for Robot Tours in Random Fields with Guaranteed
Estimation Accuracy},
journal = {CoRR},
volume = {abs/2210.08107},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.08107},
doi = {10.48550/ARXIV.2210.08107},
eprinttype = {arXiv},
eprint = {2210.08107},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-08107.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/corr/abs-2210-16534,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {Improved Approximation Algorithms for Capacitated Vehicle Routing
with Fixed Capacity},
journal = {CoRR},
volume = {abs/2210.16534},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.16534},
doi = {10.48550/ARXIV.2210.16534},
eprinttype = {arXiv},
eprint = {2210.16534},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-16534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01462,
author = {Yanyan Shi},
title = {Drift approximation by the modified Boris algorithm of charged-particle
dynamics in toroidal geometry},
journal = {CoRR},
volume = {abs/2211.01462},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01462},
doi = {10.48550/ARXIV.2211.01462},
eprinttype = {arXiv},
eprint = {2211.01462},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01462.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01699,
author = {Danish Kashaev and
Guido Sch{\"{a}}fer},
title = {A Round and Bipartize Approximation Algorithm for Vertex Cover},
journal = {CoRR},
volume = {abs/2211.01699},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01699},
doi = {10.48550/ARXIV.2211.01699},
eprinttype = {arXiv},
eprint = {2211.01699},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03653,
author = {Gianlorenzo D'Angelo and
Esmaeil Delfaraz},
title = {Approximation algorithms for Node-weighted Steiner Problems: Digraphs
with Additive Prizes and Graphs with Submodular Prizes},
journal = {CoRR},
volume = {abs/2211.03653},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03653},
doi = {10.48550/ARXIV.2211.03653},
eprinttype = {arXiv},
eprint = {2211.03653},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03695,
author = {Jakub Tetek},
title = {Additive Noise Mechanisms for Making Randomized Approximation Algorithms
Differentially Private},
journal = {CoRR},
volume = {abs/2211.03695},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03695},
doi = {10.48550/ARXIV.2211.03695},
eprinttype = {arXiv},
eprint = {2211.03695},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04639,
author = {Billy Jin and
Nathan Klein and
David P. Williamson},
title = {A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances
of the {TSP}},
journal = {CoRR},
volume = {abs/2211.04639},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04639},
doi = {10.48550/ARXIV.2211.04639},
eprinttype = {arXiv},
eprint = {2211.04639},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-06636,
author = {Saswata Jana and
Partha Sarathi Mandal},
title = {Approximation Algorithms for Drone Delivery Scheduling Problem},
journal = {CoRR},
volume = {abs/2211.06636},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.06636},
doi = {10.48550/ARXIV.2211.06636},
eprinttype = {arXiv},
eprint = {2211.06636},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-06636.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-07019,
author = {Ernesto Parra Inza and
Frank Angel Hern{\'{a}}ndez Mira and
Jos{\'{e}} Mar{\'{\i}}a Sigarreta Almira and
Nodari Vakhania},
title = {Exact and Approximation Algorithms for the Domination Problem},
journal = {CoRR},
volume = {abs/2211.07019},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.07019},
doi = {10.48550/ARXIV.2211.07019},
eprinttype = {arXiv},
eprint = {2211.07019},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-07019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-12541,
author = {Mahmut Levent Dogan and
Jonathan Leake and
Mohan Ravichandran},
title = {Deterministic Approximation Algorithms for Volumes of Spectrahedra},
journal = {CoRR},
volume = {abs/2211.12541},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.12541},
doi = {10.48550/ARXIV.2211.12541},
eprinttype = {arXiv},
eprint = {2211.12541},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-12541.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-14082,
author = {Benedikt M. Plank and
Kevin Schewior},
title = {Simple Algorithms for Stochastic Score Classification with Small Approximation
Ratios},
journal = {CoRR},
volume = {abs/2211.14082},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.14082},
doi = {10.48550/ARXIV.2211.14082},
eprinttype = {arXiv},
eprint = {2211.14082},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-14082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-15506,
author = {Manuel Bogoya and
Sergei M. Grudsky and
Stefano Serra Capizzano},
title = {Fast non-Hermitian Toeplitz eigenvalue computations, joining matrix-less
algorithms and {FDE} approximation matrices},
journal = {CoRR},
volume = {abs/2211.15506},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.15506},
doi = {10.48550/ARXIV.2211.15506},
eprinttype = {arXiv},
eprint = {2211.15506},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-15506.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-16442,
author = {Alberto Del Pia},
title = {An Approximation Algorithm for Indefinite Mixed Integer Quadratic
Programming},
journal = {CoRR},
volume = {abs/2211.16442},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.16442},
doi = {10.48550/ARXIV.2211.16442},
eprinttype = {arXiv},
eprint = {2211.16442},
timestamp = {Fri, 02 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-16442.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-00411,
author = {Pawel Przybylowicz and
Verena Schwarz and
Michaela Sz{\"{o}}lgyenyi},
title = {Randomized Milstein algorithm for approximation of solutions of jump-diffusion
SDEs},
journal = {CoRR},
volume = {abs/2212.00411},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.00411},
doi = {10.48550/ARXIV.2212.00411},
eprinttype = {arXiv},
eprint = {2212.00411},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-00411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-02370,
author = {Naifeng Liu},
title = {Two 6-approximation Algorithms for the Stochastic Score Classification
Problem},
journal = {CoRR},
volume = {abs/2212.02370},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.02370},
doi = {10.48550/ARXIV.2212.02370},
eprinttype = {arXiv},
eprint = {2212.02370},
timestamp = {Thu, 08 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-02370.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-06296,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
title = {A (Slightly) Improved Deterministic Approximation Algorithm for Metric
{TSP}},
journal = {CoRR},
volume = {abs/2212.06296},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.06296},
doi = {10.48550/ARXIV.2212.06296},
eprinttype = {arXiv},
eprint = {2212.06296},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-06296.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-06414,
author = {Hong{-}Yan Zhang and
Fei Liu and
Yu Zhou and
Man Liang},
title = {Even Order Explicit Symplectic Geometric Algorithms for Quaternion
Kinematical Differential Equation in Guidance Navigation and Control
via Diagonal Pad{\`{e}} Approximation and Cayley Transform},
journal = {CoRR},
volume = {abs/2212.06414},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.06414},
doi = {10.48550/ARXIV.2212.06414},
eprinttype = {arXiv},
eprint = {2212.06414},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-06414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-12240,
author = {Jingyang Zhao and
Mingyu Xiao},
title = {Practical Algorithms with Guaranteed Approximation Ratio for {TTP}
with Maximum Tour Length Two},
journal = {CoRR},
volume = {abs/2212.12240},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.12240},
doi = {10.48550/ARXIV.2212.12240},
eprinttype = {arXiv},
eprint = {2212.12240},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-12240.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-00772,
title = {Improved Approximation Algorithm for Graph Burning on Trees},
journal = {CoRR},
volume = {abs/2204.00772},
year = {2022},
note = {Withdrawn.},
url = {https://doi.org/10.48550/arXiv.2204.00772},
doi = {10.48550/ARXIV.2204.00772},
eprinttype = {arXiv},
eprint = {2204.00772},
timestamp = {Sat, 17 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-00772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/XueHSLZ21,
author = {Zhanao Xue and
Haodong Hou and
Bingxin Sun and
Yongxiang Li and
Yanna Zhang},
title = {Object-First Incremental Algorithms for Updating Approximations in
Multi-Granulation Fuzzy Probabilistic Rough Sets Over Two Universes},
journal = {{IEEE} Access},
volume = {9},
pages = {7127--7142},
year = {2021},
url = {https://doi.org/10.1109/ACCESS.2021.3049339},
doi = {10.1109/ACCESS.2021.3049339},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/access/XueHSLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/ZhangZZ21,
author = {Zhen Zhang and
Jinchuan Zhang and
Lingzhi Zhu},
title = {A Parameterized Approximation Algorithm for the Chromatic k-Median
Problem},
journal = {{IEEE} Access},
volume = {9},
pages = {31678--31683},
year = {2021},
url = {https://doi.org/10.1109/ACCESS.2021.3060422},
doi = {10.1109/ACCESS.2021.3060422},
timestamp = {Thu, 23 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/access/ZhangZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/advor/NyiamS21,
author = {Paschal B. Nyiam and
Abdellah Salhi},
title = {A Comparison of Benson's Outer Approximation Algorithm with an Extended
Version of Multiobjective Simplex Algorithm},
journal = {Adv. Oper. Res.},
volume = {2021},
pages = {1857030:1--1857030:11},
year = {2021},
url = {https://doi.org/10.1155/2021/1857030},
doi = {10.1155/2021/1857030},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/advor/NyiamS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aghcs/GlutP21,
author = {Barbara Glut and
Maciej Paszynski},
title = {Overview of Adaptive and Low-Rank Approximation Algorithms for Modeling
of The Influence of Electromagnetic Waves Generated by The Cell Phone
Antenna on The Human Head},
journal = {Comput. Sci.},
volume = {22},
number = {4},
year = {2021},
url = {https://doi.org/10.7494/csci.2021.22.4.4251},
doi = {10.7494/CSCI.2021.22.4.4251},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aghcs/GlutP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/GargT21,
author = {Jugal Garg and
Setareh Taki},
title = {An improved approximation algorithm for maximin shares},
journal = {Artif. Intell.},
volume = {300},
pages = {103547},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103547},
doi = {10.1016/J.ARTINT.2021.103547},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/GargT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BiswasRS21,
author = {Arindam Biswas and
Venkatesh Raman and
Saket Saurabh},
title = {Approximation in (Poly-) Logarithmic Space},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2303--2331},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00826-7},
doi = {10.1007/S00453-021-00826-7},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BiswasRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuryGSS21,
author = {Marc Bury and
Michele Gentili and
Chris Schwiegelshohn and
Mara Sorella},
title = {Polynomial Time Approximation Schemes for All 1-Center Problems on
Metric Rational Set Similarities},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1371--1392},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00787-3},
doi = {10.1007/S00453-020-00787-3},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuryGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenCLXZ21,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin and
Yao Xu and
An Zhang},
title = {Approximation Algorithms for Maximally Balanced Connected Graph Partition},
journal = {Algorithmica},
volume = {83},
number = {12},
pages = {3715--3740},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00870-3},
doi = {10.1007/S00453-021-00870-3},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenCLXZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DavotCGWT21,
author = {Tom Davot and
Annie Chateau and
Rodolphe Giroudeau and
Mathias Weller and
Dorine Tabary},
title = {Producing Genomic Sequences after Genome Scaffolding with Ambiguous
Paths: Complexity, Approximation and Lower Bounds},
journal = {Algorithmica},
volume = {83},
number = {7},
pages = {2063--2095},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00819-6},
doi = {10.1007/S00453-021-00819-6},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DavotCGWT21.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/algorithmica/Zhang21,
author = {Jie Zhang},
title = {Average-Case Approximation Ratio of Scheduling without Payments},
journal = {Algorithmica},
volume = {83},
number = {6},
pages = {1638--1652},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00796-2},
doi = {10.1007/S00453-020-00796-2},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/Zhang21.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/FlamminiMMSZ21,
author = {Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli and
Mordechai Shalom and
Shmuel Zaks},
title = {The Traffic Grooming Problem in Optical Networks with Respect to ADMs
and OADMs: Complexity and Approximation},
journal = {Algorithms},
volume = {14},
number = {5},
pages = {151},
year = {2021},
url = {https://doi.org/10.3390/a14050151},
doi = {10.3390/A14050151},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/FlamminiMMSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/HeZML21,
author = {Zhenwen He and
Chunfeng Zhang and
Xiaogang Ma and
Gang Liu},
title = {Hexadecimal Aggregate Approximation Representation and Classification
of Time Series Data},
journal = {Algorithms},
volume = {14},
number = {12},
pages = {353},
year = {2021},
url = {https://doi.org/10.3390/a14120353},
doi = {10.3390/A14120353},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithms/HeZML21.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/algorithms/MirandaALD21,
author = {Guilherme Henrique Santos Miranda and
Alexsandro Oliveira Alexandrino and
Carla Negri Lintzmayer and
Zanoni Dias},
title = {Approximation Algorithms for Sorting {\(\lambda\)}-Permutations by
{\(\lambda\)}-Operations},
journal = {Algorithms},
volume = {14},
number = {6},
pages = {175},
year = {2021},
url = {https://doi.org/10.3390/a14060175},
doi = {10.3390/A14060175},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/MirandaALD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/Zhao21,
author = {Wenxiao Zhao},
title = {An Introduction to Development of Centralized and Distributed Stochastic
Approximation Algorithm with Expanding Truncations},
journal = {Algorithms},
volume = {14},
number = {6},
pages = {174},
year = {2021},
url = {https://doi.org/10.3390/a14060174},
doi = {10.3390/A14060174},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/Zhao21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/BritoOADD21,
author = {Klairton Lima Brito and
Andre Rodrigues Oliveira and
Alexsandro Oliveira Alexandrino and
Ulisses Dias and
Zanoni Dias},
title = {An improved approximation algorithm for the reversal and transposition
distance considering gene order and intergenic sizes},
journal = {Algorithms Mol. Biol.},
volume = {16},
number = {1},
pages = {24},
year = {2021},
url = {https://doi.org/10.1186/s13015-021-00203-7},
doi = {10.1186/S13015-021-00203-7},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/BritoOADD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/SiqueiraAOD21,
author = {Gabriel Siqueira and
Alexsandro Oliveira Alexandrino and
Andre Rodrigues Oliveira and
Zanoni Dias},
title = {Approximation algorithm for rearrangement distances considering repeated
genes and intergenic regions},
journal = {Algorithms Mol. Biol.},
volume = {16},
number = {1},
pages = {21},
year = {2021},
url = {https://doi.org/10.1186/s13015-021-00200-w},
doi = {10.1186/S13015-021-00200-W},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/SiqueiraAOD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/CroceTP21,
author = {Federico Della Croce and
Vincent T'kindt and
Olivier Ploton},
title = {Parallel machine scheduling with minimum number of tardy jobs: Approximation
and exponential algorithms},
journal = {Appl. Math. Comput.},
volume = {397},
pages = {125888},
year = {2021},
url = {https://doi.org/10.1016/j.amc.2020.125888},
doi = {10.1016/J.AMC.2020.125888},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/CroceTP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/YuLB21a,
author = {Wei Yu and
Zhaohui Liu and
Xiaoguang Bao},
title = {Approximation algorithms for some min-max postmen cover problems},
journal = {Ann. Oper. Res.},
volume = {300},
number = {1},
pages = {267--287},
year = {2021},
url = {https://doi.org/10.1007/s10479-021-03933-4},
doi = {10.1007/S10479-021-03933-4},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/YuLB21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/auinsy/FuCZ21,
author = {Kewei Fu and
Han{-}Fu Chen and
Wenxiao Zhao},
title = {Distributed dynamic stochastic approximation algorithm over time-varying
networks},
journal = {Auton. Intell. Syst.},
volume = {1},
number = {1},
year = {2021},
url = {https://doi.org/10.1007/s43684-021-00003-1},
doi = {10.1007/S43684-021-00003-1},
timestamp = {Mon, 07 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/auinsy/FuCZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/axioms/AlmusawaHS21,
author = {Hassan Almusawa and
Hasanen A. Hammad and
Nisha Sharma},
title = {Approximation of the Fixed Point for Unified Three-Step Iterative
Algorithm with Convergence Analysis in Busemann Spaces},
journal = {Axioms},
volume = {10},
number = {1},
pages = {26},
year = {2021},
url = {https://doi.org/10.3390/axioms10010026},
doi = {10.3390/AXIOMS10010026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/axioms/AlmusawaHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cad/Du0FMX21,
author = {Jie Du and
Ying He and
Zheng Fang and
Wenlong Meng and
Shi{-}Qing Xin},
title = {On the Vertex-oriented Triangle Propagation {(VTP)} Algorithm: Parallelization
and Approximation},
journal = {Comput. Aided Des.},
volume = {130},
pages = {102943},
year = {2021},
url = {https://doi.org/10.1016/j.cad.2020.102943},
doi = {10.1016/J.CAD.2020.102943},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cad/Du0FMX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/chinaf/0024F0021,
author = {Zhen Zhang and
Qilong Feng and
Jinhui Xu and
Jianxin Wang},
title = {An approximation algorithm for k-median with priorities},
journal = {Sci. China Inf. Sci.},
volume = {64},
number = {5},
year = {2021},
url = {https://doi.org/10.1007/s11432-020-3066-x},
doi = {10.1007/S11432-020-3066-X},
timestamp = {Thu, 23 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/chinaf/0024F0021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/TillmannK21,
author = {Andreas M. Tillmann and
Leif Kobbelt},
title = {Structured discrete shape approximation: Theoretical complexity and
practical algorithm},
journal = {Comput. Geom.},
volume = {99},
pages = {101795},
year = {2021},
url = {https://doi.org/10.1016/j.comgeo.2021.101795},
doi = {10.1016/J.COMGEO.2021.101795},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/TillmannK21.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/concurrency/MatsumuraTKIN21,
author = {Naoki Matsumura and
Hiroki Tokura and
Yuki Kuroda and
Yasuaki Ito and
Koji Nakano},
title = {Tile art image generation using parallel greedy algorithm on the {GPU}
and its approximation with machine learning},
journal = {Concurr. Comput. Pract. Exp.},
volume = {33},
number = {12},
year = {2021},
url = {https://doi.org/10.1002/cpe.5623},
doi = {10.1002/CPE.5623},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/concurrency/MatsumuraTKIN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BadriBG21,
author = {Hossein Badri and
Tayebeh Bahreini and
Daniel Grosu},
title = {A parallel randomized approximation algorithm for non-preemptive single
machine scheduling with release dates and delivery times},
journal = {Comput. Oper. Res.},
volume = {130},
pages = {105238},
year = {2021},
url = {https://doi.org/10.1016/j.cor.2021.105238},
doi = {10.1016/J.COR.2021.105238},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BadriBG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Garn21,
author = {Wolfgang Garn},
title = {Balanced dynamic multiple travelling salesmen: Algorithms and continuous
approximations},
journal = {Comput. Oper. Res.},
volume = {136},
pages = {105509},
year = {2021},
url = {https://doi.org/10.1016/j.cor.2021.105509},
doi = {10.1016/J.COR.2021.105509},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/Garn21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerHJM21,
author = {Martin E. Dyer and
Marc Heinrich and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {Polynomial-time approximation algorithms for the antiferromagnetic
Ising model on line graphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {6},
pages = {905--921},
year = {2021},
url = {https://doi.org/10.1017/S0963548321000080},
doi = {10.1017/S0963548321000080},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerHJM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cphysics/AustinKLMMS21,
author = {Anthony P. Austin and
Mohan Krishnamoorthy and
Sven Leyffer and
Stephen Mrenna and
Juliane M{\"{u}}ller and
Holger Schulz},
title = {Practical algorithms for multivariate rational approximation},
journal = {Comput. Phys. Commun.},
volume = {261},
pages = {107663},
year = {2021},
url = {https://doi.org/10.1016/j.cpc.2020.107663},
doi = {10.1016/J.CPC.2020.107663},
timestamp = {Thu, 06 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cphysics/AustinKLMMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YangL21,
author = {Liya Yang and
Xiwen Lu},
title = {Approximation algorithms for some position-dependent scheduling problems},
journal = {Discret. Appl. Math.},
volume = {289},
pages = {22--31},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.09.014},
doi = {10.1016/J.DAM.2020.09.014},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YangL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/LiuD21,
author = {Siwen Liu and
Hongmin W. Du},
title = {Constant-approximation for minimum weight partial sensor cover},
journal = {Discret. Math. Algorithms Appl.},
volume = {13},
number = {4},
pages = {2150047:1--2150047:8},
year = {2021},
url = {https://doi.org/10.1142/S1793830921500476},
doi = {10.1142/S1793830921500476},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/LiuD21.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/iandc/LinT21,
author = {Guohui Lin and
Weitian Tong},
title = {An improved approximation algorithm for the minimum common integer
partition problem},
journal = {Inf. Comput.},
volume = {281},
pages = {104784},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2021.104784},
doi = {10.1016/J.IC.2021.104784},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/LinT21.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/ieeenl/YanaseHO21,
author = {Souhei Yanase and
Fujun He and
Eiji Oki},
title = {Approximation Algorithms to Distributed Server Allocation With Preventive
Start-Time Optimization Against Server Failure},
journal = {{IEEE} Netw. Lett.},
volume = {3},
number = {4},
pages = {191--195},
year = {2021},
url = {https://doi.org/10.1109/lnet.2021.3116235},
doi = {10.1109/LNET.2021.3116235},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieeenl/YanaseHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicetd/FujiwaraWY21,
author = {Hiroshi Fujiwara and
Yuta Wanikawa and
Hiroaki Yamamoto},
title = {Asymptotic Approximation Ratios for Certain Classes of Online Bin
Packing Algorithms},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {104-D},
number = {3},
pages = {362--369},
year = {2021},
url = {http://search.ieice.org/bin/summary.php?id=e104-d\_3\_362},
timestamp = {Mon, 17 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicetd/FujiwaraWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iet-cds/ChiluveruTB21,
author = {Samba Raju Chiluveru and
Manoj Tripathy and
Bibhudutta},
title = {Non-linear activation function approximation using a {REMEZ} algorithm},
journal = {{IET} Circuits Devices Syst.},
volume = {15},
number = {7},
pages = {630--640},
year = {2021},
url = {https://doi.org/10.1049/cds2.12058},
doi = {10.1049/CDS2.12058},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iet-cds/ChiluveruTB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iet-ifs/Cho0021,
author = {Wonhee Cho and
Jiseung Kim and
Changmin Lee},
title = {Extension of simultaneous Diophantine approximation algorithm for
partial approximate common divisor variants},
journal = {{IET} Inf. Secur.},
volume = {15},
number = {6},
pages = {417--427},
year = {2021},
url = {https://doi.org/10.1049/ise2.12032},
doi = {10.1049/ISE2.12032},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iet-ifs/Cho0021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijahuc/BhatSHY21,
author = {Jagadeesha R. Bhat and
Jang{-}Ping Sheu and
Wing{-}Kai Hon and
Cian{-}You Yang},
title = {Approximation algorithms for profit maximisation in multicast {D2D}
networks},
journal = {Int. J. Ad Hoc Ubiquitous Comput.},
volume = {36},
number = {1},
pages = {8--19},
year = {2021},
url = {https://doi.org/10.1504/IJAHUC.2021.112979},
doi = {10.1504/IJAHUC.2021.112979},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijahuc/BhatSHY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ShenL21,
author = {Chenli Shen and
Wensong Lin},
title = {NP-Hardness and Approximation Algorithms for Iterative Pricing on
Social Networks with Externalities},
journal = {Int. J. Found. Comput. Sci.},
volume = {32},
number = {8},
pages = {957--979},
year = {2021},
url = {https://doi.org/10.1142/S0129054121500313},
doi = {10.1142/S0129054121500313},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ShenL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijon/LiWM21,
author = {Tao Li and
Di Wu and
Jinwen Ma},
title = {Mixture of robust Gaussian processes and its hard-cut {EM} algorithm
with variational bounding approximation},
journal = {Neurocomputing},
volume = {452},
pages = {224--238},
year = {2021},
url = {https://doi.org/10.1016/j.neucom.2021.04.085},
doi = {10.1016/J.NEUCOM.2021.04.085},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijon/LiWM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpr/WangC21,
author = {Shijin Wang and
Wenli Cui},
title = {Approximation algorithms for the min-max regret identical parallel
machine scheduling problem with outsourcing and uncertain processing
time},
journal = {Int. J. Prod. Res.},
volume = {59},
number = {15},
pages = {4579--4592},
year = {2021},
url = {https://doi.org/10.1080/00207543.2020.1766721},
doi = {10.1080/00207543.2020.1766721},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijpr/WangC21.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/iotj/Wang00ZL21,
author = {Zhongju Wang and
Long Wang and
Chao Huang and
Zijun Zhang and
Xiong Luo},
title = {Soil-Moisture-Sensor-Based Automated Soil Water Content Cycle Classification
With a Hybrid Symbolic Aggregate Approximation Algorithm},
journal = {{IEEE} Internet Things J.},
volume = {8},
number = {18},
pages = {14003--14012},
year = {2021},
url = {https://doi.org/10.1109/JIOT.2021.3068379},
doi = {10.1109/JIOT.2021.3068379},
timestamp = {Wed, 08 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iotj/Wang00ZL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itiis/WuHYG21,
author = {Shanshan Wu and
Guobing Hu and
Li Yang and
Bin Gu},
title = {Analytical Approximation Algorithm for the Inverse of the Power of
the Incomplete Gamma Function Based on Extreme Value Theory},
journal = {{KSII} Trans. Internet Inf. Syst.},
volume = {15},
number = {12},
pages = {4567--4583},
year = {2021},
url = {https://doi.org/10.3837/tiis.2021.12.017},
doi = {10.3837/TIIS.2021.12.017},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/itiis/WuHYG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jat/WenzelSH21,
author = {Tizian Wenzel and
Gabriele Santin and
Bernard Haasdonk},
title = {A novel class of stabilized greedy kernel approximation algorithms:
Convergence, stability and uniform point distribution},
journal = {J. Approx. Theory},
volume = {262},
pages = {105508},
year = {2021},
url = {https://doi.org/10.1016/j.jat.2020.105508},
doi = {10.1016/J.JAT.2020.105508},
timestamp = {Sat, 09 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jat/WenzelSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/CheWY21,
author = {Maolin Che and
Yiming Wei and
Hong Yan},
title = {Randomized algorithms for the low multilinear rank approximations
of tensors},
journal = {J. Comput. Appl. Math.},
volume = {390},
pages = {113380},
year = {2021},
url = {https://doi.org/10.1016/j.cam.2020.113380},
doi = {10.1016/J.CAM.2020.113380},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcam/CheWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/KayijukaEKT21,
author = {Idrissa Kayijuka and
S. M. Ege and
Ali Konuralp and
F. Serap Topal},
title = {Clenshaw-Curtis algorithms for an efficient numerical approximation
of singular and highly oscillatory Fourier transform integrals},
journal = {J. Comput. Appl. Math.},
volume = {385},
pages = {113201},
year = {2021},
url = {https://doi.org/10.1016/j.cam.2020.113201},
doi = {10.1016/J.CAM.2020.113201},
timestamp = {Sun, 10 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcam/KayijukaEKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcam/MorkiszP21,
author = {Pawel M. Morkisz and
Pawel Przybylowicz},
title = {Randomized derivative-free Milstein algorithm for efficient approximation
of solutions of SDEs under noisy information},
journal = {J. Comput. Appl. Math.},
volume = {383},
pages = {113112},
year = {2021},
url = {https://doi.org/10.1016/j.cam.2020.113112},
doi = {10.1016/J.CAM.2020.113112},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcam/MorkiszP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenCLWZ21,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Guohui Lin and
Lusheng Wang and
An Zhang},
title = {A randomized approximation algorithm for metric triangle packing},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {12--27},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00660-7},
doi = {10.1007/S10878-020-00660-7},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenCLWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DondiHMZ21,
author = {Riccardo Dondi and
Mohammad Mehdi Hosseinzadeh and
Giancarlo Mauri and
Italo Zoppis},
title = {Top-k overlapping densest subgraphs: approximation algorithms and
computational complexity},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {80--104},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00664-3},
doi = {10.1007/S10878-020-00664-3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DondiHMZ21.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/jco/PengLL21,
author = {Anzhen Peng and
Longcheng Liu and
Weifeng Lin},
title = {Improved approximation algorithms for two-stage flexible flow shop
scheduling},
journal = {J. Comb. Optim.},
volume = {41},
number = {1},
pages = {28--42},
year = {2021},
url = {https://doi.org/10.1007/s10878-020-00657-2},
doi = {10.1007/S10878-020-00657-2},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/PengLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JonesKS21,
author = {Mark Jones and
Steven Kelk and
Leen Stougie},
title = {Maximum parsimony distance on phylogenetic trees: {A} linear kernel
and constant factor approximation algorithm},
journal = {J. Comput. Syst. Sci.},
volume = {117},
pages = {165--181},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.10.003},
doi = {10.1016/J.JCSS.2020.10.003},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JonesKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KawaseMM21,
author = {Yasushi Kawase and
Tomomi Matsui and
Atsushi Miyauchi},
title = {Additive approximation algorithms for modularity maximization},
journal = {J. Comput. Syst. Sci.},
volume = {117},
pages = {182--201},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.11.005},
doi = {10.1016/J.JCSS.2020.11.005},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KawaseMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LiZW21,
author = {Xingfu Li and
Daming Zhu and
Lusheng Wang},
title = {A 43-approximation algorithm for the Maximum Internal Spanning Tree
Problem},
journal = {J. Comput. Syst. Sci.},
volume = {118},
pages = {131--140},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.01.001},
doi = {10.1016/J.JCSS.2021.01.001},
timestamp = {Sat, 09 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LiZW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jei/WangWHRR21,
author = {Guisheng Wang and
Yequn Wang and
Guoce Huang and
Qinghua Ren and
Tingting Ren},
title = {Simultaneous sparse learning algorithm of structured approximation
with transformation analysis embedded in Bayesian framework},
journal = {J. Electronic Imaging},
volume = {30},
number = {5},
year = {2021},
url = {https://doi.org/10.1117/1.jei.30.5.053006},
doi = {10.1117/1.JEI.30.5.053006},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jei/WangWHRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/RanHZD21,
author = {Yingli Ran and
Xiaohui Huang and
Zhao Zhang and
Ding{-}Zhu Du},
title = {Approximation algorithm for minimum power partial multi-coverage in
wireless sensor networks},
journal = {J. Glob. Optim.},
volume = {80},
number = {3},
pages = {661--677},
year = {2021},
url = {https://doi.org/10.1007/s10898-021-01033-y},
doi = {10.1007/S10898-021-01033-Y},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/RanHZD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AshurFK21,
author = {Stav Ashur and
Omrit Filtser and
Matthew J. Katz},
title = {A constant-factor approximation algorithm for vertex guarding a WV-polygon},
journal = {J. Comput. Geom.},
volume = {12},
number = {1},
pages = {128--144},
year = {2021},
url = {https://doi.org/10.20382/jocg.v12i1a6},
doi = {10.20382/JOCG.V12I1A6},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AshurFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/ChenZTXC21,
author = {Yong Chen and
An Zhang and
Zhiyi Tan and
Ying Xue and
Guangting Chen},
title = {A (32+{\(\epsilon\)})-approximation algorithm for scheduling on two
parallel machines with job delivery coordination},
journal = {J. Oper. Res. Soc.},
volume = {72},
number = {9},
pages = {1929--1942},
year = {2021},
url = {https://doi.org/10.1080/01605682.2019.1655204},
doi = {10.1080/01605682.2019.1655204},
timestamp = {Mon, 16 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jors/ChenZTXC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/Strusevich21,
author = {Vitaly A. Strusevich},
title = {Approximation algorithms for makespan minimization on identical parallel
machines under resource constraints},
journal = {J. Oper. Res. Soc.},
volume = {72},
number = {9},
pages = {2135--2146},
year = {2021},
url = {https://doi.org/10.1080/01605682.2020.1772019},
doi = {10.1080/01605682.2020.1772019},
timestamp = {Tue, 19 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/Strusevich21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jossac/ChenDBM21,
author = {Shuhang Chen and
Adithya M. Devraj and
Andrey Berstein and
Sean P. Meyn},
title = {Revisiting the {ODE} Method for Recursive Algorithms: Fast Convergence
Using Quasi Stochastic Approximation},
journal = {J. Syst. Sci. Complex.},
volume = {34},
number = {5},
pages = {1681--1702},
year = {2021},
url = {https://doi.org/10.1007/s11424-021-1251-5},
doi = {10.1007/S11424-021-1251-5},
timestamp = {Fri, 29 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jossac/ChenDBM21.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/jsc/RosenkildeS21,
author = {Johan Rosenkilde and
Arne Storjohann},
title = {Algorithms for simultaneous Hermite-Pad{\'{e}} approximations},
journal = {J. Symb. Comput.},
volume = {102},
pages = {279--303},
year = {2021},
url = {https://doi.org/10.1016/j.jsc.2019.07.026},
doi = {10.1016/J.JSC.2019.07.026},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsc/RosenkildeS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/HuW21,
author = {Jun Hu and
Hua Wang},
title = {An Optimal Multigrid Algorithm for the Combining P\({}_{\mbox{1}}\)-Q\({}_{\mbox{1}}\)
Finite Element Approximations of Interface Problems Based on Local
Anisotropic Fitting Meshes},
journal = {J. Sci. Comput.},
volume = {88},
number = {1},
pages = {16},
year = {2021},
url = {https://doi.org/10.1007/s10915-021-01536-6},
doi = {10.1007/S10915-021-01536-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jscic/HuW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/XiaoYL21,
author = {Chuanfu Xiao and
Chao Yang and
Min Li},
title = {Efficient Alternating Least Squares Algorithms for Low Multilinear
Rank Approximation of Tensors},
journal = {J. Sci. Comput.},
volume = {87},
number = {3},
pages = {67},
year = {2021},
url = {https://doi.org/10.1007/s10915-021-01493-0},
doi = {10.1007/S10915-021-01493-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jscic/XiaoYL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kais/Alipour21,
author = {Sharareh Alipour},
title = {Improvements on approximation algorithms for clustering probabilistic
data},
journal = {Knowl. Inf. Syst.},
volume = {63},
number = {10},
pages = {2719--2740},
year = {2021},
url = {https://doi.org/10.1007/s10115-021-01601-4},
doi = {10.1007/S10115-021-01601-4},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/kais/Alipour21.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/moc/CoolsKNS21,
author = {Ronald Cools and
Frances Y. Kuo and
Dirk Nuyens and
Ian H. Sloan},
title = {Fast component-by-component construction of lattice algorithms for
multivariate approximation with {POD} and {SPOD} weights},
journal = {Math. Comput.},
volume = {90},
number = {328},
pages = {787--812},
year = {2021},
url = {https://doi.org/10.1090/mcom/3586},
doi = {10.1090/MCOM/3586},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/CoolsKNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Garber21,
author = {Dan Garber},
title = {Efficient Online Linear Optimization with Approximation Algorithms},
journal = {Math. Oper. Res.},
volume = {46},
number = {1},
pages = {204--220},
year = {2021},
url = {https://doi.org/10.1287/moor.2020.1053},
doi = {10.1287/MOOR.2020.1053},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/Garber21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GalvezGAS21,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Krzysztof Sornat},
title = {On the Cycle Augmentation Problem: Hardness and Approximation Algorithms},
journal = {Theory Comput. Syst.},
volume = {65},
number = {6},
pages = {985--1008},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10025-6},
doi = {10.1007/S00224-020-10025-6},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GalvezGAS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Ait-HaddouM21,
author = {Rachid Ait{-}Haddou and
Marie{-}Laurence Mazure},
title = {Blossoming and Hermite-Pad{\'{e}} approximation for hypergeometric
series},
journal = {Numer. Algorithms},
volume = {88},
number = {3},
pages = {1183--1214},
year = {2021},
url = {https://doi.org/10.1007/s11075-021-01071-3},
doi = {10.1007/S11075-021-01071-3},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/Ait-HaddouM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Al-MohyA21,
author = {Awad H. Al{-}Mohy and
Bahar Arslan},
title = {The complex step approximation to the higher order Fr{\'{e}}chet
derivatives of a matrix function},
journal = {Numer. Algorithms},
volume = {87},
number = {3},
pages = {1061--1074},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-00998-3},
doi = {10.1007/S11075-020-00998-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Al-MohyA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/AlahmadiAPR21,
author = {Jihan Alahmadi and
Hessah Alqahtani and
Miroslav S. Pranic and
Lothar Reichel},
title = {Gauss-Laurent-type quadrature rules for the approximation of functionals
of a nonsymmetric matrix},
journal = {Numer. Algorithms},
volume = {88},
number = {4},
pages = {1937--1964},
year = {2021},
url = {https://doi.org/10.1007/s11075-021-01101-0},
doi = {10.1007/S11075-021-01101-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/AlahmadiAPR21.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/GraciaO21,
author = {Jos{\'{e}} Luis Gracia and
Eugene O'Riordan},
title = {Numerical approximations to a singularly perturbed convection-diffusion
problem with a discontinuous initial condition},
journal = {Numer. Algorithms},
volume = {88},
number = {4},
pages = {1851--1873},
year = {2021},
url = {https://doi.org/10.1007/s11075-021-01098-6},
doi = {10.1007/S11075-021-01098-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/GraciaO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/Hofreither21,
author = {Clemens Hofreither},
title = {An algorithm for best rational approximation based on barycentric
rational interpolation},
journal = {Numer. Algorithms},
volume = {88},
number = {1},
pages = {365--388},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-01042-0},
doi = {10.1007/S11075-020-01042-0},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/Hofreither21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/LuoWZ21,
author = {Jianfeng Luo and
Xiaozhou Wang and
Yi Zhao},
title = {Convergence of discrete approximation for differential linear stochastic
complementarity systems},
journal = {Numer. Algorithms},
volume = {87},
number = {1},
pages = {223--262},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-00965-y},
doi = {10.1007/S11075-020-00965-Y},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/LuoWZ21.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/na/RodriguezRZ21,
author = {Ana Alonso Rodr{\'{\i}}guez and
Francesca Rapetti and
Elena Zappon},
title = {New degrees of freedom for high-order Whitney approximations of Darcy's
flows},
journal = {Numer. Algorithms},
volume = {87},
number = {4},
pages = {1613--1634},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-01022-4},
doi = {10.1007/S11075-020-01022-4},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/RodriguezRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/YangH21,
author = {Changqing Yang and
Jianhua Hou},
title = {Jacobi spectral approximation for boundary value problems of nonlinear
fractional pantograph differential equations},
journal = {Numer. Algorithms},
volume = {86},
number = {3},
pages = {1089--1108},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-00924-7},
doi = {10.1007/S11075-020-00924-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/na/YangH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/na/YangZ21,
author = {Jiming Yang and
Jing Zhou},
title = {A two-grid method for discontinuous Galerkin approximations to nonlinear
Sobolev equations},
journal = {Numer. Algorithms},
volume = {86},
number = {4},
pages = {1523--1541},
year = {2021},
url = {https://doi.org/10.1007/s11075-020-00943-4},
doi = {10.1007/S11075-020-00943-4},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/na/YangZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nla/LiW21,
author = {Ke Li and
Gang Wu},
title = {A randomized generalized low rank approximations of matrices algorithm
for high dimensionality reduction and image compression},
journal = {Numer. Linear Algebra Appl.},
volume = {28},
number = {1},
year = {2021},
url = {https://doi.org/10.1002/nla.2338},
doi = {10.1002/NLA.2338},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nla/LiW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/GaoGLWDH21,
author = {Jiawen Gao and
Suogang Gao and
Wen Liu and
Weili Wu and
Ding{-}Zhu Du and
Bo Hou},
title = {An approximation algorithm for the k-generalized Steiner forest problem},
journal = {Optim. Lett.},
volume = {15},
number = {4},
pages = {1475--1483},
year = {2021},
url = {https://doi.org/10.1007/s11590-021-01727-y},
doi = {10.1007/S11590-021-01727-Y},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/GaoGLWDH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/HanXLW21,
author = {Lu Han and
Dachuan Xu and
Dandan Liu and
Chenchen Wu},
title = {An approximation algorithm for the k-level facility location problem
with outliers},
journal = {Optim. Lett.},
volume = {15},
number = {6},
pages = {2053--2065},
year = {2021},
url = {https://doi.org/10.1007/s11590-021-01701-8},
doi = {10.1007/S11590-021-01701-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/HanXLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/HouGLWDH21,
author = {Chenfei Hou and
Suogang Gao and
Wen Liu and
Weili Wu and
Ding{-}Zhu Du and
Bo Hou},
title = {An approximation algorithm for the submodular multicut problem in
trees with linear penalties},
journal = {Optim. Lett.},
volume = {15},
number = {4},
pages = {1105--1112},
year = {2021},
url = {https://doi.org/10.1007/s11590-020-01665-1},
doi = {10.1007/S11590-020-01665-1},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/HouGLWDH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LiuL21,
author = {Xiaofei Liu and
Weidong Li},
title = {Approximation algorithms for the multiprocessor scheduling with submodular
penalties},
journal = {Optim. Lett.},
volume = {15},
number = {6},
pages = {2165--2180},
year = {2021},
url = {https://doi.org/10.1007/s11590-021-01724-1},
doi = {10.1007/S11590-021-01724-1},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LiuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/JuedesJ21,
author = {David W. Juedes and
Jeffrey Jones},
title = {A generic framework for approximation analysis of greedy algorithms
for star bicoloring},
journal = {Optim. Methods Softw.},
volume = {36},
number = {4},
pages = {869--890},
year = {2021},
url = {https://doi.org/10.1080/10556788.2019.1649671},
doi = {10.1080/10556788.2019.1649671},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/JuedesJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Ee21,
author = {Martijn van Ee},
title = {A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming
problem},
journal = {Oper. Res. Lett.},
volume = {49},
number = {5},
pages = {645--649},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.07.001},
doi = {10.1016/J.ORL.2021.07.001},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Ee21.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/pc/GonzalesGL21,
author = {Ronald Gonzales and
Yury Gryazin and
Yun Teck Lee},
title = {Parallel {FFT} algorithms for high-order approximations on three-dimensional
compact stencils},
journal = {Parallel Comput.},
volume = {103},
pages = {102757},
year = {2021},
url = {https://doi.org/10.1016/j.parco.2021.102757},
doi = {10.1016/J.PARCO.2021.102757},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pc/GonzalesGL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pomacs/0003CZZWYXT021,
author = {Kai Han and
Shuang Cui and
Tianshuai Zhu and
Enpei Zhang and
Benwei Wu and
Zhizhuo Yin and
Tong Xu and
Shaojie Tang and
He Huang},
title = {Approximation Algorithms for Submodular Data Summarization with a
Knapsack Constraint},
journal = {Proc. {ACM} Meas. Anal. Comput. Syst.},
volume = {5},
number = {1},
pages = {05:1--05:31},
year = {2021},
url = {https://doi.org/10.1145/3447383},
doi = {10.1145/3447383},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pomacs/0003CZZWYXT021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/HashimotoM21,
author = {Susumu Hashimoto and
Shinji Mizuno},
title = {A tight approximation ratio of a list scheduling algorithm for a single-machine
scheduling problem with a non-renewable resource},
journal = {J. Sched.},
volume = {24},
number = {3},
pages = {259--267},
year = {2021},
url = {https://doi.org/10.1007/s10951-021-00681-y},
doi = {10.1007/S10951-021-00681-Y},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/HashimotoM21.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/siamjo/LiuR21a,
author = {Zihan Liu and
Kannan Ramchandran},
title = {Adaptive Douglas-Rachford Splitting Algorithm from a Yosida Approximation
Standpoint},
journal = {{SIAM} J. Optim.},
volume = {31},
number = {3},
pages = {1971--1998},
year = {2021},
url = {https://doi.org/10.1137/20M131388X},
doi = {10.1137/20M131388X},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamjo/LiuR21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamnum/DelourmeH21,
author = {B{\'{e}}rang{\`{e}}re Delourme and
Laurence Halpern},
title = {A Complex Homographic Best Approximation Problem. Application to Optimized
Robin-Schwarz Algorithms, and Optimal Control Problems},
journal = {{SIAM} J. Numer. Anal.},
volume = {59},
number = {3},
pages = {1769--1810},
year = {2021},
url = {https://doi.org/10.1137/20M1335789},
doi = {10.1137/20M1335789},
timestamp = {Mon, 19 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamnum/DelourmeH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/Baddoo21,
author = {Peter J. Baddoo},
title = {The AAAtrig Algorithm for Rational Approximation of Periodic Functions},
journal = {{SIAM} J. Sci. Comput.},
volume = {43},
number = {5},
pages = {A3372--A3392},
year = {2021},
url = {https://doi.org/10.1137/20M1359316},
doi = {10.1137/20M1359316},
timestamp = {Fri, 03 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamsc/Baddoo21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/GoseaG21,
author = {Ion Victor Gosea and
Stefan G{\"{u}}ttel},
title = {Algorithms for the Rational Approximation of Matrix-Valued Functions},
journal = {{SIAM} J. Sci. Comput.},
volume = {43},
number = {5},
pages = {A3033--A3054},
year = {2021},
url = {https://doi.org/10.1137/20M1324727},
doi = {10.1137/20M1324727},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamsc/GoseaG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigpro/NazihMSC21,
author = {Marouane Nazih and
Khalid Minaoui and
Elaheh Sobhani and
Pierre Comon},
title = {Computation of low-rank tensor approximation under existence constraint
via a forward-backward algorithm},
journal = {Signal Process.},
volume = {188},
pages = {108178},
year = {2021},
url = {https://doi.org/10.1016/j.sigpro.2021.108178},
doi = {10.1016/J.SIGPRO.2021.108178},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigpro/NazihMSC21.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/AnKS21,
author = {Hyung{-}Chan An and
Robert Kleinberg and
David B. Shmoys},
title = {Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman
Problem},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {4},
pages = {35:1--35:12},
year = {2021},
url = {https://doi.org/10.1145/3478537},
doi = {10.1145/3478537},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AnKS21.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/AmanatidisFMS21,
author = {Georgios Amanatidis and
Peter Fulla and
Evangelos Markakis and
Krzysztof Sornat},
title = {Inequity aversion pricing over social networks: Approximation algorithms
and hardness results},
journal = {Theor. Comput. Sci.},
volume = {871},
pages = {62--78},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.04.012},
doi = {10.1016/J.TCS.2021.04.012},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AmanatidisFMS21.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/tcs/LiuLLZ21,
author = {Qian Liu and
Jianxin Liu and
Min Li and
Yang Zhou},
title = {Approximation algorithms for fuzzy \emph{C}-means problem based on
seeding method},
journal = {Theor. Comput. Sci.},
volume = {885},
pages = {146--158},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.06.035},
doi = {10.1016/J.TCS.2021.06.035},
timestamp = {Sat, 26 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuLLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NieD21,
author = {Zixiong Nie and
Hongwei Du},
title = {An approximation algorithm for General Energy Restricted Sweep Coverage
problem},
journal = {Theor. Comput. Sci.},
volume = {864},
pages = {70--79},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.028},
doi = {10.1016/J.TCS.2021.02.028},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NieD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PaiC21,
author = {Jayakumar Pai and
Bhadrachalam Chitturi},
title = {Approximation algorithms for sorting permutations by extreme block-interchanges},
journal = {Theor. Comput. Sci.},
volume = {891},
pages = {105--115},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.08.031},
doi = {10.1016/J.TCS.2021.08.031},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PaiC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SunXGL21,
author = {Xin Sun and
Dachuan Xu and
Longkun Guo and
Min Li},
title = {Deterministic approximation algorithm for submodular maximization
subject to a matroid constraint},
journal = {Theor. Comput. Sci.},
volume = {890},
pages = {1--15},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.08.012},
doi = {10.1016/J.TCS.2021.08.012},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SunXGL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TanFMW21,
author = {Guanlan Tan and
Qilong Feng and
Xiangzhong Meng and
Jianxin Wang},
title = {A new approximation algorithm for contig-based genomic scaffold filling},
journal = {Theor. Comput. Sci.},
volume = {853},
pages = {7--15},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.05.017},
doi = {10.1016/J.TCS.2020.05.017},
timestamp = {Wed, 13 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TanFMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangGHWL21,
author = {Xin Wang and
Suogang Gao and
Bo Hou and
Lidong Wu and
Wen Liu},
title = {Approximation algorithms for the submodular edge cover problem with
submodular penalties},
journal = {Theor. Comput. Sci.},
volume = {871},
pages = {126--133},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.04.017},
doi = {10.1016/J.TCS.2021.04.017},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangGHWL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangZWXZ21,
author = {Limin Wang and
Zhao Zhang and
Chenchen Wu and
Dachuan Xu and
Xiaoyan Zhang},
title = {Approximation algorithms for the dynamic \emph{k}-level facility location
problems},
journal = {Theor. Comput. Sci.},
volume = {853},
pages = {43--56},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.05.022},
doi = {10.1016/J.TCS.2020.05.022},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WangZWXZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangCLWX21,
author = {Dongmei Zhang and
Yukun Cheng and
Min Li and
Yishui Wang and
Dachuan Xu},
title = {Approximation algorithms for spherical \emph{k}-means problem using
local search scheme},
journal = {Theor. Comput. Sci.},
volume = {853},
pages = {65--77},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.06.029},
doi = {10.1016/J.TCS.2020.06.029},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangCLWX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhouJZZ21,
author = {Peiyan Zhou and
Haitao Jiang and
Daming Zhu and
Binhai Zhu},
title = {Approximation algorithms for the maximum vertex coverage problem on
bounded degree graphs},
journal = {Theor. Comput. Sci.},
volume = {888},
pages = {22--30},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.07.015},
doi = {10.1016/J.TCS.2021.07.015},
timestamp = {Mon, 27 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhouJZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tinstmc/VasuSM21,
author = {Ganji Vasu and
Mangipudi Sivakumar and
Ramalingaraju M.},
title = {Optimal {IMC-PID} controller design for large-scale power systems
via {EDE} algorithm-based model approximation method},
journal = {Trans. Inst. Meas. Control},
volume = {43},
number = {1},
pages = {59--77},
year = {2021},
url = {https://doi.org/10.1177/0142331220921578},
doi = {10.1177/0142331220921578},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tinstmc/VasuSM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmc/BhattiFWGWC21,
author = {Shahzad Sarwar Bhatti and
Jiahao Fan and
Kangrui Wang and
Xiaofeng Gao and
Fan Wu and
Guihai Chen},
title = {An Approximation Algorithm for Bounded Task Assignment Problem in
Spatial Crowdsourcing},
journal = {{IEEE} Trans. Mob. Comput.},
volume = {20},
number = {8},
pages = {2536--2549},
year = {2021},
url = {https://doi.org/10.1109/TMC.2020.2984380},
doi = {10.1109/TMC.2020.2984380},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tmc/BhattiFWGWC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmm/ChangC21,
author = {Zhangyu Chang and
S.{-}H. Gary Chan},
title = {An Approximation Algorithm to Maximize User Capacity for an Auto-Scaling
VoD System},
journal = {{IEEE} Trans. Multim.},
volume = {23},
pages = {3714--3725},
year = {2021},
url = {https://doi.org/10.1109/TMM.2020.3031068},
doi = {10.1109/TMM.2020.3031068},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tmm/ChangC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/XuLXPPLJD21,
author = {Wenzheng Xu and
Weifa Liang and
Zichuan Xu and
Jian Peng and
Dezhong Peng and
Tang Liu and
Xiaohua Jia and
Sajal K. Das},
title = {Approximation Algorithms for the Generalized Team Orienteering Problem
and its Applications},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {29},
number = {1},
pages = {176--189},
year = {2021},
url = {https://doi.org/10.1109/TNET.2020.3027434},
doi = {10.1109/TNET.2020.3027434},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/XuLXPPLJD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsc/RampersaudG21,
author = {Safraz Rampersaud and
Daniel Grosu},
title = {An Approximation Algorithm for Sharing-Aware Virtual Machine Revenue
Maximization},
journal = {{IEEE} Trans. Serv. Comput.},
volume = {14},
number = {1},
pages = {1--15},
year = {2021},
url = {https://doi.org/10.1109/TSC.2017.2786728},
doi = {10.1109/TSC.2017.2786728},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsc/RampersaudG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/KalooraziC21,
author = {Maboud F. Kaloorazi and
Jie Chen},
title = {Projection-Based {QLP} Algorithm for Efficiently Computing Low-Rank
Approximation of Matrices},
journal = {{IEEE} Trans. Signal Process.},
volume = {69},
pages = {2218--2232},
year = {2021},
url = {https://doi.org/10.1109/TSP.2021.3066258},
doi = {10.1109/TSP.2021.3066258},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsp/KalooraziC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/ZhouP21,
author = {Rui Zhou and
Daniel P. Palomar},
title = {Solving High-Order Portfolios via Successive Convex Approximation
Algorithms},
journal = {{IEEE} Trans. Signal Process.},
volume = {69},
pages = {892--904},
year = {2021},
url = {https://doi.org/10.1109/TSP.2021.3051369},
doi = {10.1109/TSP.2021.3051369},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/ZhouP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tvt/GaoWCT21,
author = {Zhenguo Gao and
Hsiao{-}Chun Wu and
Shaobin Cai and
Guozhen Tan},
title = {Tight Approximation Ratios of Two Greedy Algorithms for Optimal {RSU}
Deployment in One-Dimensional VANETs},
journal = {{IEEE} Trans. Veh. Technol.},
volume = {70},
number = {1},
pages = {3--17},
year = {2021},
url = {https://doi.org/10.1109/TVT.2020.3045693},
doi = {10.1109/TVT.2020.3045693},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tvt/GaoWCT21.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/aaai/HikimaAKKKT21,
author = {Yuya Hikima and
Yasunori Akagi and
Hideaki Kim and
Masahiro Kohjima and
Takeshi Kurashima and
Hiroyuki Toda},
title = {Integrated Optimization of Bipartite Matching and Its Stochastic Behavior:
New Formulation and Approximation Algorithm via Min-cost Flow Optimization},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {3796--3805},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i5.16497},
doi = {10.1609/AAAI.V35I5.16497},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HikimaAKKKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/JiLZZ21,
author = {Sai Ji and
Gaidi Li and
Dongmei Zhang and
Xianzhao Zhang},
editor = {Weili Wu and
Hongwei Du},
title = {Approximation Algorithm for the Capacitated Correlation Clustering
Problem with Penalties},
booktitle = {Algorithmic Aspects in Information and Management - 15th International
Conference, {AAIM} 2021, Virtual Event, December 20-22, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13153},
pages = {15--26},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-93176-6\_2},
doi = {10.1007/978-3-030-93176-6\_2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/JiLZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/LiCLPWL21,
author = {Jianping Li and
Lijian Cai and
Junran Lichen and
Pengxiang Pan and
Wencheng Wang and
Suding Liu},
editor = {Weili Wu and
Hongwei Du},
title = {An Approximation Algorithm for Solving the Heterogeneous Chinese Postman
Problem},
booktitle = {Algorithmic Aspects in Information and Management - 15th International
Conference, {AAIM} 2021, Virtual Event, December 20-22, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13153},
pages = {38--46},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-93176-6\_4},
doi = {10.1007/978-3-030-93176-6\_4},
timestamp = {Tue, 28 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/LiCLPWL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/LiLLY21,
author = {Yajie Li and
Weidong Li and
Xiaofei Liu and
Jinhua Yang},
editor = {Weili Wu and
Hongwei Du},
title = {Approximation Algorithms for the Maximum Bounded Connected Bipartition
Problem},
booktitle = {Algorithmic Aspects in Information and Management - 15th International
Conference, {AAIM} 2021, Virtual Event, December 20-22, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13153},
pages = {27--37},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-93176-6\_3},
doi = {10.1007/978-3-030-93176-6\_3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/LiLLY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/FerdousP0PH21,
author = {S. M. Ferdous and
Alex Pothen and
Arif Khan and
Ajay Panyala and
Mahantesh Halappanavar},
editor = {Michael Bender and
John Gilbert and
Bruce Hendrickson and
Blair D. Sullivan},
title = {A Parallel Approximation Algorithm for Maximizing Submodular \emph{b}-Matching},
booktitle = {Proceedings of the 2021 {SIAM} Conference on Applied and Computational
Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21,
2021},
pages = {45--56},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976830.5},
doi = {10.1137/1.9781611976830.5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/acda/FerdousP0PH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acit4/CherevkoTIP21,
author = {Igor Cherevko and
Iryna Tuzyk and
Svitlana Ilika and
Andriy Pertsov},
title = {Approximation of Systems with Delay and Algorithms for Modeling Their
Stability},
booktitle = {11th International Conference on Advanced Computer Information Technologies,
{ACIT} 2021, Deggendorf, Germany, September 15-17, 2021},
pages = {49--52},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ACIT52158.2021.9548395},
doi = {10.1109/ACIT52158.2021.9548395},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acit4/CherevkoTIP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/TaoCZ21,
author = {Liangde Tao and
Lin Chen and
Guochuan Zhang},
editor = {Susanne Biundo and
Minh Do and
Robert Goldman and
Michael Katz and
Qiang Yang and
Hankz Hankui Zhuo},
title = {Scheduling Stochastic Jobs - Complexity and Approximation Algorithms},
booktitle = {Proceedings of the Thirty-First International Conference on Automated
Planning and Scheduling, {ICAPS} 2021, Guangzhou, China (virtual),
August 2-13, 2021},
pages = {367--375},
publisher = {{AAAI} Press},
year = {2021},
url = {https://ojs.aaai.org/index.php/ICAPS/article/view/15982},
timestamp = {Wed, 30 Aug 2023 08:38:08 +0200},
biburl = {https://dblp.org/rec/conf/aips/TaoCZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/CharikarH21,
author = {Moses Charikar and
Lunjia Hu},
editor = {Arindam Banerjee and
Kenji Fukumizu},
title = {Approximation Algorithms for Orthogonal Non-negative Matrix Factorization},
booktitle = {The 24th International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2021, April 13-15, 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {130},
pages = {2728--2736},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v130/charikar21a.html},
timestamp = {Wed, 14 Apr 2021 16:51:37 +0200},
biburl = {https://dblp.org/rec/conf/aistats/CharikarH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amcc/YaoX21,
author = {Jie Yao and
Ming Xin},
title = {Sub-optimal Consensus Control Design for Nonlinear Multi-Agent Systems
with {\textdollar}{\textbackslash}theta-D{\textdollar} Approximation
Algorithm},
booktitle = {2021 American Control Conference, {ACC} 2021, New Orleans, LA, USA,
May 25-28, 2021},
pages = {4704--4709},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.23919/ACC50511.2021.9482779},
doi = {10.23919/ACC50511.2021.9482779},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/amcc/YaoX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/0001S21,
author = {Arindam Khan and
Eklavya Sharma},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Tight Approximation Algorithms For Geometric Bin Packing with Skewed
Items},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {22:1--22:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.22},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.22},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/0001S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChekuriQT21,
author = {Chandra Chekuri and
Kent Quanrud and
Manuel R. Torres},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Fast Approximation Algorithms for Bounded Degree and Crossing Spanning
Tree Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {24:1--24:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.24},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.24},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChekuriQT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Galvez0AK21,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Kamyar Khodamoradi},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Approximation Algorithms for Demand Strip Packing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {20:1--20:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.20},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.20},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/Galvez0AK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibm/SunJ21,
author = {Chengcheng Sun and
Haitao Jiang},
editor = {Yufei Huang and
Lukasz A. Kurgan and
Feng Luo and
Xiaohua Hu and
Yidong Chen and
Edward R. Dougherty and
Andrzej Kloczkowski and
Yaohang Li},
title = {An approximation algorithm for unifying adjacencies by double cut
and joins in unsigned genomes},
booktitle = {{IEEE} International Conference on Bioinformatics and Biomedicine,
{BIBM} 2021, Houston, TX, USA, December 9-12, 2021},
pages = {86--91},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/BIBM52615.2021.9669334},
doi = {10.1109/BIBM52615.2021.9669334},
timestamp = {Tue, 18 Jan 2022 09:39:01 +0100},
biburl = {https://dblp.org/rec/conf/bibm/SunJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/Bloch-HansenSS21,
author = {Andrew Bloch{-}Hansen and
Nasim Samei and
Roberto Solis{-}Oba},
editor = {Apurva Mudgal and
C. R. Subramanian},
title = {Experimental Evaluation of a Local Search Approximation Algorithm
for the Multiway Cut Problem},
booktitle = {Algorithms and Discrete Applied Mathematics - 7th International Conference,
{CALDAM} 2021, Rupnagar, India, February 11-13, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12601},
pages = {346--358},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67899-9\_28},
doi = {10.1007/978-3-030-67899-9\_28},
timestamp = {Sat, 02 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caldam/Bloch-HansenSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/DasDM21,
author = {Arun Kumar Das and
Sandip Das and
Joydeep Mukherjee},
editor = {Apurva Mudgal and
C. R. Subramanian},
title = {Approximation Algorithms for Orthogonal Line Centers},
booktitle = {Algorithms and Discrete Applied Mathematics - 7th International Conference,
{CALDAM} 2021, Rupnagar, India, February 11-13, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12601},
pages = {43--54},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67899-9\_4},
doi = {10.1007/978-3-030-67899-9\_4},
timestamp = {Tue, 13 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/DasDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/KowalukL21,
author = {Miroslaw Kowaluk and
Andrzej Lingas},
editor = {Apurva Mudgal and
C. R. Subramanian},
title = {Quantum and Approximation Algorithms for Maximum Witnesses of Boolean
Matrix Products},
booktitle = {Algorithms and Discrete Applied Mathematics - 7th International Conference,
{CALDAM} 2021, Rupnagar, India, February 11-13, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12601},
pages = {440--451},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67899-9\_35},
doi = {10.1007/978-3-030-67899-9\_35},
timestamp = {Thu, 28 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/KowalukL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/MishraD21,
author = {Pawan K. Mishra and
Gautam K. Das},
editor = {Meng He and
Don Sheehy},
title = {Approximation Algorithms for the Euclidean Dispersion Problems},
booktitle = {Proceedings of the 33rd Canadian Conference on Computational Geometry,
{CCCG} 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova
Scotia, Canada},
pages = {303--311},
year = {2021},
timestamp = {Fri, 24 Sep 2021 13:55:36 +0200},
biburl = {https://dblp.org/rec/conf/cccg/MishraD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/AbbassiCSA21,
author = {Malek Abbassi and
Abir Chaabani and
Lamjed Ben Said and
Nabil Absi},
title = {An Approximation-based Chemical Reaction Algorithm for Combinatorial
Multi-Objective Bi-level Optimization Problems},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2021, Krak{\'{o}}w,
Poland, June 28 - July 1, 2021},
pages = {1627--1634},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/CEC45853.2021.9504711},
doi = {10.1109/CEC45853.2021.9504711},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cec/AbbassiCSA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DubloisLP21,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential
Approximation},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {202--215},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_14},
doi = {10.1007/978-3-030-75242-2\_14},
timestamp = {Thu, 06 May 2021 09:40:55 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DubloisLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/HenningPT21,
author = {Michael A. Henning and
Arti Pandey and
Vikash Tripathi},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Approximation Algorithm and Hardness Results for Defensive Domination
in Graphs},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {247--261},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_21},
doi = {10.1007/978-3-030-92681-6\_21},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/HenningPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/JiCTZ21,
author = {Sai Ji and
Yukun Cheng and
Jingjing Tan and
Zhongrui Zhao},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {An Improved Approximation Algorithm for Capacitated Correlation Clustering
Problem},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {35--45},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_4},
doi = {10.1007/978-3-030-92681-6\_4},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/JiCTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/JiLLZ21,
author = {Sai Ji and
Min Li and
Mei Liang and
Zhenning Zhang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Approximation Algorithm for Min-Max Correlation Clustering Problem
with Outliers},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {668--675},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_52},
doi = {10.1007/978-3-030-92681-6\_52},
timestamp = {Sat, 26 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/JiLLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LiZ21,
author = {Jiangkun Li and
Peng Zhang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {167--179},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_14},
doi = {10.1007/978-3-030-92681-6\_14},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/LiZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/SunGZ21,
author = {Jian Sun and
Gregory Z. Gutin and
Xiaoyan Zhang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {A LP-based Approximation Algorithm for generalized Traveling Salesperson
Path Problem},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {641--652},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_50},
doi = {10.1007/978-3-030-92681-6\_50},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/SunGZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/SunYL21,
author = {Yuhui Sun and
Wei Yu and
Zhaohui Liu},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Approximation Algorithms for Some Min-Max and Minimum Stacker Crane
Cover Problems},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {400--415},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_32},
doi = {10.1007/978-3-030-92681-6\_32},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/SunYL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZhangF21,
author = {Zhen Zhang and
Qilong Feng},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {An Improved Approximation Algorithm for Squared Metric k-Facility
Location},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {538--552},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_42},
doi = {10.1007/978-3-030-92681-6\_42},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/ZhangF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZhangZCCW21,
author = {An Zhang and
Liang Zhang and
Yong Chen and
Guangting Chen and
Xing Wang},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {Approximation Algorithms for Two Parallel Dedicated Machine Scheduling
with Conflict Constraints},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {111--124},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_10},
doi = {10.1007/978-3-030-92681-6\_10},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ZhangZCCW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BiswasR21,
author = {Arindam Biswas and
Venkatesh Raman},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Sublinear-Space Approximation Algorithms for Max r-SAT},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {124--136},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_11},
doi = {10.1007/978-3-030-89543-3\_11},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BiswasR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/SahnehKS21,
author = {Faryad Darabi Sahneh and
Stephen G. Kobourov and
Richard Spence},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Approximation Algorithms for Priority Steiner Tree Problems},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {112--123},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_10},
doi = {10.1007/978-3-030-89543-3\_10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/SahnehKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/MakarychevV21,
author = {Yury Makarychev and
Ali Vakilian},
editor = {Mikhail Belkin and
Samory Kpotufe},
title = {Approximation Algorithms for Socially Fair Clustering},
booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder,
Colorado, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {134},
pages = {3246--3264},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v134/makarychev21a.html},
timestamp = {Wed, 25 Aug 2021 17:11:16 +0200},
biburl = {https://dblp.org/rec/conf/colt/MakarychevV21.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/csonet/CuiDXY21,
author = {Min Cui and
Donglei Du and
Dachuan Xu and
Ruiqi Yang},
editor = {David Mohaisen and
Ruoming Jin},
title = {Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic
Set Functions},
booktitle = {Computational Data and Social Networks - 10th International Conference,
CSoNet 2021, Virtual Event, November 15-17, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13116},
pages = {50--58},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-91434-9\_5},
doi = {10.1007/978-3-030-91434-9\_5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csonet/CuiDXY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csonet/JiDDX21,
author = {Sai Ji and
Yinhong Dong and
Donglei Du and
Dachuan Xu},
editor = {David Mohaisen and
Ruoming Jin},
title = {Approximation Algorithms for the Lower Bounded Correlation Clustering
Problem},
booktitle = {Computational Data and Social Networks - 10th International Conference,
CSoNet 2021, Virtual Event, November 15-17, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13116},
pages = {39--49},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-91434-9\_4},
doi = {10.1007/978-3-030-91434-9\_4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csonet/JiDDX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Nutov21,
author = {Zeev Nutov},
editor = {Rahul Santhanam and
Daniil Musatov},
title = {Approximation Algorithms for Connectivity Augmentation Problems},
booktitle = {Computer Science - Theory and Applications - 16th International Computer
Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 -
July 2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12730},
pages = {321--338},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79416-3\_19},
doi = {10.1007/978-3-030-79416-3\_19},
timestamp = {Thu, 17 Jun 2021 14:43:33 +0200},
biburl = {https://dblp.org/rec/conf/csr/Nutov21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eit/TrefftzDJ21,
author = {Christian Trefftz and
Byron DeVries and
Benjamin Jenkins},
title = {An Algorithm to solve a Facility Location Problem using a Discrete
Approximation to the Voronoi Diagram},
booktitle = {{IEEE} International Conference on Electro Information Technology,
{EIT} 2021, Mt. Pleasant, MI, USA, May 14-15, 2021},
pages = {86--90},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/EIT51626.2021.9491915},
doi = {10.1109/EIT51626.2021.9491915},
timestamp = {Tue, 03 Aug 2021 16:22:18 +0200},
biburl = {https://dblp.org/rec/conf/eit/TrefftzDJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Har-PeledZ21,
author = {Sariel Har{-}Peled and
Timothy Zhou},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Improved Approximation Algorithms for Tverberg Partitions},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {51:1--51:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.51},
doi = {10.4230/LIPICS.ESA.2021.51},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/Har-PeledZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JungingerMPSY21,
author = {Kolja Junginger and
Ioannis Mantas and
Evanthia Papadopoulou and
Martin Suderland and
Chee Yap},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Certified Approximation Algorithms for the Fermat Point and n-Ellipses},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {54:1--54:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.54},
doi = {10.4230/LIPICS.ESA.2021.54},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/JungingerMPSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Martinez-MunozW21,
author = {Tom{\'{a}}s Mart{\'{\i}}nez{-}Mu{\~{n}}oz and
Andreas Wiese},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {{FPT} and FPT-Approximation Algorithms for Unsplittable Flow on Trees},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {67:1--67:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.67},
doi = {10.4230/LIPICS.ESA.2021.67},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Martinez-MunozW21.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/BuhlerLLM21,
author = {Jeremy Buhler and
Thomas Lavastida and
Kefu Lu and
Benjamin Moseley},
editor = {Leonel Sousa and
Nuno Roma and
Pedro Tom{\'{a}}s},
title = {A Scalable Approximation Algorithm for Weighted Longest Common Subsequence},
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 = {368--384},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85665-6\_23},
doi = {10.1007/978-3-030-85665-6\_23},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/europar/BuhlerLLM21.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/faw/ChenCKLXZ21,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Curtis Kennedy and
Guohui Lin and
Yao Xu and
An Zhang},
editor = {Jing Chen and
Minming Li and
Guochuan Zhang},
title = {Approximation Algorithms for the Directed Path Partition Problems},
booktitle = {Frontiers of Algorithmics - International Joint Conference, {IJTCS-FAW}
2021, Beijing, China, August 16-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12874},
pages = {23--36},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-97099-4\_2},
doi = {10.1007/978-3-030-97099-4\_2},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/ChenCKLXZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/GongL21,
author = {Mingyang Gong and
Guohui Lin},
editor = {Jing Chen and
Minming Li and
Guochuan Zhang},
title = {Improved Approximation Algorithms for Multiprocessor Scheduling with
Testing},
booktitle = {Frontiers of Algorithmics - International Joint Conference, {IJTCS-FAW}
2021, Beijing, China, August 16-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12874},
pages = {65--77},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-97099-4\_5},
doi = {10.1007/978-3-030-97099-4\_5},
timestamp = {Tue, 05 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/GongL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fedcsis/Grigoreva21,
author = {Natalia Grigoreva},
editor = {Maria Ganzha and
Leszek A. Maciaszek and
Marcin Paprzycki and
Dominik Slezak},
title = {Worst-Case Analysis of an Approximation Algorithm for Single Machine
Scheduling Problem},
booktitle = {Proceedings of the 16th Conference on Computer Science and Intelligence
Systems, Online, September 2-5, 2021},
series = {Annals of Computer Science and Information Systems},
volume = {25},
pages = {221--225},
year = {2021},
url = {https://doi.org/10.15439/2021F66},
doi = {10.15439/2021F66},
timestamp = {Thu, 23 Jun 2022 19:57:55 +0200},
biburl = {https://dblp.org/rec/conf/fedcsis/Grigoreva21.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/focs/LiV21,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {A constant-factor approximation algorithm for Nash Social Welfare
with submodular valuations},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {25--36},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00012},
doi = {10.1109/FOCS52979.2021.00012},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BoydCHI21,
author = {Sylvia C. Boyd and
Joseph Cheriyan and
Arash Haddadan and
Sharat Ibrahimpur},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Approximation Algorithms for Flexible Graph Connectivity},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.9},
doi = {10.4230/LIPICS.FSTTCS.2021.9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BoydCHI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Cheng0HJ0RSZ21,
author = {Kuan Cheng and
Alireza Farhadi and
MohammadTaghi Hajiaghayi and
Zhengzhong Jin and
Xin Li and
Aviad Rubinstein and
Saeed Seddighin and
Yu Zheng},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Streaming and Small Space Approximation Algorithms for Edit Distance
and Longest Common Subsequence},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {54:1--54:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.54},
doi = {10.4230/LIPICS.ICALP.2021.54},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Cheng0HJ0RSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DalirrooyfardK21,
author = {Mina Dalirrooyfard and
Jenny Kaufmann},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Approximation Algorithms for Min-Distance Problems in DAGs},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {60:1--60:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.60},
doi = {10.4230/LIPICS.ICALP.2021.60},
timestamp = {Tue, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DalirrooyfardK21.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, 06 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Parekh021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icassp/NguyenLN21,
author = {Thuan Nguyen and
Hoang Le and
Thinh Nguyen},
title = {Constant Approximation Algorithm for Minimizing Concave Impurity},
booktitle = {{IEEE} International Conference on Acoustics, Speech and Signal Processing,
{ICASSP} 2021, Toronto, ON, Canada, June 6-11, 2021},
pages = {3635--3639},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICASSP39728.2021.9415005},
doi = {10.1109/ICASSP39728.2021.9415005},
timestamp = {Thu, 08 Jul 2021 17:12:48 +0200},
biburl = {https://dblp.org/rec/conf/icassp/NguyenLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccci/Chen21,
author = {Zhen{-}Yao Chen},
editor = {Krystian Wojtkiewicz and
Jan Treur and
Elias Pimenidis and
Marcin Maleszka},
title = {Hybridization of Metaheuristic and Population-Based Algorithms with
Neural Network Learning for Function Approximation},
booktitle = {Advances in Computational Collective Intelligence - 13th International
Conference, {ICCCI} 2021, Kallithea, Rhodes, Greece, September 29
- October 1, 2021, Proceedings},
series = {Communications in Computer and Information Science},
volume = {1463},
pages = {45--56},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-88113-9\_4},
doi = {10.1007/978-3-030-88113-9\_4},
timestamp = {Thu, 07 Oct 2021 15:07:25 +0200},
biburl = {https://dblp.org/rec/conf/iccci/Chen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icct/LiFLSL21,
author = {Xiaohui Li and
Tao Fan and
Jiawen Liu and
Mingli Shi and
Siting Lv},
title = {Markov Approximation Based Resource Allocation Algorithm for Multi
- Frequency Cooperative Networks},
booktitle = {21st International Conference on Communication Technology, {ICCT}
2021, Tianjin, China, October 13-16, 2021},
pages = {897--901},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICCT52962.2021.9658067},
doi = {10.1109/ICCT52962.2021.9658067},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icct/LiFLSL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icict/Soto-QuirosFC21,
author = {Pablo Soto{-}Quiros and
Juan Jose Fallas{-}Monge and
Jeffry Chavarr{\'{\i}}a{-}Molina},
editor = {Xin{-}She Yang and
Simon Sherratt and
Nilanjan Dey and
Amit Joshi},
title = {A Fast Algorithm for Image Deconvolution Based on a Rank Constrained
Inverse Matrix Approximation Problem},
booktitle = {Proceedings of Sixth International Congress on Information and Communication
Technology - {ICICT} 2021, London, UK, Volume 2},
series = {Lecture Notes in Networks and Systems},
volume = {236},
pages = {165--176},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-981-16-2380-6\_15},
doi = {10.1007/978-981-16-2380-6\_15},
timestamp = {Wed, 04 May 2022 17:52:23 +0200},
biburl = {https://dblp.org/rec/conf/icict/Soto-QuirosFC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/DahiyaFPS21,
author = {Yogesh Dahiya and
Fedor V. Fomin and
Fahad Panolan and
Kirill Simonov},
editor = {Marina Meila and
Tong Zhang},
title = {Fixed-Parameter and Approximation Algorithms for {PCA} with Outliers},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {2341--2351},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/dahiya21b.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/DahiyaFPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/RajagopalanVVCP21,
author = {Anand Rajagopalan and
Fabio Vitale and
Danny Vainstein and
Gui Citovsky and
Cecilia M. Procopiuc and
Claudio Gentile},
editor = {Marina Meila and
Tong Zhang},
title = {Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation
Guarantees},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {8799--8809},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/rajagopalan21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/RajagopalanVVCP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icores/Krishnamoorthy021,
author = {Mohan Krishnamoorthy and
Alexander Brodsky and
Daniel A. Menasc{\'{e}}},
editor = {Greg H. Parlier and
Federico Liberatore and
Marc Demange},
title = {Stochastic Optimization Algorithm based on Deterministic Approximations},
booktitle = {Proceedings of the 10th International Conference on Operations Research
and Enterprise Systems, {ICORES} 2021, Online Streaming, February
4-6, 2021},
pages = {287--294},
publisher = {{SCITEPRESS}},
year = {2021},
url = {https://doi.org/10.5220/0010343802870294},
doi = {10.5220/0010343802870294},
timestamp = {Tue, 02 Mar 2021 22:37:23 +0100},
biburl = {https://dblp.org/rec/conf/icores/Krishnamoorthy021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/MontezRDCM21,
author = {Christopher Montez and
Sivakumar Rathinam and
Swaroop Darbha and
David W. Casbeer and
Satyanarayana Gupta Manyam},
title = {An Approximation Algorithm for an Assisted Shortest Path Problem},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2021, Xi'an, China, May 30 - June 5, 2021},
pages = {8024--8030},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICRA48506.2021.9561042},
doi = {10.1109/ICRA48506.2021.9561042},
timestamp = {Fri, 22 Oct 2021 19:54:31 +0200},
biburl = {https://dblp.org/rec/conf/icra/MontezRDCM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip5-7/0002X21,
author = {Yin Wang and
Yinfeng Xu},
editor = {Alexandre Dolgui and
Alain Bernard and
David Lemoine and
Gregor von Cieminski and
David Romero},
title = {An Approximation Algorithm for the k-Connected Location Set Cover
Problem with Color-Spanning Constraint},
booktitle = {Advances in Production Management Systems. Artificial Intelligence
for Sustainable and Resilient Production Systems - {IFIP} {WG} 5.7
International Conference, {APMS} 2021, Nantes, France, September 5-9,
2021, Proceedings, Part {III}},
series = {{IFIP} Advances in Information and Communication Technology},
volume = {632},
pages = {317--325},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-85906-0\_36},
doi = {10.1007/978-3-030-85906-0\_36},
timestamp = {Fri, 12 Apr 2024 12:51:34 +0200},
biburl = {https://dblp.org/rec/conf/ifip5-7/0002X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ZhaoX21,
author = {Jingyang Zhao and
Mingyu Xiao},
editor = {Zhi{-}Hua Zhou},
title = {The Traveling Tournament Problem with Maximum Tour Length Two: {A}
Practical Algorithm with An Improved Approximation Bound},
booktitle = {Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, {IJCAI} 2021, Virtual Event / Montreal, Canada, 19-27
August 2021},
pages = {4206--4212},
publisher = {ijcai.org},
year = {2021},
url = {https://doi.org/10.24963/ijcai.2021/578},
doi = {10.24963/IJCAI.2021/578},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/ZhaoX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcnn/PanY21,
author = {Chao Pan and
Xin Yao},
title = {Neural Architecture Search Based on Evolutionary Algorithms with Fitness
Approximation},
booktitle = {International Joint Conference on Neural Networks, {IJCNN} 2021, Shenzhen,
China, July 18-22, 2021},
pages = {1--8},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/IJCNN52387.2021.9533986},
doi = {10.1109/IJCNN52387.2021.9533986},
timestamp = {Mon, 27 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcnn/PanY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MuscoMW21,
author = {Cameron Musco and
Christopher Musco and
David P. Woodruff},
editor = {James R. Lee},
title = {Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.6},
doi = {10.4230/LIPICS.ITCS.2021.6},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MuscoMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AprileDFH21,
author = {Manuel Aprile and
Matthew Drescher and
Samuel Fiorini and
Tony Huynh},
editor = {Mohit Singh and
David P. Williamson},
title = {A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem},
booktitle = {Integer Programming and Combinatorial Optimization - 22nd International
Conference, {IPCO} 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12707},
pages = {340--353},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-73879-2\_24},
doi = {10.1007/978-3-030-73879-2\_24},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AprileDFH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BandyapadhyayMS21,
author = {Sayan Bandyapadhyay and
Anil Maheshwari and
Michiel Smid},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Exact and Approximation Algorithms for Many-To-Many Point Matching
in the Plane},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.44},
doi = {10.4230/LIPICS.ISAAC.2021.44},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BandyapadhyayMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CheriyanCDZ21,
author = {Joseph Cheriyan and
Robert Cummings and
Jack Dippel and
Jasper Zhu},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {An Improved Approximation Algorithm for the Matching Augmentation
Problem},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {38:1--38:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.38},
doi = {10.4230/LIPICS.ISAAC.2021.38},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/CheriyanCDZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Yokoi21,
author = {Yu Yokoi},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {An Approximation Algorithm for Maximum Stable Matching with Ties and
Constraints},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {71:1--71:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.71},
doi = {10.4230/LIPICS.ISAAC.2021.71},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Yokoi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BrustleEHKM21,
author = {Noah Br{\"{u}}stle and
Tal Elbaz and
Hamed Hatami and
Onur Kocer and
Bingchan Ma},
editor = {Paola Flocchini and
Lucia Moura},
title = {Approximation Algorithms for Hitting Subgraphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {370--384},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_26},
doi = {10.1007/978-3-030-79987-8\_26},
timestamp = {Mon, 12 Jul 2021 09:19:27 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BrustleEHKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kse/PhamH21,
author = {Nghia Pham and
Diep Thi Hoang},
editor = {Thanaruk Theeramunkong and
Nguyen Thanh Thuy and
Le Minh Nguyen and
Thepchai Supnithi and
Lam Thu Bui and
Yoshihiro Miyake and
Teeradaj Racharak and
Kiyota Hashimoto and
Thaweesak Yingthawornsuk},
title = {A distributed algorithm for the parsimony bootstrap approximation},
booktitle = {13th International Conference on Knowledge and Systems Engineering,
{KSE} 2021, Bangkok, Thailand, November 10-12, 2021},
pages = {1--6},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/KSE53942.2021.9648648},
doi = {10.1109/KSE53942.2021.9648648},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kse/PhamH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KhamisCIM0PS21,
author = {Mahmoud Abo Khamis and
Ryan R. Curtin and
Sungjin Im and
Benjamin Moseley and
Hung Q. Ngo and
Kirk Pruhs and
Alireza Samadian},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {An Approximation Algorithm for the Matrix Tree Multiplication Problem},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {6:1--6:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.6},
doi = {10.4230/LIPICS.MFCS.2021.6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KhamisCIM0PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mlsp/SarkkaMK21,
author = {Simo S{\"{a}}rkk{\"{a}} and
Christos Merkatas and
Toni Karvonen},
title = {Gaussian Approximations of {SDES} in Metropolis-Adjusted Langevin
Algorithms},
booktitle = {2021 {IEEE} 31st International Workshop on Machine Learning for Signal
Processing (MLSP), Gold Coast, Australia, October 25-28, 2021},
pages = {1--6},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/MLSP52302.2021.9596301},
doi = {10.1109/MLSP52302.2021.9596301},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mlsp/SarkkaMK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ChenJJL21,
author = {Liyu Chen and
Mehdi Jafarnia{-}Jahromi and
Rahul Jain and
Haipeng Luo},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms
for Stochastic Shortest Path},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {10849--10861},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/59b1deff341edb0b76ace57820cef237-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/ChenJJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GanJL21,
author = {Kyra Gan and
Su Jia and
Andrew A. Li},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Greedy Approximation Algorithms for Active Sequential Hypothesis Testing},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {5012--5024},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/27e9661e033a73a6ad8cefcde965c54d-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/GanJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/HessMS21,
author = {Tom Hess and
Michal Moshkovitz and
Sivan Sabato},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {A Constant Approximation Algorithm for Sequential Random-Order No-Substitution
k-Median Clustering},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {3298--3308},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/1aa057313c28fa4a40c5bc084b11d276-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/HessMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/IndykWW21,
author = {Piotr Indyk and
Tal Wagner and
David P. Woodruff},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Few-Shot Data-Driven Algorithms for Low Rank Approximation},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {10678--10690},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/588da7a73a2e919a23cb9a419c4c6d44-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/IndykWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ShindeNS21,
author = {Nimita Shinde and
Vishnu Narayanan and
James Saunderson},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation
Clustering},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {8269--8281},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/45c166d697d65080d54501403b433256-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/ShindeNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pakdd/WanS21,
author = {Guihong Wan and
Haim Schweitzer},
editor = {Kamal Karlapalem and
Hong Cheng and
Naren Ramakrishnan and
R. K. Agrawal and
P. Krishna Reddy and
Jaideep Srivastava and
Tanmoy Chakraborty},
title = {A Fast Algorithm for Simultaneous Sparse Approximation},
booktitle = {Advances in Knowledge Discovery and Data Mining - 25th Pacific-Asia
Conference, {PAKDD} 2021, Virtual Event, May 11-14, 2021, Proceedings,
Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12714},
pages = {42--54},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75768-7\_4},
doi = {10.1007/978-3-030-75768-7\_4},
timestamp = {Fri, 14 May 2021 15:17:47 +0200},
biburl = {https://dblp.org/rec/conf/pakdd/WanS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdcat/YuL21,
author = {Wei Yu and
Yujie Liao},
editor = {Hong Shen and
Yingpeng Sang and
Yong Zhang and
Nong Xiao and
Hamid R. Arabnia and
Geoffrey C. Fox and
Ajay Gupta and
Manu Malek},
title = {Approximation and Polynomial Algorithms for Multi-depot Capacitated
Arc Routing Problems},
booktitle = {Parallel and Distributed Computing, Applications and Technologies
- 22nd International Conference, {PDCAT} 2021, Guangzhou, China, December
17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13148},
pages = {93--100},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-96772-7\_9},
doi = {10.1007/978-3-030-96772-7\_9},
timestamp = {Thu, 16 Mar 2023 20:00:28 +0100},
biburl = {https://dblp.org/rec/conf/pdcat/YuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/Tatti21,
author = {Nikolaj Tatti},
editor = {Nuria Oliver and
Fernando P{\'{e}}rez{-}Cruz and
Stefan Kramer and
Jesse Read and
Jos{\'{e}} Antonio Lozano},
title = {Approximation Algorithms for Confidence Bands for Time Series},
booktitle = {Machine Learning and Knowledge Discovery in Databases. Research Track
- European Conference, {ECML} {PKDD} 2021, Bilbao, Spain, September
13-17, 2021, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {12975},
pages = {437--452},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86486-6\_27},
doi = {10.1007/978-3-030-86486-6\_27},
timestamp = {Wed, 28 Jun 2023 16:19:42 +0200},
biburl = {https://dblp.org/rec/conf/pkdd/Tatti21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Saha21,
author = {Barna Saha},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {Approximation Algorithms for Large Scale Data Analysis},
booktitle = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
on Principles of Database Systems, Virtual Event, China, June 20-25,
2021},
pages = {30--32},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3458813},
doi = {10.1145/3452021.3458813},
timestamp = {Mon, 21 Jun 2021 12:19:15 +0200},
biburl = {https://dblp.org/rec/conf/pods/Saha21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qce/KoretskyGBVZGBP21,
author = {Samantha Koretsky and
Pranav Gokhale and
Jonathan M. Baker and
Joshua Viszlai and
Honghao Zheng and
Niroj Gurung and
Ryan Burg and
Esa Aleksi Paaso and
Amin Khodaei and
Rozhin Eskandarpour and
Frederic T. Chong},
editor = {Hausi A. M{\"{u}}ller and
Greg Byrd and
Candace Culhane and
Travis S. Humble},
title = {Adapting Quantum Approximation Optimization Algorithm {(QAOA)} for
Unit Commitment},
booktitle = {{IEEE} International Conference on Quantum Computing and Engineering,
{QCE} 2021, Broomfield, CO, USA, October 17-22, 2021},
pages = {181--187},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/QCE52317.2021.00035},
doi = {10.1109/QCE52317.2021.00035},
timestamp = {Thu, 14 Dec 2023 11:20:44 +0100},
biburl = {https://dblp.org/rec/conf/qce/KoretskyGBVZGBP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/GrintenAPM21,
author = {Alexander van der Grinten and
Eugenio Angriman and
Maria Predari and
Henning Meyerhenke},
editor = {Carlotta Demeniconi and
Ian Davidson},
title = {New Approximation Algorithms for Forest Closeness Centrality - for
Individual Vertices and Vertex Groups},
booktitle = {Proceedings of the 2021 {SIAM} International Conference on Data Mining,
{SDM} 2021, Virtual Event, April 29 - May 1, 2021},
pages = {136--144},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976700.16},
doi = {10.1137/1.9781611976700.16},
timestamp = {Sat, 21 Aug 2021 11:46:54 +0200},
biburl = {https://dblp.org/rec/conf/sdm/GrintenAPM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/0003CZZWYXT021,
author = {Kai Han and
Shuang Cui and
Tianshuai Zhu and
Enpei Zhang and
Benwei Wu and
Zhizhuo Yin and
Tong Xu and
Shaojie Tang and
He Huang},
editor = {Longbo Huang and
Anshul Gandhi and
Negar Kiyavash and
Jia Wang},
title = {Approximation Algorithms for Submodular Data Summarization with a
Knapsack Constraint},
booktitle = {{SIGMETRICS} '21: {ACM} {SIGMETRICS} / International Conference on
Measurement and Modeling of Computer Systems, Virtual Event, China,
June 14-18, 2021},
pages = {65--66},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3410220.3453922},
doi = {10.1145/3410220.3453922},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigmetrics/0003CZZWYXT021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloG0PR21,
author = {Davide Bil{\`{o}} and
Luciano Gual{\`{a}} and
Stefano Leucci and
Guido Proietti and
Mirko Rossi},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {New Approximation Algorithms for the Heterogeneous Weighted Delivery
Problem},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {167--184},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_10},
doi = {10.1007/978-3-030-79527-6\_10},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloG0PR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GhoshalL21,
author = {Suprovat Ghoshal and
Anand Louis},
editor = {D{\'{a}}niel Marx},
title = {Approximation Algorithms and Hardness for Strong Unique Games},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {414--433},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.26},
doi = {10.1137/1.9781611976465.26},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/GhoshalL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LahnR21,
author = {Nathaniel Lahn and
Sharath Raghvendra},
editor = {D{\'{a}}niel Marx},
title = {An \emph{O}(\emph{n}\({}^{\mbox{5/4}}\)) Time \emph{{\unicode{8714}}}-Approximation
Algorithm for {RMS} Matching in a Plane},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {869--888},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.55},
doi = {10.1137/1.9781611976465.55},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/LahnR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BiswasDGMN21,
author = {Amartya Shankha Biswas and
Michal Dory and
Mohsen Ghaffari and
Slobodan Mitrovic and
Yasamin Nazari},
editor = {Kunal Agrawal and
Yossi Azar},
title = {Massively Parallel Algorithms for Distance Approximation and Spanners},
booktitle = {{SPAA} '21: 33rd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, 6-8 July, 2021},
pages = {118--128},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3409964.3461784},
doi = {10.1145/3409964.3461784},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/BiswasDGMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Neuwohner21,
author = {Meike Neuwohner},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {An Improved Approximation Algorithm for the Maximum Weight Independent
Set Problem in d-Claw Free Graphs},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {53:1--53:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.53},
doi = {10.4230/LIPICS.STACS.2021.53},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Neuwohner21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArenasCJR21,
author = {Marcelo Arenas and
Luis Alberto Croquevielle and
Rajesh Jayaram and
Cristian Riveros},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A polynomial-time approximation algorithm for counting words accepted
by an {NFA} (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {4},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465353},
doi = {10.1145/3406325.3465353},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArenasCJR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKG21,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A (slightly) improved approximation algorithm for metric {TSP}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {32--45},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451009},
doi = {10.1145/3406325.3451009},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKG21.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/uai/OhsakaM21,
author = {Naoto Ohsaka and
Tatsuya Matsuoka},
editor = {Cassio P. de Campos and
Marloes H. Maathuis and
Erik Quaeghebeur},
title = {Approximation algorithm for submodular maximization under submodular
cover},
booktitle = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial
Intelligence, {UAI} 2021, Virtual Event, 27-30 July 2021},
series = {Proceedings of Machine Learning Research},
volume = {161},
pages = {792--801},
publisher = {{AUAI} Press},
year = {2021},
url = {https://proceedings.mlr.press/v161/ohsaka21a.html},
timestamp = {Fri, 17 Dec 2021 17:06:27 +0100},
biburl = {https://dblp.org/rec/conf/uai/OhsakaM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/XuL21,
author = {Haike Xu and
Jian Li},
editor = {Cassio P. de Campos and
Marloes H. Maathuis and
Erik Quaeghebeur},
title = {Simple combinatorial algorithms for combinatorial bandits: corruptions
and approximations},
booktitle = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial
Intelligence, {UAI} 2021, Virtual Event, 27-30 July 2021},
series = {Proceedings of Machine Learning Research},
volume = {161},
pages = {1444--1454},
publisher = {{AUAI} Press},
year = {2021},
url = {https://proceedings.mlr.press/v161/xu21b.html},
timestamp = {Fri, 17 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/XuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GoodrichGKM21,
author = {Michael T. Goodrich and
Siddharth Gupta and
Hadi Khodabandeh and
Pedro Matias},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking
Paths},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {442--456},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_32},
doi = {10.1007/978-3-030-83508-8\_32},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/GoodrichGKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/AfshaniBB0LNRS021,
author = {Peyman Afshani and
Mark de Berg and
Kevin Buchin and
Jie Gao and
Maarten L{\"{o}}ffler and
Amir Nayyeri and
Benjamin Raichel and
Rik Sarkar and
Haotian Wang and
Hao{-}Tsung Yang},
editor = {Steven M. LaValle and
Ming Lin and
Timo Ojala and
Dylan A. Shell and
Jingjin Yu},
title = {Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max
Latency},
booktitle = {Algorithmic Foundations of Robotics XIV, Proceedings of the Fourteenth
Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2021,
Oulu, Finland, June 21-23, 2021},
series = {Springer Proceedings in Advanced Robotics},
volume = {17},
pages = {107--123},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-66723-8\_7},
doi = {10.1007/978-3-030-66723-8\_7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wafr/AfshaniBB0LNRS021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/AgarwalA21,
author = {Saurav Agarwal and
Srinivas Akella},
editor = {Steven M. LaValle and
Ming Lin and
Timo Ojala and
Dylan A. Shell and
Jingjin Yu},
title = {Approximation Algorithms for the Single Robot Line Coverage Problem},
booktitle = {Algorithmic Foundations of Robotics XIV, Proceedings of the Fourteenth
Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2021,
Oulu, Finland, June 21-23, 2021},
series = {Springer Proceedings in Advanced Robotics},
volume = {17},
pages = {534--550},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-66723-8\_32},
doi = {10.1007/978-3-030-66723-8\_32},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wafr/AgarwalA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/SadeghiA021,
author = {Armin Sadeghi and
Ahmad Bilal Asghar and
Stephen L. Smith},
editor = {Steven M. LaValle and
Ming Lin and
Timo Ojala and
Dylan A. Shell and
Jingjin Yu},
title = {Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex
Environments},
booktitle = {Algorithmic Foundations of Robotics XIV, Proceedings of the Fourteenth
Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2021,
Oulu, Finland, June 21-23, 2021},
series = {Springer Proceedings in Advanced Robotics},
volume = {17},
pages = {330--346},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-66723-8\_20},
doi = {10.1007/978-3-030-66723-8\_20},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wafr/SadeghiA021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Biniaz21,
author = {Ahmad Biniaz},
editor = {Ryuhei Uehara and
Seok{-}Hee Hong and
Subhas C. Nandy},
title = {Better Approximation Algorithms for Maximum Weight Internal Spanning
Trees in Cubic Graphs and Claw-Free Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 15th International Conference
and Workshops, {WALCOM} 2021, Yangon, Myanmar, February 28 - March
2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12635},
pages = {260--271},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68211-8\_21},
doi = {10.1007/978-3-030-68211-8\_21},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Biniaz21.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}
}
@inproceedings{DBLP:conf/waoa/GalvezSS21,
author = {Waldo G{\'{a}}lvez and
Francisco Sanhueza{-}Matamala and
Jos{\'{e}} A. Soto},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Approximation Algorithms for Vertex-Connectivity Augmentation on the
Cycle},
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 = {1--22},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_1},
doi = {10.1007/978-3-030-92702-8\_1},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/GalvezSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/ChenW21,
author = {Samantha Chen and
Yusu Wang},
editor = {David Coudert and
Emanuele Natale},
title = {Approximation Algorithms for 1-Wasserstein Distance Between Persistence
Diagrams},
booktitle = {19th International Symposium on Experimental Algorithms, {SEA} 2021,
June 7-9, 2021, Nice, France},
series = {LIPIcs},
volume = {190},
pages = {14:1--14:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SEA.2021.14},
doi = {10.4230/LIPICS.SEA.2021.14},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/ChenW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2021,
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-207-5},
isbn = {978-3-95977-207-5},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2020,
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80879-2},
doi = {10.1007/978-3-030-80879-2},
isbn = {978-3-030-80878-5},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2021,
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {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},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8},
doi = {10.1007/978-3-030-92702-8},
isbn = {978-3-030-92701-1},
timestamp = {Fri, 14 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-05921,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan and
Xinzhi Zhang},
title = {An Improved Approximation Algorithm for the Minimum k-Edge Connected
Multi-Subgraph Problem},
journal = {CoRR},
volume = {abs/2101.05921},
year = {2021},
url = {https://arxiv.org/abs/2101.05921},
eprinttype = {arXiv},
eprint = {2101.05921},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-05921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-06192,
author = {Alexander van der Grinten and
Eugenio Angriman and
Maria Predari and
Henning Meyerhenke},
title = {New Approximation Algorithms for Forest Closeness Centrality - for
Individual Vertices and Vertex Groups},
journal = {CoRR},
volume = {abs/2101.06192},
year = {2021},
url = {https://arxiv.org/abs/2101.06192},
eprinttype = {arXiv},
eprint = {2101.06192},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-06192.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-07550,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential
Approximation},
journal = {CoRR},
volume = {abs/2101.07550},
year = {2021},
url = {https://arxiv.org/abs/2101.07550},
eprinttype = {arXiv},
eprint = {2101.07550},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-07550.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-2102-04050,
author = {Tom Hess and
Michal Moshkovitz and
Sivan Sabato},
title = {A Constant Approximation Algorithm for Sequential No-Substitution
k-Median Clustering under a Random Arrival Order},
journal = {CoRR},
volume = {abs/2102.04050},
year = {2021},
url = {https://arxiv.org/abs/2102.04050},
eprinttype = {arXiv},
eprint = {2102.04050},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-04050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-05854,
author = {Arindam Khan and
Eklavya Sharma and
K. V. N. Sreenivas},
title = {Approximation Algorithms for Generalized Multidimensional Knapsack},
journal = {CoRR},
volume = {abs/2102.05854},
year = {2021},
url = {https://arxiv.org/abs/2102.05854},
eprinttype = {arXiv},
eprint = {2102.05854},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-05854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06613,
author = {Mong{-}Jen Kao},
title = {Improved LP-based Approximation Algorithms for Facility Location with
Hard Capacities},
journal = {CoRR},
volume = {abs/2102.06613},
year = {2021},
url = {https://arxiv.org/abs/2102.06613},
eprinttype = {arXiv},
eprint = {2102.06613},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07367,
author = {Prashant Khanduri and
Siliang Zeng and
Mingyi Hong and
Hoi{-}To Wai and
Zhaoran Wang and
Zhuoran Yang},
title = {A Momentum-Assisted Single-Timescale Stochastic Approximation Algorithm
for Bilevel Optimization},
journal = {CoRR},
volume = {abs/2102.07367},
year = {2021},
url = {https://arxiv.org/abs/2102.07367},
eprinttype = {arXiv},
eprint = {2102.07367},
timestamp = {Wed, 27 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07367.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07404,
author = {Zixiang Chen and
Dongruo Zhou and
Quanquan Gu},
title = {Almost Optimal Algorithms for Two-player Markov Games with Linear
Function Approximation},
journal = {CoRR},
volume = {abs/2102.07404},
year = {2021},
url = {https://arxiv.org/abs/2102.07404},
eprinttype = {arXiv},
eprint = {2102.07404},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07404.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-01398,
author = {Moses Charikar and
Lunjia Hu},
title = {Approximation Algorithms for Orthogonal Non-negative Matrix Factorization},
journal = {CoRR},
volume = {abs/2103.01398},
year = {2021},
url = {https://arxiv.org/abs/2103.01398},
eprinttype = {arXiv},
eprint = {2103.01398},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-01398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-02512,
author = {Yury Makarychev and
Ali Vakilian},
title = {Approximation Algorithms for Socially Fair Clustering},
journal = {CoRR},
volume = {abs/2103.02512},
year = {2021},
url = {https://arxiv.org/abs/2103.02512},
eprinttype = {arXiv},
eprint = {2103.02512},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-02512.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-04250,
author = {Kyra Gan and
Su Jia and
Andrew A. Li},
title = {Approximation Algorithms for Active Sequential Hypothesis Testing},
journal = {CoRR},
volume = {abs/2103.04250},
year = {2021},
url = {https://arxiv.org/abs/2103.04250},
eprinttype = {arXiv},
eprint = {2103.04250},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-04250.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-07245,
author = {Maboud F. Kaloorazi and
Jie Chen},
title = {Projection-based {QLP} Algorithm for Efficiently Computing Low-Rank
Approximation of Matrices},
journal = {CoRR},
volume = {abs/2103.07245},
year = {2021},
url = {https://arxiv.org/abs/2103.07245},
eprinttype = {arXiv},
eprint = {2103.07245},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-07245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-09847,
author = {Lin Chen and
Bruno Scherrer and
Peter L. Bartlett},
title = {Infinite-Horizon Offline Reinforcement Learning with Linear Function
Approximation: Curse of Dimensionality and Algorithm},
journal = {CoRR},
volume = {abs/2103.09847},
year = {2021},
url = {https://arxiv.org/abs/2103.09847},
eprinttype = {arXiv},
eprint = {2103.09847},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-09847.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-2103-10536,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {A constant-factor approximation algorithm for Nash Social Welfare
with submodular valuations},
journal = {CoRR},
volume = {abs/2103.10536},
year = {2021},
url = {https://arxiv.org/abs/2103.10536},
eprinttype = {arXiv},
eprint = {2103.10536},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-10536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-16185,
author = {Jakub Ruszil},
title = {Approximation algorithm for finding short synchronizing words in weighted
automata},
journal = {CoRR},
volume = {abs/2103.16185},
year = {2021},
url = {https://arxiv.org/abs/2103.16185},
eprinttype = {arXiv},
eprint = {2103.16185},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-16185.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-2104-07710,
author = {Samantha Chen and
Yusu Wang},
title = {Approximation algorithms for 1-Wasserstein distance between persistence
diagrams},
journal = {CoRR},
volume = {abs/2104.07710},
year = {2021},
url = {https://arxiv.org/abs/2104.07710},
eprinttype = {arXiv},
eprint = {2104.07710},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-07710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11396,
author = {Linjian Ma and
Chao Yang},
title = {Low Rank Approximation in Simulations of Quantum Algorithms},
journal = {CoRR},
volume = {abs/2104.11396},
year = {2021},
url = {https://arxiv.org/abs/2104.11396},
eprinttype = {arXiv},
eprint = {2104.11396},
timestamp = {Tue, 27 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11396.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11807,
author = {Palle E. T. Jorgensen and
Myung{-}Sin Song and
James Tian},
title = {Positive Definite Kernels, Algorithms, Frames, and Approximations},
journal = {CoRR},
volume = {abs/2104.11807},
year = {2021},
url = {https://arxiv.org/abs/2104.11807},
eprinttype = {arXiv},
eprint = {2104.11807},
timestamp = {Tue, 04 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11807.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-12337,
author = {Michael T. Goodrich and
Siddharth Gupta and
Hadi Khodabandeh and
Pedro Matias},
title = {How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking
Paths},
journal = {CoRR},
volume = {abs/2104.12337},
year = {2021},
url = {https://arxiv.org/abs/2104.12337},
eprinttype = {arXiv},
eprint = {2104.12337},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-12337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-13851,
author = {Robin E{\ss}mann and
Tobias Nipkow and
Simon Robillard},
title = {Verified Approximation Algorithms},
journal = {CoRR},
volume = {abs/2104.13851},
year = {2021},
url = {https://arxiv.org/abs/2104.13851},
eprinttype = {arXiv},
eprint = {2104.13851},
timestamp = {Tue, 04 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-13851.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01193,
author = {Anurag Anshu and
David Gosset and
Karen J. Morenz Korol and
Mehdi Soleimanifar},
title = {Improved approximation algorithms for bounded-degree local Hamiltonians},
journal = {CoRR},
volume = {abs/2105.01193},
year = {2021},
url = {https://arxiv.org/abs/2105.01193},
eprinttype = {arXiv},
eprint = {2105.01193},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01193.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-02827,
author = {Arindam Khan and
Eklavya Sharma},
title = {Tight Approximation Algorithms for Geometric Bin Packing with Skewed
Items},
journal = {CoRR},
volume = {abs/2105.02827},
year = {2021},
url = {https://arxiv.org/abs/2105.02827},
eprinttype = {arXiv},
eprint = {2105.02827},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-02827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-04735,
author = {Susumu Hashimoto and
Shinji Mizuno},
title = {A 3-approximation list scheduling algorithm for a single-machine scheduling
problem with a non-renewable resource and total weighted completion
time criterion},
journal = {CoRR},
volume = {abs/2105.04735},
year = {2021},
url = {https://arxiv.org/abs/2105.04735},
eprinttype = {arXiv},
eprint = {2105.04735},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-04735.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-2105-07900,
author = {Kazuma Tsuji and
Ken'ichiro Tanaka},
title = {Acceleration of the kernel herding algorithm by improved gradient
approximation},
journal = {CoRR},
volume = {abs/2105.07900},
year = {2021},
url = {https://arxiv.org/abs/2105.07900},
eprinttype = {arXiv},
eprint = {2105.07900},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-07900.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08577,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Kamyar Khodamoradi},
title = {Approximation Algorithms for Demand Strip Packing},
journal = {CoRR},
volume = {abs/2105.08577},
year = {2021},
url = {https://arxiv.org/abs/2105.08577},
eprinttype = {arXiv},
eprint = {2105.08577},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-09217,
author = {Pawan K. Mishra and
Gautam K. Das},
title = {Approximation Algorithms For The Euclidean Dispersion Problems},
journal = {CoRR},
volume = {abs/2105.09217},
year = {2021},
url = {https://arxiv.org/abs/2105.09217},
eprinttype = {arXiv},
eprint = {2105.09217},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-09217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-09313,
author = {Pawan K. Mishra and
Gautam K. Das},
title = {Approximation Algorithms For The Dispersion Problems in a Metric Space},
journal = {CoRR},
volume = {abs/2105.09313},
year = {2021},
url = {https://arxiv.org/abs/2105.09313},
eprinttype = {arXiv},
eprint = {2105.09313},
timestamp = {Mon, 31 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-09313.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-10061,
author = {Hao Feng and
Jaime Llorca and
Antonia M. Tulino and
Danny Raz and
Andreas F. Molisch},
title = {Approximation Algorithms for the {NFV} Service Distribution Problem},
journal = {CoRR},
volume = {abs/2105.10061},
year = {2021},
url = {https://arxiv.org/abs/2105.10061},
eprinttype = {arXiv},
eprint = {2105.10061},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-10061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-00623,
author = {Waldo G{\'{a}}lvez and
Arindam Khan and
Mathieu Mari and
Tobias M{\"{o}}mke and
Madhusudhan Reddy Pittu and
Andreas Wiese},
title = {A 4-Approximation Algorithm for Maximum Independent Set of Rectangles},
journal = {CoRR},
volume = {abs/2106.00623},
year = {2021},
url = {https://arxiv.org/abs/2106.00623},
eprinttype = {arXiv},
eprint = {2106.00623},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-00623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-02120,
author = {Mina Dalirrooyfard and
Jenny Kaufmann},
title = {Approximation Algorithms for Min-Distance Problems in DAGs},
journal = {CoRR},
volume = {abs/2106.02120},
year = {2021},
url = {https://arxiv.org/abs/2106.02120},
eprinttype = {arXiv},
eprint = {2106.02120},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-02120.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-03545,
author = {Meike Neuwohner},
title = {An Improved Approximation Algorithm for the Maximum Weight Independent
Set Problem in d-Claw Free Graphs},
journal = {CoRR},
volume = {abs/2106.03545},
year = {2021},
url = {https://arxiv.org/abs/2106.03545},
eprinttype = {arXiv},
eprint = {2106.03545},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-03545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-06712,
author = {Haike Xu and
Jian Li},
title = {Simple Combinatorial Algorithms for Combinatorial Bandits: Corruptions
and Approximations},
journal = {CoRR},
volume = {abs/2106.06712},
year = {2021},
url = {https://arxiv.org/abs/2106.06712},
eprinttype = {arXiv},
eprint = {2106.06712},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-06712.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-07472,
author = {Anas Barakat and
Pascal Bianchi and
Julien Lehmann},
title = {Analysis of a Target-Based Actor-Critic Algorithm with Linear Function
Approximation},
journal = {CoRR},
volume = {abs/2106.07472},
year = {2021},
url = {https://arxiv.org/abs/2106.07472},
eprinttype = {arXiv},
eprint = {2106.07472},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-07472.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-08377,
author = {Liyu Chen and
Mehdi Jafarnia{-}Jahromi and
Rahul Jain and
Haipeng Luo},
title = {Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms
for Stochastic Shortest Path},
journal = {CoRR},
volume = {abs/2106.08377},
year = {2021},
url = {https://arxiv.org/abs/2106.08377},
eprinttype = {arXiv},
eprint = {2106.08377},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-08377.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-09919,
author = {Adil I. Erzin and
Gregory Melidi and
Stepan Nazarenko and
Roman V. Plotnikov},
title = {Approximation Algorithms for Two-Bar Charts Packing Problem},
journal = {CoRR},
volume = {abs/2106.09919},
year = {2021},
url = {https://arxiv.org/abs/2106.09919},
eprinttype = {arXiv},
eprint = {2106.09919},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-09919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-13951,
author = {Arindam Khan and
Eklavya Sharma and
K. V. N. Sreenivas},
title = {Geometry Meets Vectors: Approximation Algorithms for Multidimensional
Packing},
journal = {CoRR},
volume = {abs/2106.13951},
year = {2021},
url = {https://arxiv.org/abs/2106.13951},
eprinttype = {arXiv},
eprint = {2106.13951},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-13951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-14043,
author = {Ali Vakilian and
Mustafa Yal{\c{c}}iner},
title = {Improved Approximation Algorithms for Individually Fair Clustering},
journal = {CoRR},
volume = {abs/2106.14043},
year = {2021},
url = {https://arxiv.org/abs/2106.14043},
eprinttype = {arXiv},
eprint = {2106.14043},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-14043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-14169,
author = {Fredrik Manne and
Geevarghese Philip and
Saket Saurabh and
Prafullkumar Tale},
title = {{\(\alpha\)}-approximate Reductions: a Novel Source of Heuristics
for Better Approximation Algorithms},
journal = {CoRR},
volume = {abs/2106.14169},
year = {2021},
url = {https://arxiv.org/abs/2106.14169},
eprinttype = {arXiv},
eprint = {2106.14169},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-14169.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-00774,
author = {Hossein Esfandiari and
Vahab S. Mirrokni and
Shyam Narayanan},
title = {Almost Tight Approximation Algorithms for Explainable Clustering},
journal = {CoRR},
volume = {abs/2107.00774},
year = {2021},
url = {https://arxiv.org/abs/2107.00774},
eprinttype = {arXiv},
eprint = {2107.00774},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-00774.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-01673,
author = {Arindam Biswas and
Venkatesh Raman},
title = {Sublinear-Space Approximation Algorithms for Max r-SAT},
journal = {CoRR},
volume = {abs/2107.01673},
year = {2021},
url = {https://arxiv.org/abs/2107.01673},
eprinttype = {arXiv},
eprint = {2107.01673},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-01673.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03076,
author = {Yu Yokoi},
title = {An Approximation Algorithm for Maximum Stable Matching with Ties and
Constraints},
journal = {CoRR},
volume = {abs/2107.03076},
year = {2021},
url = {https://arxiv.org/abs/2107.03076},
eprinttype = {arXiv},
eprint = {2107.03076},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03112,
author = {Francesco Marchetti and
Emma Perracchione},
title = {Efficient Reduced Basis Algorithm {(ERBA)} for kernel-based approximation},
journal = {CoRR},
volume = {abs/2107.03112},
year = {2021},
url = {https://arxiv.org/abs/2107.03112},
eprinttype = {arXiv},
eprint = {2107.03112},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-04699,
author = {Yong Chen and
Zhi{-}Zhong Chen and
Curtis Kennedy and
Guohui Lin and
Yao Xu and
An Zhang},
title = {Approximation algorithms for the directed path partition problems},
journal = {CoRR},
volume = {abs/2107.04699},
year = {2021},
url = {https://arxiv.org/abs/2107.04699},
eprinttype = {arXiv},
eprint = {2107.04699},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-04699.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05793,
author = {S. M. Ferdous and
Alex Pothen and
Arif Khan and
Ajay Panyala and
Mahantesh Halappanavar},
title = {A Parallel Approximation Algorithm for Maximizing Submodular b-Matching},
journal = {CoRR},
volume = {abs/2107.05793},
year = {2021},
url = {https://arxiv.org/abs/2107.05793},
eprinttype = {arXiv},
eprint = {2107.05793},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-13107,
author = {Arvind K. Saibaba and
Rachel Minster and
Misha E. Kilmer},
title = {Efficient randomized tensor-based algorithms for function approximation
and low-rank kernel interactions},
journal = {CoRR},
volume = {abs/2107.13107},
year = {2021},
url = {https://arxiv.org/abs/2107.13107},
eprinttype = {arXiv},
eprint = {2107.13107},
timestamp = {Fri, 30 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-13107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-14608,
author = {Cristian Rusu},
title = {An iterative coordinate descent algorithm to compute sparse low-rank
approximations},
journal = {CoRR},
volume = {abs/2107.14608},
year = {2021},
url = {https://arxiv.org/abs/2107.14608},
eprinttype = {arXiv},
eprint = {2107.14608},
timestamp = {Tue, 03 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-14608.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-03141,
author = {Bing Yu and
Lei Zhang and
Pingwen Zhang and
Xiangcheng Zheng},
title = {Computing solution landscape of nonlinear space-fractional problems
via fast approximation algorithm},
journal = {CoRR},
volume = {abs/2108.03141},
year = {2021},
url = {https://arxiv.org/abs/2108.03141},
eprinttype = {arXiv},
eprint = {2108.03141},
timestamp = {Sun, 29 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-03141.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-10398,
author = {Phablo F. S. Moura and
Matheus Jun Ota and
Yoshiko Wakabayashi},
title = {Approximation and parameterized algorithms to find balanced connected
partitions of graphs},
journal = {CoRR},
volume = {abs/2108.10398},
year = {2021},
url = {https://arxiv.org/abs/2108.10398},
eprinttype = {arXiv},
eprint = {2108.10398},
timestamp = {Fri, 28 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-10398.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-11889,
author = {Tyler Helmuth and
Holden Lee and
Will Perkins and
Mohan Ravichandran and
Qiang Wu},
title = {Approximation algorithms for the random-field Ising model},
journal = {CoRR},
volume = {abs/2108.11889},
year = {2021},
url = {https://arxiv.org/abs/2108.11889},
eprinttype = {arXiv},
eprint = {2108.11889},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-11889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-13544,
author = {Faryad Darabi Sahneh and
Stephen G. Kobourov and
Richard Spence},
title = {Approximation algorithms for priority Steiner tree problems},
journal = {CoRR},
volume = {abs/2108.13544},
year = {2021},
url = {https://arxiv.org/abs/2108.13544},
eprinttype = {arXiv},
eprint = {2108.13544},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-13544.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/corr/abs-2109-07117,
author = {Antoine Godichon{-}Baggioni and
Nicklas Werge and
Olivier Wintenberger},
title = {Non-Asymptotic Analysis of Stochastic Approximation Algorithms for
Streaming Data},
journal = {CoRR},
volume = {abs/2109.07117},
year = {2021},
url = {https://arxiv.org/abs/2109.07117},
eprinttype = {arXiv},
eprint = {2109.07117},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-07117.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-04-26 05:54 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:
