Feedback Set Problems

Paola Festa (), Panos M. Pardalos () and Mauricio G. C. Resende ()
Additional contact information
Paola Festa: University of Salerno, Mathematics and Computer Science Department
Panos M. Pardalos: University of Florida, Center for Applied Optimization Department of Industrial and Systems Engineering
Mauricio G. C. Resende: Shannon Laboratory, Information Sciences Research Center AT & T Labs Research

A chapter in Handbook of Combinatorial Optimization, 1999, pp 209-258 from Springer

Abstract: Abstract Not long ago, there appeared to be a consensus in the literature that feedback set problems, which originated from the area of combinational circuit design, were the least understood among all the classical combinatorial optimization problems due to the lack of positive results in efficient exact and approximating algorithms. This picture has been totally changed in recent years. Dramatic progress has occurred in developing approximation algorithms with provable performance; new bounds have been established one after the other and it is probably fair to say that feedback set problems are becoming among the most exciting frontend problems in combinatorial optimization.

Keywords: Approximation Algorithm; Greedy Randomize Adaptive Search Procedure; Interval Graph; Permutation Graph; Deadlock Prevention (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().