Suchergebnisse - Fixed-parameter algorithms and complexity~

Parameterized Inapproximability Hypothesis under ETH.

Autoren: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Quelle: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-40. 40p.

Schlagwörter: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

Parameterized Complexity of Path Set Packing.

Autoren: Aravind, N. R. Saxena, Roopam

Quelle: Algorithmica. Dec2025, Vol. 87 Issue 12, p1864-1898. 35p.

Schlagwörter: *UNDIRECTED graphs, *COMPUTATIONAL complexity, *APPROXIMATION algorithms, *PARAMETERIZATION, *GRAPH theory

Sparse Integer Programming Is Fixed-Parameter Tractable.

Autoren: Eisenbrand, Friedrich Hunkenschröder, Christoph Klein, Kim-Manuel et al.

Quelle: Mathematics of Operations Research; Aug2025, Vol. 50 Issue 3, p2141-2156, 16p

Schlagwörter: INTEGER programming, COMPUTATIONAL complexity, POLYNOMIAL time algorithms, CONVEX functions, INTEGERS, ALGORITHMS

Algorithms and complexity of strongly stable non-crossing matchings.

Autoren: Sachin Panda, B.S.

Quelle: Discrete Applied Mathematics. Jan2026, Vol. 379, p802-813. 12p.

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem.

Autoren: Baguley, Samuel Friedrich, Tobias Neumann, Aneta et al.

Quelle: Algorithmica. Apr2025, Vol. 87 Issue 4, p537-571. 35p.

Schlagwörter: *LINEAR programming, *ALGORITHMS, *MATHEMATICS, *GENERALIZATION, *EVOLUTIONARY algorithms

An FPT Algorithm for Splitting a Necklace Among Two Thieves.

Autoren: Borzechowski, Michaela Schnider, Patrick Weber, Simon

Quelle: Algorithmica. Feb2026, Vol. 88 Issue 1, p1-19. 19p.

Schlagwörter: *NECKLACES, *COMPUTATIONAL complexity, *PROBLEM solving, *ALGORITHMS

The Computational Complexity of Factored Graphs

Autoren: Huang, Boyang

Schlagwörter: Computer science, Fine-grained complexity, Fixed-parameter tractability, Graph algorithms, Parameterized complexity

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/43k0b3n0
https://escholarship.org/content/qt43k0b3n0/qt43k0b3n0.pdf

Fair Clustering for Data Summarization : Improved Approximation Algorithms and Complexity Insights

Autoren: Gadekar, Ameet Gionis, Aristides Thejaswi, Suhas

Index Begriffe: Algorithmic bias, Algorithmic fairness, Fair clustering, Fair k-center, Fair k-supplier, Responsible computing, Computer Sciences, Datavetenskap (datalogi), Computer graphics and computer vision, Datorgrafik och datorseende, Conference paper, info:eu-repo/semantics/conferenceObject, text

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-363997
WWW2025-ProceedingsoftheACMWebConference,p.4458-4469
WWW 2025 - Proceedings of the ACM Web Conference, p. 4458-4469

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity

Autoren: Harviainen, Juha Sommer, Frank Sorge, Manuel et al.

Index Begriffe: Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2503.03576

The enhanced evolving order based affine projection sign algorithm utilizing a variable step-size strategy.

Autoren: Zhao, Ji Ni, Xia Li, Qiang et al.

Quelle: Circuits, Systems & Signal Processing. Dec2025, Vol. 44 Issue 12, p9233-9260. 28p.

Schlagwörter: *ADAPTIVE filters, *COMPUTATIONAL complexity, *SIMULATION methods & models

Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis.

Autoren: Yu, Renjie Oron, Daniel

Quelle: European Journal of Operational Research. Jul2025, Vol. 324 Issue 1, p40-48. 9p.

Schlagwörter: *ENERGY consumption, *RENEWABLE energy sources, *JOB shops, *SCHEDULING, POLYNOMIAL time algorithms, NATURAL numbers

Algorithms for Minimum Membership Dominating Set problem.

Autoren: Reddy, Sangam Balchandar Kare, Anjeneya Swami

Quelle: RAIRO: Operations Research (2804-7303); 2025, Vol. 59 Issue 5, p3267-3284, 18p

Schlagwörter: DOMINATING set, ALGORITHMS, NP-complete problems, GRAPH theory, COMPUTATIONAL complexity, BIPARTITE graphs, DYNAMIC programming

Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming.

Autoren: Del Pia, Alberto

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 3, p1822-1845, 24p

Schlagwörter: MIXED integer linear programming, POLYNOMIAL time algorithms, AFFINE transformations, COMPUTATIONAL complexity, CONVEX sets, POLYHEDRA

FPT implicit enumeration of active schedules.

Autoren: Tarhan, İstenç Hanen, Claire Kordon, Alix Munier et al.

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 376, p235-250. 16p.

Schlagwörter: *SCHEDULING, *DYNAMIC programming, *TIME complexity, *CONSTRAINED optimization, *COST functions

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

Autoren: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Schlagwörter: Applied Mathematics, Mathematical Sciences, Fixed-parameter algorithms and complexity, Hardness of approximations, PCP theorems

Zugangs-URL: https://escholarship.org/uc/item/1j64r6k1

Algorithms and complexity for monitoring edge-geodetic sets in graphs

Autoren: Foucaud, Florent Marcille, Clara Sandeep, R. B. et al.

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2409.19067

Parameterized complexity of locally minimal defensive alliances.

Autoren: Gaikwad, Ajinkya Maity, Soumen Tripathi, Shuvam Kant

Quelle: Discrete Applied Mathematics. Sep2025, Vol. 372, p324-340. 17p.

Schlagwörter: *NEIGHBORHOODS, *ALGORITHMS

Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity.

Autoren: Nguyen, Hue T. Ha, Dung T. K. Pham, Canh V.

Quelle: Asia-Pacific Journal of Operational Research; Dec2024, Vol. 41 Issue 6, p1-21, 21p

Schlagwörter: PARALLEL algorithms, SUBMODULAR functions, APPROXIMATION algorithms, ARTIFICIAL intelligence, OPERATIONS research

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion.

Autoren: Blažej, Václav Jana, Satyabrata Ramanujan, M. S. et al.

Quelle: Algorithmica; Nov2025, Vol. 87 Issue 11, p1669-1709, 41p

Schlagwörter: GRAPH theory, COMPUTATIONAL complexity, DIRECTED graphs, HOUSING market, COMBINATORICS

Fair Clustering for Data Summarization: Improved Approximation Algorithms and Complexity Insights

Autoren: Gadekar, Ameet Gionis, Aristides Thejaswi, Suhas

Index Begriffe: Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Computer Science - Computers and Society, Computer Science - Discrete Mathematics, text

URL: http://arxiv.org/abs/2410.12913