A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Authors:
Sung-Pil Hong;Sung-Jin Chung;Bum Hwan Park
Affiliations:
School of Business, Chung-Ang University, An-song-shi, South Korea;Department of Industrial Engineering, Seoul National University, Seoul, South Korea;Department of Industrial Engineering, Seoul National University, Seoul, South Korea
Venue:
Operations Research Letters
Year:
2004

Citing 10
Cited 12

Exact arborescences, matchings and cycles

Discrete Applied Mathematics
Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Counting minimum weight spanning trees

Journal of Algorithms
Bicriteria network design problems

Journal of Algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Determinant: Old Algorithms, New Insights

SIAM Journal on Discrete Mathematics
Approximation algorithms for multi-parameter graph optimization problems

Discrete Applied Mathematics
The Constrained Minimum Spanning Tree Problem (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

The subdivision-constrained minimum spanning tree problem

Theoretical Computer Science
A Survey on Multiple Objective Minimum Spanning Tree Problems

Algorithmics of Large and Complex Networks
The minimum risk spanning tree problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Budgeted matching and budgeted matroid intersection via the gasoline puzzle

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
On the weight-constrained minimum spanning tree problem

INOC'11 Proceedings of the 5th international conference on Network optimization
Exact algorithms for OWA-optimization in multiobjective spanning tree problems

Computers and Operations Research
Approximating min-max (regret) versions of some polynomial problems

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Multicriteria global minimum cuts

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems

Discrete Optimization
Fair solutions for some multiagent optimization problems

Autonomous Agents and Multi-Agent Systems
Single approximation for the biobjective Max TSP

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then utilized to yield a fully polynomial approximation scheme.