Imagen de Portada

Simple Length-Constrained Minimum Spanning Trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hershkowitz, D Ellis, Huang, Richard Z
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Planar Length-Constrained Minimum Spanning Trees
por: Hershkowitz, D Ellis, et al.
Publicado: (2025)

Simple Length-Constrained Expander Decompositions
por: Bodwin, Greg, et al.
Publicado: (2025)

New Structures and Algorithms for Length-Constrained Expander Decompositions
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Ghost Value Augmentation for $k$-Edge-Connectivity
por: Hershkowitz, D Ellis, et al.
Publicado: (2023)

The Steiner Path Aggregation Problem
por: Chen, Da Qi, et al.
Publicado: (2025)

Improved Parallel Algorithms for EF1 Allocations
por: Gowda, Kishen N, et al.
Publicado: (2026)

Stochastic Minimum Spanning Trees with a Single Sample
por: Hoeksma, Ruben, et al.
Publicado: (2024)

Low-Step Multi-Commodity Flow Emulators
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
por: Azarmehr, Amir, et al.
Publicado: (2024)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
por: Peng, Pan, et al.
Publicado: (2026)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
por: Ding, Xiangyun, et al.
Publicado: (2025)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
por: Goldenfeld, Michael Elkin Tanya
Publicado: (2026)

Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
por: Bhattacharya, Sayan, et al.
Publicado: (2026)

Efficient Centroid-Linkage Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)

Edge-Minimum Walk of Modular Length in Polynomial Time
por: Amarilli, Antoine, et al.
Publicado: (2024)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
por: Liu, Yang P., et al.
Publicado: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
por: Almansoori, Mahmood K. M., et al.
Publicado: (2025)

Online Disjoint Spanning Trees and Polymatroid Bases
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Spanning and Metric Tree Covers Parameterized by Treewidth
por: Elkin, Michael, et al.
Publicado: (2025)

Budget and Profit Approximations for Spanning Tree Interdiction
por: Ostrovsky, Rafail, et al.
Publicado: (2025)

Two Complexity Results on Spanning-Tree Congestion Problems
por: Atalig, Sunny, et al.
Publicado: (2026)

Enumerating All Directed Spanning Trees in Optimal Time
por: Gawrychowski, Paweł, et al.
Publicado: (2026)

A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
por: Lettich, Richard
Publicado: (2024)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
por: Veldt, Nate, et al.
Publicado: (2025)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
por: Chang, Yi-Jun, et al.
Publicado: (2026)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
por: Shen, Fangjian, et al.
Publicado: (2025)

Thin Trees for Near Minimum Cuts
por: Klein, Nathan, et al.
Publicado: (2026)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

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

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
por: Çivril, Ali
Publicado: (2023)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
por: Ito, Takehiro, et al.
Publicado: (2025)

Cactus Representation of Minimum Cuts: Derandomize and Speed up
por: He, Zhongtian, et al.
Publicado: (2024)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2025)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
por: Bai, Yuhang, et al.
Publicado: (2026)

Spanning tree congestion of proper interval graphs
por: Otachi, Yota
Publicado: (2026)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
por: Staus, Luca Pascal, et al.
Publicado: (2024)