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

    43 Scopus citations

    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
    EditorsJohn Staples, Peter Eades, Naoki Katoh, Alistair Moffat
    PublisherSpringer Verlag
    Pages142-151
    Number of pages10
    ISBN (Print)3540605738, 9783540605737
    DOIs
    StatePublished - 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
    Country/TerritoryAustralia
    CityCairns
    Period12/4/9512/6/95

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs'. Together they form a unique fingerprint.

    Cite this