Výsledky vyhledávání - polynomial-time approximation algorithms

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications

Autoři: 70524156 Oda, Masaki Kawabata, Akio a další

Témata: Server allocation, approximation algorithm, data consistency, journal article

URL: http://hdl.handle.net/2433/295071
http://xplorestaging.ieee.org/ielx8/8253410/11038953/10883039.pdf?arnumber=10883039
10.1109/lnet.2025.3541351
http://xplorestaging.ieee.org/ielx8/8253410/11038953/10883039.pdf?arnumber=10883039

Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications.

Autoři: Kawabata, Akio Oki, Eiji Oda, Masaki

Témata: Server allocation, approximation algorithm, data consistency, Journal Article., VoR.

URL: http://hdl.handle.net/2433/295071
https://doi.org/10.1109/lnet.2025.3541351
http://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/295071/1/lnet2025.3541351.pdf

An efficient polynomial-time approximation scheme for parallel multi-stage open shops.

Autoři: Dong, Jianming Jin, Ruyan Lin, Guohui a další

Zdroj: Discrete Applied Mathematics. Dec2025, Vol. 377, p390-401. 12p.

Témata: *SCHEDULING, *APPROXIMATION algorithms, *PRODUCTION scheduling, *LINEAR programming

Approximation algorithms for the integrated path and bin packing problem.

Autoři: Li, Weidong Sun, Ruiqing

Zdroj: RAIRO: Operations Research (2804-7303). 2025, Vol. 59 Issue 1, p325-333. 9p.

Témata: *BIN packing problem, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DIRECTED graphs, BINS

Efficient polynomial-time approximation scheme for the genus of dense graphs.

Autoři: Jing, Yifan Mohar, Bojan

Zdroj: Journal of the ACM. Dec2024, Vol. 71 Issue 6, p1-33. 33p.

Témata: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

A TIGHT ANALYSIS OF BETHE APPROXIMATION FOR PERMANENT.

Autoři: ANARI, NIMA REZAEI, ALIREZA

Zdroj: SIAM Journal on Computing. 2025, Vol. 54 Issue 4, p81-101. 21p.

Témata: *MATHEMATICS, NONNEGATIVE matrices, POLYNOMIAL time algorithms, APPROXIMATION algorithms, MATHEMATICAL proofs, MATHEMATICAL inequalities, APPROXIMATION error

Polynomial-time equivalences and refined algorithms for longest common subsequence variants

Autoři: Yuichi Asahiro Jesper Jansson Guohui Lin a další

Přispěvatelé: Yuichi Asahiro Jesper Jansson Guohui Lin a další

Zdroj: Discrete Applied Mathematics. 353:44-64

Témata: exact algorithms, and approximation algorithms, Repetition-bounded longest common subsequence problem, 0202 electrical engineering, electronic engineering, information engineering, multiset restricted longest common subsequence problem, 0102 computer and information sciences, 02 engineering and technology, ddc:004, two-side-filled longest common subsequence problem, 01 natural sciences, one-side-filled longest common subsequence problem

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.15

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering

Autoři: Bagheri Nezhad, Sina Bandyapadhyay, Sayan Chen, Tianzhi a další

Přispěvatelé: Bagheri Nezhad, Sina Bandyapadhyay, Sayan Chen, Tianzhi a další

Témata: FOS: Computer and information sciences, fair clustering, Data Structures and Algorithms, sum-of-radii clustering, Data Structures and Algorithms (cs.DS), ddc:004, approximation algorithms

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2504.14683
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.62

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

Autoři: Khan, Arindam Lonkar, Aditya Maiti, Arnab a další

Zdroj: ACM Transactions on Algorithms; Jul2025, Vol. 21 Issue 3, p1-30, 30p

Témata: NP-hard problems, PACKING problem (Mathematics), POLYNOMIAL time algorithms, MATHEMATICAL optimization, BIN packing problem, APPROXIMATION algorithms

A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set.

Autoři: Zhou, Jiao Ran, Yingli Pardalos, Panos M. a další

Zdroj: INFORMS Journal on Computing; Jul/Aug2025, Vol. 37 Issue 4, p1106-1120, 15p

Témata: DOMINATING set, GRAPH theory, MATHEMATICAL optimization, HEURISTIC, APPROXIMATION algorithms, ALGORITHMS, POLYNOMIAL time algorithms

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.

Autoři: Cohen-Addad, Vincent Das, Debarati Kipouridis, Evangelos a další

Zdroj: Journal of the ACM. Apr2024, Vol. 71 Issue 2, p1-41. 41p.

Témata: POLYNOMIAL time algorithms, TREE graphs, APPROXIMATION algorithms

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs

Autoři: Dyer, M Heinrich, M Jerrum, M a další

Zdroj: Combinatorics, Probability and Computing. 30:905-921

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, 4. Education, Computer Science - Data Structures and Algorithms, Probability (math.PR), FOS: Mathematics, Data Structures and Algorithms (cs.DS), 68Q25 (Primary) 68Q17, 68Q87, 82B20 (Secondary), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Mathematics - Probability

Popis souboru: application/pdf

Přístupová URL adresa: https://eprints.whiterose.ac.uk/162602/1/2005.07944.pdf
http://arxiv.org/abs/2005.07944
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-07944

Approximation Algorithms for Covering Vertices by Long Paths.

Autoři: Gong, Mingyang Edgar, Brett Fan, Jing a další

Zdroj: Algorithmica. Aug2024, Vol. 86 Issue 8, p2625-2651. 27p.

Témata: *APPROXIMATION algorithms, *POLYNOMIAL time algorithms, *NP-hard problems, *ALGORITHMS, *AMORTIZATION

Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem.

Autoři: Zhang, Xiechen Angel, Eric Chu, Feng a další

Zdroj: European Journal of Operational Research. Mar2025, Vol. 321 Issue 2, p397-406. 10p.

Témata: *COMPUTER science, *PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION algorithms, PARALLEL algorithms

A tight (1.5+ϵ)-approximation for unsplittable capacitated vehicle routing on trees.

Autoři: Mathieu, Claire Zhou, Hang

Zdroj: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p115-146. 32p.

Témata: VEHICLE routing problem, GRAPH algorithms, POLYNOMIAL time algorithms, COMBINATORIAL optimization, POLYNOMIAL approximation

The circular balancing problem.

Autoři: Lee, Myungho Lee, Kangbok Pinedo, Michael

Zdroj: European Journal of Operational Research. Feb2025, Vol. 321 Issue 1, p41-56. 16p.

Témata: POLYNOMIAL time algorithms, APPROXIMATION algorithms, COMPUTATIONAL complexity, COMBINATORIAL optimization, NP-hard problems

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks.

Autoři: Frohn, Martin Kelk, Steven

Zdroj: Annals of Operations Research. Feb2025, Vol. 345 Issue 1, p125-145. 21p.

Témata: *MATHEMATICAL programming, POLYNOMIAL time algorithms, APPROXIMATION algorithms, APPLIED mathematics, COMBINATORIAL optimization

Three results towards approximation of special maximum matchings in graphs.

Autoři: Mkrtchyan, Vahan¹ (AUTHOR) vahan.mkrtchyan@gssi.it

Zdroj: Discrete Applied Mathematics. Aug2025, Vol. 371, p127-136. 10p.

Témata: *POLYNOMIAL time algorithms, *NP-complete problems, *STATISTICAL decision making, *ALGORITHMS, *APPROXIMATION algorithms

Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems.

Autoři: Helfrich, Stephan Ruzika, Stefan Thielen, Clemens

Zdroj: INFORMS Journal on Computing; Sep/Oct2025, Vol. 37 Issue 5, p1223-1241, 19p

Témata: MULTI-objective optimization, CONVEX sets, KNAPSACK problems, APPROXIMATION error, POLYNOMIAL time algorithms, ALGORITHMS, COMBINATORIAL optimization

Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants.

Autoři: Bandyapadhyay, Sayan Friggstad, Zachary Mousavi, Ramin

Zdroj: Algorithmica. Aug2024, Vol. 86 Issue 8, p2557-2574. 18p.

Témata: *APPROXIMATION algorithms, *POLYNOMIAL time algorithms