IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-3023-4_4.html

Feedback Set Problems

In: Handbook of Combinatorial Optimization

Author

Listed:
  • 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)

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.

Suggested Citation

  • Paola Festa & Panos M. Pardalos & Mauricio G. C. Resende, 1999. "Feedback Set Problems," Springer Books, in: Ding-Zhu Du & Panos M. Pardalos (ed.), Handbook of Combinatorial Optimization, pages 209-258, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4757-3023-4_4
    DOI: 10.1007/978-1-4757-3023-4_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Haining Jiang, 2020. "Target Set Selection on generalized pancake graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(2), pages 379-389, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4757-3023-4_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.