Algorithms and Complexity

14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part I

Häftad, Engelska, 2025

1 109 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

mso-ansi-language: EN-US;">The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025.

Produktinformation

Utgivningsdatum2025-05-18
Mått155 x 235 x 21 mm
Vikt569 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor362
FörlagSpringer International Publishing AG
ISBN9783031929311

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Artificiell intelligens inom Data och it

.- Exact and Approximate High-Multiplicity Scheduling on Identical Machines..- Unit refutations in Horn constraint systems..- On Exact Learning of $d$-Monotone Functions..- Computational Complexity of Combinatorial Distance Matrix Realisation..- Online Range Assignment Problems..- General Position Subset Selection in Line Arrangements..- Branching Programs with Extended Memory: New Insights..- Tatami Printer: Physical ZKPs for Tatami Puzzles..- On the Price of Anarchy in Packet Routing Games with FIFO..- On the Computational Complexity of Graph Reconstruction..- Efficient Certifying Algorithms for Linear Classification..- Improved Sublinear-time Moment Estimation using Weighted Sampling..- Structural Parameterizations of Locating-Dominating Set and Test Cover..- Improved bounds for group testing in arbitrary hypergraphs..- A Parameterized Perspective of All-Colors..- On the Discrete and Semi-Continuous Versions of the Two Watchtowers Problem in the Plane..- Degree Realization by Bipartite Cactus Graphs..- On Two Simple[st] Learning Tasks..- Dynamic Filter and Retrieval with One Access to Modifiable Memory..- Longest path transversals in claw-free and $P 5$-free graphs..- Realizing Graphs with Cut Constraints..- On The Computational Complexity of Games with Uncertainty.