Improved approximation algorithms for the spanning star forest problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 44-58

  Chen, Ning ^a   Engelberg, Roee ^b   Nguyen, C Thach ^a   Raghavendra, Prasad ^a   Rudra, Atri ^a   Singh, Gyanit ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

NODE WEIGHTED GRAPHS; SPANNING STAR FORESTS; STAR GRAPH;

GRAPH THEORY;

EID: 38049039419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_4     Document Type: Conference Paper

References (10)

1. Agra, A., Cardoso, D., Cerfeira, O., Rocha, E.: A spanning star forest model for the diversity problem in automobile industry. In: ECCO XVIII, Minsk (May 2005)
2. Alon, N., Spencer, J.: The Probabilistic Method. John Wiley and Sons, Inc. New York, NY (1992)
3. Berry, V., Guillemot, S., Nicholas, F., Paul, C.: On the approximation of computing evolutionary trees. In: Proceedings of the Eleventh Annual International Computing and Combinatorics Conference, pp. 115-123 (2005)
4. Fiege, U.: A threshold of Inn for approximating set cover. Journal of the ACM 45(4), 634-652 (1998)
5. Goemans, M.X.: Mathematical programming and approximation algorithms. Lecture at Udine School, Udine, Italy (1996)
6. Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798-859 (2001)
7. Krauthgamer, R., Mehta, A., Rudra, A.: Pricing commodities, or how to sell when buyers have restricted valuations, (Manuscript, 2007)
8. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41(5), 960-981 (1994)
9. Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its applications to genomic sequence alignment. In: SODA, pp. 645-654 (2007)
10. Slavík, P.: A tight analysis of the greedy algorithm for set cover. In: STOC, pp. 435-441 (1996)