Search Results - Polynomial-Time Approximation Algorithm*

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes

Authors: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Contributors: Encz, Koppány István Mastrolilli, Monaldo Vercesi, Eleonora et al.

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Optimization and Control (math.OC), Optimization and Control, Branch-and-bound algorithm, FOS: Mathematics, Data Structures and Algorithms (cs.DS), ddc:004, Polynomial-time approximation scheme, Knapsack problem, Parallel machine scheduling problem

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.15885
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.73

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

Authors: Masaki Oda Akio Kawabata Eiji Oki

Source: IEEE Networking Letters. 7:135-139

A Polynomial-Time Approximation Algorithm for Complete Interval Minors

Authors: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang et al.

Contributors: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang et al.

Subject Terms: FOS: Computer and information sciences, Delayed decompositions, Ordered graphs, Discrete Mathematics (cs.DM), Interval minors, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Approximation algorithm, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2505.05997
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.15

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

Authors: 70524156 Oda, Masaki Kawabata, Akio et al.

Index Terms: 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.

Authors: Kawabata, Akio Oki, Eiji Oda, Masaki

Index Terms: 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.

Authors: Dong, Jianming Jin, Ruyan Lin, Guohui et al.

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

Subject Terms: *SCHEDULING, *APPROXIMATION algorithms, *PRODUCTION scheduling, *LINEAR programming

A Polynomial-Time Inner Approximation Algorithm for Multi-Objective Optimization

Authors: Nemesch, Levin Ruzika, Stefan Thielen, Clemens et al.

Subject Terms: Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Access URL: http://arxiv.org/abs/2504.19677

Approximation algorithms for the integrated path and bin packing problem.

Authors: Li, Weidong Sun, Ruiqing

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

Subject Terms: *BIN packing problem, POLYNOMIAL time algorithms, POLYNOMIAL approximation, DIRECTED graphs, BINS

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

Authors: Jing, Yifan Mohar, Bojan

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

Subject Terms: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches.

Authors: Jeong, In-Jae¹ (AUTHOR) ijeong@hanyang.ac.kr

Source: Engineering Optimization. May2025, Vol. 57 Issue 5, p1323-1342. 20p.

Subject Terms: *POLYNOMIAL approximation, *POLYNOMIAL time algorithms, *HEURISTIC algorithms, *CUSTOMER satisfaction, *TRANSPORTATION schedules

Polynomial Time Approximation Algorithm for Supremum of Sub-Exponential Processes

Source: Pure Mathematics. 14:105-111

A TIGHT ANALYSIS OF BETHE APPROXIMATION FOR PERMANENT.

Authors: ANARI, NIMA REZAEI, ALIREZA

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

Subject Terms: *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

Authors: Yuichi Asahiro Jesper Jansson Guohui Lin et al.

Contributors: Yuichi Asahiro Jesper Jansson Guohui Lin et al.

Source: Discrete Applied Mathematics. 353:44-64

Subject Terms: 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

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2022.15

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

Authors: Bagheri Nezhad, Sina Bandyapadhyay, Sayan Chen, Tianzhi et al.

Contributors: Bagheri Nezhad, Sina Bandyapadhyay, Sayan Chen, Tianzhi et al.

Subject Terms: 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

File Description: application/pdf

Access URL: 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.

Authors: Khan, Arindam Lonkar, Aditya Maiti, Arnab et al.

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

Subject Terms: NP-hard problems, PACKING problem (Mathematics), POLYNOMIAL time algorithms, MATHEMATICAL optimization, BIN packing problem, APPROXIMATION algorithms

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions

Authors: Feng, Weiming Guo, Heng Jerrum, Mark et al.

Source: Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
TheoretiCS, Vol Volume 2 (2023)
Feng, W, Guo, H, Jerrum, M & Wang, J 2023, ' A simple polynomial-time approximation algorithm for the total variation distance between two product distributions ', TheoretiCS, vol. 2, 8, pp. 1-7 . https://doi.org/10.46298/theoretics.23.7
TheoretiCS
2023 Symposium on Simplicity in Algorithms (SOSA)
Symposium on Simplicity in Algorithms (SOSA)

Subject Terms: FOS: Computer and information sciences, total variation distance, f.2.0, g.3, G.3, 68w20, F.2.0, QA75.5-76.95, 0102 computer and information sciences, 68W20, product distribution, 01 natural sciences, computer science - data structures and algorithms, Methodology (stat.ME), Electronic computers. Computer science, statistics - methodology, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithm, Statistics - Methodology

File Description: application/pdf

Access URL: http://arxiv.org/abs/2208.00740
https://theoretics.episciences.org/10534
https://doi.org/10.46298/theoretics.23.7
https://doaj.org/article/8d75bcff5dce43258cf965b28c393697
https://hdl.handle.net/20.500.11820/ec699ef7-b580-45b5-992a-12e6ca5322b4
https://www.pure.ed.ac.uk/ws/files/356660619/A_simple_polynomial_FENG_DOA15052023_VOR_CC_BY.pdf

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

Authors: Zhou, Jiao Ran, Yingli Pardalos, Panos M. et al.

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

Subject Terms: DOMINATING set, GRAPH theory, MATHEMATICAL optimization, HEURISTIC, APPROXIMATION algorithms, ALGORITHMS, POLYNOMIAL time algorithms

An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines

Authors: Epstein, Leah Levin, Asaf Leah Epstein and Asaf Levin

Contributors: Epstein, Leah Levin, Asaf Leah Epstein and Asaf Levin

Subject Terms: Approximation schemes, Min-sum objective, ddc:004, Scheduling algorithms

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.25

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

Authors: Cslovjecsek, Jana Pilipczuk, Michał Węgrzycki, Karol

Source: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

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

Authors: Cohen-Addad, Vincent Das, Debarati Kipouridis, Evangelos et al.

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

Subject Terms: POLYNOMIAL time algorithms, TREE graphs, APPROXIMATION algorithms