Presentation 1994/10/21
An Approximation Algorithm for Alphabet Indexing Problem
Shinichi Somozono,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Alphabet Indexing is the problem to find a mapping f:Σ→{1,...,K }for alphabet Σ,positive integer K and a pair of disjoint sets of strings P,Q ⊆ Σ^* such that f transforms no two strings from P an d Q into identical ones.Although Alphabet Indexing problem is NP- complete,we define a conibinatorial optimization problem,Max K- Indexing,and propose a simple greedy algorithm for this problem. Then we show that the algorithm achieves the constant error ratio 1, K for K-indexing with respect to the number of distinguishable pairs and our problem is MAX SNP-hard.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) alphabet indexing / approximation algorithm / MAX-SNP / combinatorial optimization
Paper # COMP94-52
Date of Issue

Conference Information
Committee COMP
Conference Date 1994/10/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Approximation Algorithm for Alphabet Indexing Problem
Sub Title (in English)
Keyword(1) alphabet indexing
Keyword(2) approximation algorithm
Keyword(3) MAX-SNP
Keyword(4) combinatorial optimization
1st Author's Name Shinichi Somozono
1st Author's Affiliation Department of Control Engineering,Faculty of Computer Science and Systems Engineering,Kyushu Institute of Technology()
Date 1994/10/21
Paper # COMP94-52
Volume (vol) vol.94
Number (no) 304
Page pp.pp.-
#Pages 9
Date of Issue