Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs

Vineet Bafna, Piotr Berman, Toshihiro Fujito

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    38 Citations (Scopus)

    Abstract

    We consider the weighted feedback vertex set problem for undirected graphs. It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases. We further elaborate our approach to treat the case when graphs are of bounded degree, and show that it achieves even better performance, (formula presented), where ∆ is the maximum degree of graphs.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings
    EditorsAlistair Moffat, John Staples, Naoki Katoh, Peter Eades
    PublisherSpringer Verlag
    Pages142-151
    Number of pages10
    ISBN (Print)3540605738, 9783540605737
    StatePublished - Jan 1 1995
    Event6th International Symposium on Algorithms and Computations, ISAAC 1995 - Cairns, Australia
    Duration: Dec 4 1995Dec 6 1995

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1004
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other6th International Symposium on Algorithms and Computations, ISAAC 1995
    CountryAustralia
    CityCairns
    Period12/4/9512/6/95

    Fingerprint

    Feedback Vertex Set
    Undirected Graph
    Feedback
    Performance Guarantee
    Approximation
    Graph in graph theory
    Maximum Degree
    Strategy

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Bafna, V., Berman, P., & Fujito, T. (1995). Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In A. Moffat, J. Staples, N. Katoh, & P. Eades (Eds.), Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings (pp. 142-151). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1004). Springer Verlag.
    Bafna, Vineet ; Berman, Piotr ; Fujito, Toshihiro. / Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. editor / Alistair Moffat ; John Staples ; Naoki Katoh ; Peter Eades. Springer Verlag, 1995. pp. 142-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{c2e6b2154b184076a33b9b211ef7a7d6,
    title = "Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs",
    abstract = "We consider the weighted feedback vertex set problem for undirected graphs. It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases. We further elaborate our approach to treat the case when graphs are of bounded degree, and show that it achieves even better performance, (formula presented), where ∆ is the maximum degree of graphs.",
    author = "Vineet Bafna and Piotr Berman and Toshihiro Fujito",
    year = "1995",
    month = "1",
    day = "1",
    language = "English (US)",
    isbn = "3540605738",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "142--151",
    editor = "Alistair Moffat and John Staples and Naoki Katoh and Peter Eades",
    booktitle = "Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings",
    address = "Germany",

    }

    Bafna, V, Berman, P & Fujito, T 1995, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. in A Moffat, J Staples, N Katoh & P Eades (eds), Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1004, Springer Verlag, pp. 142-151, 6th International Symposium on Algorithms and Computations, ISAAC 1995, Cairns, Australia, 12/4/95.

    Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. / Bafna, Vineet; Berman, Piotr; Fujito, Toshihiro.

    Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. ed. / Alistair Moffat; John Staples; Naoki Katoh; Peter Eades. Springer Verlag, 1995. p. 142-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1004).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs

    AU - Bafna, Vineet

    AU - Berman, Piotr

    AU - Fujito, Toshihiro

    PY - 1995/1/1

    Y1 - 1995/1/1

    N2 - We consider the weighted feedback vertex set problem for undirected graphs. It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases. We further elaborate our approach to treat the case when graphs are of bounded degree, and show that it achieves even better performance, (formula presented), where ∆ is the maximum degree of graphs.

    AB - We consider the weighted feedback vertex set problem for undirected graphs. It is shown that a generalized local ratio strategy leads to an efficient approximation with the performance guarantee of twice the optimal, improving the previous results for both weighted and unweighted cases. We further elaborate our approach to treat the case when graphs are of bounded degree, and show that it achieves even better performance, (formula presented), where ∆ is the maximum degree of graphs.

    UR - http://www.scopus.com/inward/record.url?scp=84955602886&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84955602886&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:84955602886

    SN - 3540605738

    SN - 9783540605737

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

    SP - 142

    EP - 151

    BT - Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings

    A2 - Moffat, Alistair

    A2 - Staples, John

    A2 - Katoh, Naoki

    A2 - Eades, Peter

    PB - Springer Verlag

    ER -

    Bafna V, Berman P, Fujito T. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In Moffat A, Staples J, Katoh N, Eades P, editors, Algorithms and Computations - 6th International Symposium, ISAAC 1995, Proceedings. Springer Verlag. 1995. p. 142-151. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).