# Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems

@article{Arora2004ApproximationSF, title={Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems}, author={Sanjeev Arora and Kevin L. Chang}, journal={Algorithmica}, year={2004}, volume={40}, pages={189-210} }

Abstract
We develop a quasi-polynomial time approximation scheme for the Euclidean version of the
Degree-Restricted MST Problem by adapting techniques used previously by Arora for approximating TSP.
Given n points in the plane, d = 3 or 4, and ε > 0, the scheme finds an approximation with cost within 1 + ε
of the lowest cost spanning tree with the property that all nodes have degree at most d.
We also develop a polynomial time approximation scheme for the Euclidean version of the Red–Blue… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 16 CITATIONS

## The Euclidean degree-4 minimum spanning tree problem is NP-hard

VIEW 3 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## Approximation schemes for geometric problems

VIEW 6 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Optimal Solutions for a Geometric Knapsack Problem using Integer Programming

VIEW 1 EXCERPT

CITES METHODS

## Plane Bichromatic Trees of Low Degree

VIEW 1 EXCERPT

CITES BACKGROUND

## The Shortest Separating Cycle Problem

VIEW 1 EXCERPT

CITES BACKGROUND

## Maintaining Connectivity in Sensor Networks Using Directional Antennae

VIEW 1 EXCERPT

CITES BACKGROUND

## Polynomial area bounds for MST embeddings of trees

VIEW 1 EXCERPT

## A quasi-polynomial time approximation scheme for minimum weight triangulation

VIEW 2 EXCERPTS

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 13 REFERENCES

## Guillotine subdivisions approximate polygonal subdivisions: a simple PTAS for geometric k-MST, TSP, and related problems

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Euclidean bounded-degree spanning tree ratios

VIEW 1 EXCERPT

## Approximation schemes for minimum latency problems

VIEW 1 EXCERPT