Výsledky vyhľadávania - Approximation algorithms for NP-hard problems

Exact and approximation algorithms for covering timeline in temporal graphs.

Autori: Dondi, Riccardo Popa, Alexandru

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

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

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms.

Autori: Albers, Susanne Gálvez, Waldo Özdemir, Ömer Behic

Zdroj: Procedia Computer Science. 2025, Vol. 273, p301-308. 8p.

Predmety: Bin packing problem, Approximation algorithms, Resource allocation, NP-hard problems, Optimization algorithms

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

Autori: Panda, B.S. Sachin

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

Predmety: *NP-hard problems, *APPROXIMATION algorithms, *ALGORITHMS, *MATCHING theory

An extended analysis of approximation algorithms for k-median problems on complex networks

Autori: Roldan Pozo

Zdroj: Applied Network Science, Vol 10, Iss 1, Pp 1-22 (2025)

Predmety: k-median problem, Information diffusion, Approximation methods, Influential spreaders, Centrality and ranking, NP-hard algorithms, Applied mathematics. Quantitative methods, T57-57.97

Popis súboru: electronic resource

Relation: https://doaj.org/toc/2364-8228

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

Approximation algorithms for node and element connectivity augmentation problems.

Autori: Nutov, Zeev¹ (AUTHOR) nutov@openu.ac.il

Zdroj: Theory of Computing Systems. Oct2024, Vol. 68 Issue 5, p1468-1485. 18p.

Predmety: *NP-hard problems, *ALGORITHMS, *EQUATIONS, *DECISION making, *APPROXIMATION algorithms

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

Autori: van Ee, Martijn Oosterwijk, Tim Sitters, René a ďalší

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

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

Investigating Quantum Approximation Techniques for Tackling NP-Hard Problems in Distributed Systems

Autori: Yogatama, Chandra Wibisono, Randi Dwi

Zdroj: ALCOM: Journal of Algorithm and Computing; Vol. 1 No. 1 (2025): ALCOM: Journal of Algorithm and Computing; 33-44; 3089-5634; 3089-6169

Témy: NP-hard problems, quantum approximation algorithms, distributed systems, hybrid quantum-classical computing, quantum speedup, info:eu-repo/semantics/article, info:eu-repo/semantics/publishedVersion, Peer-reviewed Article

URL: https://alcom.id/alcom/article/view/2
https://alcom.id/alcom/article/view/2/4
https://alcom.id/alcom/article/view/2/4

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

Investigating Quantum Approximation Techniques for Tackling NP-Hard Problems in Distributed Systems

Autori: Chandra Yogatama Randi Dwi Wibisono

Zdroj: ALCOM: Journal of Algorithm and Computing. 1:33-44

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

Autori: Wang, Wencheng Cheng, Binhui Li, Jianglin a ďalší

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

Predmety: APPROXIMATION algorithms, NP-hard problems, POINT set theory, INDEPENDENT sets

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

Autori: Li, Weidong Ou, Jinwen

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

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

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

Autori: Gong, Mingyang Chen, Yong Chen, Zhi-Zhong a ďalší

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

Predmety: *APPROXIMATION algorithms, *NP-hard problems, *GRAPH theory, *HAMILTONIAN graph theory

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

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

Autori: 赵娣 余金 鲁习文

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

Predmety: APPROXIMATION algorithms, NP-hard problems, SCHEDULING, BATCH processing

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

Autori: Nilsson, Bengt J. Packer, Eli

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

Predmety: Art gallery problems, Visibility, Watchman routes, Approximation algorithms

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69948
https://doi.org/10.1007/s00453-024-01245-0

The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings.

Autori: Liu, Xiaofei Li, Weidong

Zdroj: International Journal of Foundations of Computer Science; Aug2025, Vol. 36 Issue 5, p767-780, 14p

Predmety: GRAPH theory, NP-hard problems, MATHEMATICAL optimization, APPROXIMATION algorithms, STAR graphs (Graph theory)

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

Autori: Chen, Xiaopeng Gao, Xuehong Li, Chong a ďalší

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

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

Improved approximation algorithms for the k-path partition problem.

Autori: Li, Shiming Yu, Wei Liu, Zhaohui

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

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

Finding Triangles or Independent Sets; and Other Dual Pair Approximations.

Autori: Dumitrescu, Adrian

Zdroj: Studia Scientiarum Mathematicarum Hungarica; Mar2025, Vol. 62 Issue 1, p47-62, 16p

Predmety: GRAPH coloring, DENSE graphs, INDEPENDENT sets, APPROXIMATION algorithms, NP-hard problems, TRIANGLES

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

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

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

Predmety: *SCHEDULING, *BATCH processing, NP-hard problems, APPROXIMATION algorithms

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

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

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

Predmety: GRAPH algorithms, APPROXIMATION algorithms, UNDIRECTED graphs, NP-hard problems, ALGORITHMS, DIRECTED graphs