Approximation schemes for degree-restricted MST and red-blue separation problems

DOI10.1007/S00453-004-1103-4zbMATH Open1082.68125OpenAlexW2116680937MaRDI QIDQ1762989FDOQ1762989

Authors: Kevin Chang, Sanjeev Arora 

Publication date: 11 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1103-4

Recommendations

• scientific article; zbMATH DE number 2038709
• Degree-bounded minimum spanning trees
• Minimum bottleneck spanning trees with degree bounds
• A Push-Relabel Algorithm for Approximating Degree Bounded MSTs
• Low-Degree Spanning Trees of Small Weight

zbMATH Keywords

Approximation algorithmLow degreeDegree-Restricted Minimum Spanning Tree

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Cited In (12)

• Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
• The shortest separating cycle problem
• Polynomial area bounds for MST embeddings of trees
• Degree-bounded minimum spanning trees
• Planar bichromatic minimum spanning trees
• Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
• Cooperative TSP
• Delineating boundaries for imprecise regions
• Planar Bichromatic Bottleneck Spanning Trees
• Approximation schemes for node-weighted geometric Steiner tree problems
• On approximability of optimization problems related to red/blue-split graphs
• Title not available (Why is that?)

This page was built for publication: Approximation schemes for degree-restricted MST and red-blue separation problems

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