Image de couverture de livre

Planar Length-Constrained Minimum Spanning Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hershkowitz, D Ellis, Huang, Richard Z
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Simple Length-Constrained Minimum Spanning Trees
par: Hershkowitz, D Ellis, et autres
Publié: (2024)

New Structures and Algorithms for Length-Constrained Expander Decompositions
par: Haeupler, Bernhard, et autres
Publié: (2024)

Simple Length-Constrained Expander Decompositions
par: Bodwin, Greg, et autres
Publié: (2025)

Ghost Value Augmentation for $k$-Edge-Connectivity
par: Hershkowitz, D Ellis, et autres
Publié: (2023)

The Steiner Path Aggregation Problem
par: Chen, Da Qi, et autres
Publié: (2025)

Improved Parallel Algorithms for EF1 Allocations
par: Gowda, Kishen N, et autres
Publié: (2026)

Stochastic Minimum Spanning Trees with a Single Sample
par: Hoeksma, Ruben, et autres
Publié: (2024)

Low-Step Multi-Commodity Flow Emulators
par: Haeupler, Bernhard, et autres
Publié: (2024)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
par: Azarmehr, Amir, et autres
Publié: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
par: Hladík, Richard, et autres
Publié: (2024)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

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

Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
par: Bhattacharya, Sayan, et autres
Publié: (2026)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Efficient Centroid-Linkage Clustering
par: Bateni, MohammadHossein, et autres
Publié: (2024)

Edge-Minimum Walk of Modular Length in Polynomial Time
par: Amarilli, Antoine, et autres
Publié: (2024)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
par: Haeupler, Bernhard, et autres
Publié: (2025)

Faster Private Minimum Spanning Trees
par: Pagh, Rasmus, et autres
Publié: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
par: Liu, Yang P., et autres
Publié: (2025)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
par: You, Fangchen
Publié: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
par: Almansoori, Mahmood K. M., et autres
Publié: (2025)

Online Disjoint Spanning Trees and Polymatroid Bases
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

Budget and Profit Approximations for Spanning Tree Interdiction
par: Ostrovsky, Rafail, et autres
Publié: (2025)

Two Complexity Results on Spanning-Tree Congestion Problems
par: Atalig, Sunny, et autres
Publié: (2026)

Enumerating All Directed Spanning Trees in Optimal Time
par: Gawrychowski, Paweł, et autres
Publié: (2026)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
par: Veldt, Nate, et autres
Publié: (2025)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
par: Pagh, Rasmus, et autres
Publié: (2024)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
par: Shen, Fangjian, et autres
Publié: (2025)

Thin Trees for Near Minimum Cuts
par: Klein, Nathan, et autres
Publié: (2026)

Finding Spanning Trees with Perfect Matchings
par: Bérczi, Kristóf, et autres
Publié: (2024)

Parameterized Complexity of Simultaneous Planarity
par: Fink, Simon D., et autres
Publié: (2023)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Paths and Intersections: Exact Emulators for Planar Graphs
par: Li, George Z., et autres
Publié: (2025)

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

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
par: Ito, Takehiro, et autres
Publié: (2025)

Approximate Light Spanners in Planar Graphs
par: Le, Hung, et autres
Publié: (2025)