scientific article; zbMATH DE number 7768369

DOI10.4230/LIPICS.APPROX/RANDOM.2021.24MaRDI QIDQ6090899zbMATH OpenFDO

Authors Chandra Chekuri, Kent Quanrud, Manuel Torres

Publication date 20 November 2023

Full work available at URL https://arxiv.org/abs/2011.03194

zbMATH Keywords

bounded degree spanning treecrossing spanning treefast approximation algorithmsswap rounding

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(5)

• Near-optimal bounded-degree spanning trees
• On approximating tree spanners that are breadth first search trees
• Fixed-Parameter Tractability for Non-Crossing Spanning Trees
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Subquadratic submodular maximization with a general matroid constraint

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090899)