Výsledky vyhledávání - Approximation Algorithms ACM Reference Format

Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree.

Autoři: Traub, Vera Zenklusen, Rico

Zdroj: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-40, 40p

Témata: GREEDY algorithms, COMBINATORIAL optimization, TREES

Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform

Autoři: Brisebarre, Nicolas Joldes, Mioara Muller, Jean-Michel a další

Přispěvatelé: Brisebarre, Nicolas Joldes, Mioara Muller, Jean-Michel a další

Zdroj: ACM Transactions on Mathematical Software. 46:1-27

Témata: [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, Numeric approximation algorithms, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Fast Fourier Transform, Floating-point arithmetic, 01 natural sciences, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Rounding error analysis, • Theory of computation → Design and analysis of algorithms, Additional Key Words and Phrases: Floating-point arithmetic, Rounding error analysis ACM Reference format, CCS Concepts: • Mathematics of computing → Mathematical software, [INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic, 0101 mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01949458v2/file/Bounds-FFT-HaLV2-oct19.pdf
https://hal.science/hal-01949458v2/document
https://doi.org/10.1145/3368619
https://hal.science/hal-01949458v2
https://hal.archives-ouvertes.fr/hal-01949458/document
https://doi.org/10.1145/3368619
https://hal.archives-ouvertes.fr/hal-01949458
https://dblp.uni-trier.de/db/journals/toms/toms46.html#BrisebarreJMNP20
https://dl.acm.org/doi/abs/10.1145/3368619

2-Approximation for Prize-Collecting Steiner Forest.

Autoři: Ahmadi, Ali Gholami, Iman Hajiaghayi, MohammadTaghi a další

Zdroj: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-27, 27p

Témata: ALGORITHMS

A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\)-Approximation for Directed Steiner Tree in Planar Graphs.

Autoři: Friggstad, Zachary Mousavi, Ramin

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-14, 14p

Témata: TREE graphs, APPROXIMATION algorithms, TREES, SAWLOGS

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

Autoři: Jing, Yifan Mohar, Bojan

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

Témata: TOPOLOGICAL graph theory, GRAPH algorithms, APPROXIMATION algorithms, DENSE graphs, SUBGRAPHS, TRIANGLES

Tight Approximation Algorithms for 2D Guillotine Strip Packing.

Autoři: Khan, Arindam Lonkar, Aditya Maiti, Arnab a další

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

Témata: NP-hard problems, PACKING problem (Mathematics), POLYNOMIAL time algorithms, MATHEMATICAL optimization, BIN packing problem, APPROXIMATION algorithms

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.

Autoři: Cohen-Addad, Vincent Das, Debarati Kipouridis, Evangelos a další

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-41, 41p

Témata: POLYNOMIAL time algorithms, TREE graphs, APPROXIMATION algorithms

Minimum Plane Bichromatic Spanning Trees.

Autoři: Akitaya, Hugo A. Biniaz, Ahmad Demaine, Erik D. a další

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-14, 14p

Témata: SPANNING trees, POLYNOMIAL time algorithms, APPROXIMATION algorithms

Sketching Approximability of All Finite CSPs.

Autoři: Chou, Chi-Ning Golovnev, Alexander Sudan, Madhu a další

Zdroj: Journal of the ACM; Apr2024, Vol. 71 Issue 2, p1-74, 74p

Témata: CONSTRAINT satisfaction, BOOLEAN functions, SEPARATION of variables, FOURIER analysis, APPROXIMATION algorithms, COMMUNICATION barriers, HYPERCUBES

Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics.

Autoři: Pellizzoni, Paolo Pietracaprina, Andrea Pucci, Geppino

Zdroj: ACM Transactions on Knowledge Discovery from Data; May2025, Vol. 19 Issue 4, p1-45, 45p

Témata: DATA structures, APPROXIMATION algorithms, POLYNOMIAL time algorithms, METRIC spaces, POLYNOMIAL approximation

Pliability and Approximating Max-CSPs.

Autoři: ROMERO, MIGUEL WROCHNA, MARCIN ŽIVNÝ, STANISLAV

Zdroj: Journal of the ACM; Dec2023, Vol. 70 Issue 6, p1-43, 43p

Témata: DENSE graphs, GRAPH theory, PLANAR graphs, SPARSE graphs, HOMOMORPHISMS, POLYNOMIAL time algorithms, APPROXIMATION algorithms, HYPERGRAPHS

Exponentially Faster Massively Parallel Maximal Matching.

Autoři: BEHNEZHAD, SOHEIL HAJIAGHAYI, MOHAMMADTAGHI HARRIS, DAVID G.

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-18, 18p

Témata: RANDOM graphs, DISTRIBUTED computing, PARALLEL programming, GRAPH algorithms, APPROXIMATION algorithms

Near-optimal Algorithms for Stochastic Online Bin Packing.

Autoři: Ayyadevara, Nikhil Dabas, Rajni Khan, Arindam a další

Zdroj: ACM Transactions on Algorithms; Apr2025, Vol. 21 Issue 2, p1-39, 39p

Témata: ONLINE algorithms, POLYNOMIAL time algorithms, APPROXIMATION algorithms, BIN packing problem, RANDOM sets, ALGORITHMS

Twin-Width IV: Ordered Graphs and Matrices.

Autoři: Bonnet, Édouard Giocanti, Ugo de Mendez, Patrice Ossona a další

Zdroj: Journal of the ACM; Jun2024, Vol. 71 Issue 3, p1-45, 45p

Témata: FINITE model theory, GRAPH theory, APPROXIMATION algorithms, FIRST-order logic, MODEL theory

Single- and Multi-Depot Optimization for UAV-Based IoT Data Collection in Neighborhoods.

Autoři: Betti Sorbelli, Francesco Ghobadi, Sajjad Pinotti, Cristina M.

Zdroj: ACM Transactions on Sensor Networks; Jan2025, Vol. 21 Issue 1, p1-30, 30p

Témata: DRONE aircraft, APPROXIMATION algorithms, WIRELESS communications, BUDGET, INTERNET of things

Bounded satisfiability checking of FOL∗ formulas with aggregations.

Autoři: Feng, Nick Marsso, Lina Kholodetska, Yuliia a další

Zdroj: Formal Methods in System Design; Dec2025, Vol. 67 Issue 3, p282-315, 34p

Témata: SATISFIABILITY (Computer science), FIRST-order logic, CONSTRAINT programming, APPROXIMATION algorithms, DATA protection laws, DATA privacy, FORMAL methods (Computer science)

Toward a Better Understanding of Randomized Greedy Matching.

Autoři: ZHIHAO GAVIN TANG XIAOWEI WU YUHAO ZHANG

Zdroj: Journal of the ACM; Dec2023, Vol. 70 Issue 6, p1-32, 32p

Témata: BIPARTITE graphs, APPROXIMATION algorithms, GREEDY algorithms, POLYNOMIAL time algorithms, ONLINE algorithms, GRAPH theory

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.

Autoři: CRAMER, RONALD DUCAS, LÉO WESOLOWSKI, BENJAMIN

Zdroj: Journal of the ACM; Mar2021, Vol. 68 Issue 2, p1-26, 26p

Témata: OPTICAL lattices, POLYNOMIAL time algorithms, APPROXIMATION algorithms, POLYNOMIAL rings, CYCLOTOMIC fields, CURRICULUM, HARDNESS, ALGORITHMS

Posterior Sampling From Truncated Ferguson-Klass Representation of Normalised Completely Random Measure Mixtures.

Autoři: Zhang, Junyi Dassios, Angelos

Zdroj: Bayesian Analysis; Sep2025, Vol. 20 Issue 3, p795-825, 31p

Témata: RANDOM measures, NONPARAMETRIC statistics, APPROXIMATION algorithms, INFERENTIAL statistics, GIBBS sampling, ATOMS

Moment Bounds are Differentiable: Efficiently Approximating Measures in Inverse Rendering.

Autoři: Worchel, Markus Alexa, Marc

Zdroj: ACM Transactions on Graphics; Aug2025, Vol. 44 Issue 4, p1-21, 21p

Témata: RENDERING (Computer graphics), ATTENUATION of light, MATHEMATICAL optimization, OPACITY (Optics), APPROXIMATION algorithms, LIGHT scattering