An approximation algorithm for the minimum common supertree problem

Authors:
Atsuko Yamaguchi;Koji Nakano;Satoru Miyano
Affiliations:
Advanced Research Laboratory, Hitachi, Ltd., Hatoyama, Saitama 350-03, Japan;Nagoya Institute of Technology, Nagoya, 466, Japan;Human Genome Center, Institute of Medical Science, University of Tokyo, Tokyo, 108, Japan
Venue:
Nordic Journal of Computing
Year:
1997

Citing 11
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Efficient parallel algorithms

Efficient parallel algorithms
A greedy approximation algorithm for constructing shortest common superstrings

Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Constructing a maximal independent set in parallel

SIAM Journal on Discrete Mathematics
Approximation algorithms for the shortest common superstring problem

Information and Computation
Linear approximation of shortest superstrings

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Tree compatibility and inferring evolutionary history

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
finding Smallest Supertrees

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum common supertree problem is to find a minimum k-ary common supertree for a given set T of labeled complete k-ary trees. This problem is an NP-hard problem. This paper presents a polynomial-time approximation algorithm for solving this problem in O(n3 log n) time, where n is the total number of edges of trees in T. We prove that the algorithm constructs a common supertree that is at most 1 + 1/(2k - 2) times as large as the minimum one.