Výsledky vyhľadávania - Polynomial-Time Approximation Algorithm~

A Polynomial-Time Approximation Algorithm for Complete Interval Minors

Autori: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang a ďalší

Prispievatelia: Bourneuf, Romain Cocquet, Julien Tang, Chaoliang a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: 70524156 Oda, Masaki Kawabata, Akio a ďalší

Témy: 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.

Autori: Kawabata, Akio Oki, Eiji Oda, Masaki

Témy: 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

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

Autori: Nemesch, Levin Ruzika, Stefan Thielen, Clemens a ďalší

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

Prístupová URL adresa: http://arxiv.org/abs/2504.19677

Approximation algorithms for the integrated path and bin packing problem.

Autori: Li, Weidong Sun, Ruiqing

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

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

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

Autori: Jing, Yifan Mohar, Bojan

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

Predmety: 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.

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

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

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

Polynomial Time Approximation Algorithm for Supremum of Sub-Exponential Processes

Zdroj: Pure Mathematics. 14:105-111

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

Autori: Khan, Arindam Lonkar, Aditya Maiti, Arnab a ďalší

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

Predmety: 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

Autori: Feng, Weiming Guo, Heng Jerrum, Mark a ďalší

Zdroj: 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)

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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.

Autori: Zhou, Jiao Ran, Yingli Pardalos, Panos M. a ďalší

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

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

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

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

Zdroj: 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)

PENGRAV: a practical polynomial time algorithm for optimizing the engraving path of an automatic engraving machine using a 3/2 approximation algorithm

Autori: Neeta A. Eapen Robert B. Heckendorn

Zdroj: The International Journal of Advanced Manufacturing Technology. 123:1721-1732

Predmety: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

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

Autori: Dyer, M Heinrich, M Jerrum, M a ďalší

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

Predmety: 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 súboru: application/pdf

Prí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.

Autori: Gong, Mingyang Edgar, Brett Fan, Jing a ďalší

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

Predmety: *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.

Autori: Zhang, Xiechen Angel, Eric Chu, Feng a ďalší

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

Predmety: *COMPUTER science, *PRODUCTION scheduling, POLYNOMIAL time algorithms, APPROXIMATION algorithms, PARALLEL algorithms

A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

Autori: Guo, Heng Jerrum, Mark Heng Guo and Mark Jerrum a ďalší

Prispievatelia: Guo, Heng Jerrum, Mark Heng Guo and Mark Jerrum a ďalší

Zdroj: Guo, H & Jerrum, M 2019, ' A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability ', SIAM Journal on Computing, vol. 48, no. 3, pp. 964–978 . https://doi.org/10.1137/18M1201846
Guo, H & Jerrum, M 2018, A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability . in I Chatzigiannakis, C Kaklamanis, D Marx & D Sannella (eds), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) . vol. 107, Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, Dagstuhl, Germany, pp. 68:1-68:12, 45th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, 9/07/18 . https://doi.org/10.4230/LIPIcs.ICALP.2018.68

Predmety: FOS: Computer and information sciences, Markov chains, randomized algorithms, 0102 computer and information sciences, 01 natural sciences, Approximate counting, Computer Science - Data Structures and Algorithms, network reliability, Data Structures and Algorithms (cs.DS), ddc:004, Network Reliability, Sampling, approximate counting

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/9072/pdf/LIPIcs-ICALP-2018-68.pdf
http://arxiv.org/abs/1709.08561
https://qmro.qmul.ac.uk/xmlui/handle/123456789/57919
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp48.html#GuoJ19
https://epubs.siam.org/doi/pdf/10.1137/18M1201846
https://ui.adsabs.harvard.edu/abs/2017arXiv170908561G/abstract
https://arxiv.org/abs/1709.08561
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.68
https://hdl.handle.net/20.500.11820/38d3d827-0dbc-4a34-8c02-75d492d388d2
https://www.pure.ed.ac.uk/ws/files/79635690/Cluster.Popping_SICOMP_final.pdf
https://www.pure.ed.ac.uk/ws/files/82532416/A_Polynomial_Time_Approximation_ICALP_GUO_DoA150418_VoR_CC_BY.pdf
https://hdl.handle.net/20.500.11820/c2b4e5cc-2022-4b12-9ab5-42c55f8f0d51

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

Autori: Mathieu, Claire Zhou, Hang

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

Predmety: VEHICLE routing problem, GRAPH algorithms, POLYNOMIAL time algorithms, COMBINATORIAL optimization, POLYNOMIAL approximation

The circular balancing problem.

Autori: Lee, Myungho Lee, Kangbok Pinedo, Michael

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

Predmety: POLYNOMIAL time algorithms, APPROXIMATION algorithms, COMPUTATIONAL complexity, COMBINATORIAL optimization, NP-hard problems

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM

Autori: Ksenia Rizhenko Katherine Neznakhina Michael Khachay

Zdroj: Ural Mathematical Journal, Vol 9, Iss 1 (2023)

Predmety: prize-collecting traveling salesman problem, triangle inequality, approximation algorithm, fixed approximation ratio., Mathematics, QA1-939

Popis súboru: electronic resource

Relation: https://umjuran.ru/index.php/umj/article/view/648; https://doaj.org/toc/2414-3952

Prístupová URL adresa: https://doaj.org/article/2345846251fb4893bcfbe1c2a0dda240