Suchergebnisse - NP-hard approximation algorithm

Exact and approximation algorithms for covering timeline in temporal graphs.

Autoren: Dondi, Riccardo Popa, Alexandru

Quelle: Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p609-628. 20p.

Schlagwörter: *ALGORITHMS, *MATHEMATICAL optimization, NP-hard problems, APPROXIMATION algorithms, PARAMETERIZATION, GRAPH theory, TIME-varying networks

Hardness and approximation results for some variants of Stable Marriage problem.

Autoren: Panda, B.S. Sachin

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p170-182. 13p.

Schlagwörter: *NP-hard problems, *APPROXIMATION algorithms, *ALGORITHMS, *MATCHING theory

Exact and approximation algorithms for routing a convoy through a graph.

Autoren: van Ee, Martijn Oosterwijk, Tim Sitters, René et al.

Quelle: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p985-1008. 24p.

Schlagwörter: *TRAVELING salesman problem, ROUTING algorithms, APPROXIMATION algorithms, NP-hard problems, ROUTING systems, MATHEMATICAL functions, VEHICLE routing problem, CARAVANS (Groups of travelers)

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

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

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

Schlagwörter: NP-hard problems, PACKING problem (Mathematics), POLYNOMIAL time algorithms, MATHEMATICAL optimization, BIN packing problem, APPROXIMATION algorithms

An improved approximation algorithm for the $ k $-prize-collecting minimum power cover problem.

Autoren: Wang, Wencheng Cheng, Binhui Li, Jianglin et al.

Quelle: Journal of Industrial & Management Optimization. Apr2024, Vol. 20 Issue 4, p1-16. 16p.

Schlagwörter: APPROXIMATION algorithms, NP-hard problems, POINT set theory, INDEPENDENT sets

A linear-time approximation algorithm for the minimum-length geometric embedding of trees.

Autoren: Bagheri, Alireza Keshavarz-Kohjerdi, Fatemeh Razzazi, Mohammadreza

Quelle: Optimization. May2025, Vol. 74 Issue 8, p1915-1930. 16p.

Schlagwörter: *NP-hard problems, *POINT set theory, *TREE height, *GENERALIZATION, *TREES

Approximation Algorithms for the Two-Watchman Route in a Simple Polygon

Autoren: Nilsson, Bengt J. Packer, Eli

Quelle: Algorithmica. 86(9):2845-2884

Schlagwörter: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69948
https://doi.org/10.1007/s00453-024-01245-0

Tight Approximation Algorithms for 2D Guillotine Strip Packing

Autoren: Arindam Khan Aditya Lonkar Arnab Maiti et al.

Quelle: ACM Transactions on Algorithms. 21:1-30

Schlagwörter: ddc

Dateibeschreibung: application/pdf

Zugangs-URL: https://mediatum.ub.tum.de/1833029

Approximation algorithms for the maximum path cover problem using long paths.

Autoren: Gong, Mingyang Chen, Yong Chen, Zhi-Zhong et al.

Quelle: Information & Computation. Nov2025, Vol. 307, pN.PAG-N.PAG. 1p.

Schlagwörter: *APPROXIMATION algorithms, *NP-hard problems, *GRAPH theory, *HAMILTONIAN graph theory

Approximation algorithms for the graph burning on cactus and directed trees.

Autoren: Gautam, Rahul Kumar Kare, Anjeneya Swami Bhavani, S. Durga

Quelle: Discrete Mathematics, Algorithms & Applications; Oct2024, Vol. 16 Issue 7, p1-20, 20p

Schlagwörter: GRAPH algorithms, APPROXIMATION algorithms, UNDIRECTED graphs, NP-hard problems, ALGORITHMS, DIRECTED graphs

单机两代理串行分批排序问题的近似算法. (Chinese)

Alternate Title: Approximation algorithms for two-agent serial batching scheduling problems. (English)

Autoren: 赵娣 余金 鲁习文

Quelle: Operations Research Transactions / Yunchouxue Xuebao; Jun2025, Vol. 29 Issue 2, p184-193, 10p

Schlagwörter: APPROXIMATION algorithms, NP-hard problems, SCHEDULING, BATCH processing

An Algorithm for Matching in a (3,3)‐Hypergraph With One‐Sided Preferences Having Quadratic Unpopularity Factor.

Autoren: Singh, Yashdeep Karmakar, Sushanta

Quelle: Concurrency & Computation: Practice & Experience; 11/30/2025, Vol. 37 Issue 25/26, p1-13, 13p

Schlagwörter: MATCHING theory, HYPERGRAPHS, ALGORITHMS, NP-hard problems, APPROXIMATION error

Approximation Algorithms for Covering Vertices by Long Paths.

Autoren: Gong, Mingyang Edgar, Brett Fan, Jing et al.

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

Schlagwörter: *APPROXIMATION algorithms, *POLYNOMIAL time algorithms, *NP-hard problems, *ALGORITHMS, *AMORTIZATION

Improved approximation algorithms for the k-path partition problem.

Autoren: Li, Shiming Yu, Wei Liu, Zhaohui

Quelle: Journal of Global Optimization; Dec2024, Vol. 90 Issue 4, p983-1006, 24p

Schlagwörter: TRAVELING salesman problem, SEARCH algorithms, UNDIRECTED graphs, PARALLEL algorithms, NP-hard problems, APPROXIMATION algorithms, DIRECTED graphs

The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost.

Autoren: Li, Weidong Ou, Jinwen

Quelle: European Journal of Operational Research. Dec2025, Vol. 327 Issue 2, p420-431. 12p.

Schlagwörter: *MATHEMATICAL analysis, *COST control, ASSIGNMENT problems (Programming), APPROXIMATION algorithms, NP-hard problems

Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance.

Autoren: Fan, Jing¹ (AUTHOR) sspu_fj@163.com

Quelle: International Journal of Foundations of Computer Science. Aug2025, Vol. 36 Issue 5, p827-840. 14p.

Schlagwörter: *SCHEDULING, *BATCH processing, NP-hard problems, APPROXIMATION algorithms

Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems

Autoren: Bampis, Evripidis Escoffier, Bruno Xefteris, Michalis

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Zugangs-URL: http://arxiv.org/abs/2402.02062

A new heuristic for the continuous fixed-radius disc cover problem.

Autoren: Chen, Xiaopeng Gao, Xuehong Li, Chong et al.

Quelle: Engineering Optimization; Jul2025, Vol. 57 Issue 7, p1764-1777, 14p

Schlagwörter: HEURISTIC, APPROXIMATION algorithms, TRAVELING salesman problem, NP-hard problems, MATHEMATICAL optimization, EMPIRICAL research

New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints.

Autoren: Wang, Siwen Xu, Zi

Quelle: Journal of Optimization Theory & Applications. Aug2021, Vol. 190 Issue 2, p524-539. 16p.

Schlagwörter: *APPROXIMATION algorithms, *NP-hard problems, *DISPERSION (Chemistry), *STATISTICAL sampling, *SAMPLING (Process), *SAMPLING methods

Globally Linked Pairs and Cheapest Globally Rigid Supergraphs.

Autoren: Jordán, Tibor Villányi, Soma

Quelle: SIAM Journal on Discrete Mathematics; 2025, Vol. 39 Issue 3, p1520-1544, 25p

Schlagwörter: GRAPH theory, NP-hard problems, APPROXIMATION algorithms