Copertina

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Veldt, Nate, Stanley, Thomas, Priest, Benjamin W., Steil, Trevor, Iwabuchi, Keita, Jayram, T. S., Sanders, Geoffrey
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Discrete Mathematics Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
di: Veldt, Nate, et al.
Pubblicazione: (2026)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
di: Veldt, Nate
Pubblicazione: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
di: Crane, Alex, et al.
Pubblicazione: (2025)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
di: Bengali, Vedangi, et al.
Pubblicazione: (2024)

Approximation of Spanning Tree Congestion using Hereditary Bisection
di: Kolman, Petr
Pubblicazione: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
di: Wang, Chen, et al.
Pubblicazione: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
di: Huang, Yufan, et al.
Pubblicazione: (2023)

Polynomial Kernels for Spanning Tree with Diversity Requirements
di: Golovach, Petr A., et al.
Pubblicazione: (2026)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
di: Hanaka, Tesshu, et al.
Pubblicazione: (2023)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
di: Yang, Puhan, et al.
Pubblicazione: (2025)

Minimum Sum Set Cover: Structures and Algorithm
di: Zhang, Zhongyi, et al.
Pubblicazione: (2026)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

Approximation Algorithms for Optimal Hopsets
di: Dinitz, Michael, et al.
Pubblicazione: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
di: Mizutani, Ryuhei
Pubblicazione: (2025)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
di: Disser, Yann, et al.
Pubblicazione: (2024)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
di: Nanta, Jiratchaphat, et al.
Pubblicazione: (2025)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
di: Liang, Wei, et al.
Pubblicazione: (2024)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
di: Ingels, Florian
Pubblicazione: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
di: Foucaud, Florent, et al.
Pubblicazione: (2026)

The Planted Spanning Tree Problem
di: Moharrami, Mehrdad, et al.
Pubblicazione: (2025)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
di: Kita, Nanano
Pubblicazione: (2025)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
di: Davies, Sami, et al.
Pubblicazione: (2023)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
di: Abbasi, Ali, et al.
Pubblicazione: (2026)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
di: Shakeri, Heman, et al.
Pubblicazione: (2025)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
di: DeHaan, Ian, et al.
Pubblicazione: (2025)

Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
di: Chang, Yen-Hsiang, et al.
Pubblicazione: (2025)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
di: Chen, Yeyuan
Pubblicazione: (2024)

Stable Approximation Algorithms for Dominating Set and Independent Set
di: de Berg, Mark, et al.
Pubblicazione: (2024)

Hop-Constrained Metric Embeddings and their Applications
di: Filtser, Arnold
Pubblicazione: (2021)

Nearly Tight Bounds on Testing of Metric Properties
di: Bao, Yiqiao, et al.
Pubblicazione: (2024)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
di: Efthymiou, Charilaos, et al.
Pubblicazione: (2023)

Approximating Submodular Matroid-Constrained Partitioning
di: Bérczi, Kristóf, et al.
Pubblicazione: (2025)

(Approximate) Matrix Multiplication via Convolutions
di: Uffenheimer, Yahel, et al.
Pubblicazione: (2025)

An Approximate Generalization of the Okamura-Seymour Theorem
di: Kumar, Nikhil
Pubblicazione: (2022)

Approximate Realizations for Outerplanaric Degree Sequences
di: Bar-Noy, Amotz, et al.
Pubblicazione: (2024)

A Constant-Factor Approximation for Directed Latency
di: Blauth, Jannis, et al.
Pubblicazione: (2025)

Exponential Time Approximation for Coloring 3-Colorable Graphs
di: Guruswami, Venkatesan, et al.
Pubblicazione: (2024)

Approximation algorithms for non-sequential star packing problems
di: Hu, Mengyuan, et al.
Pubblicazione: (2024)

Approximately covering vertices by order-$5$ or longer paths
di: Gong, Mingyang, et al.
Pubblicazione: (2024)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
di: Mömke, Tobias, et al.
Pubblicazione: (2024)