Optimizing misdirection

Piotr Berman, Piotr Krysta

    Research output: Contribution to conferencePaperpeer-review

    7 Scopus citations

    Abstract

    In this paper we consider the following problem. Given a (d + 1)-claw free graph G = (V, E, w) where w: V → R+, maximize w(A) where A is an independent set in G. Our focus is to minimize the approximation ratio (optimum/obtained) in polynomial time that does not depend on d. Our approach is to apply local improvements of size 2, using a "misdirected" criterion, i.e. wα(A) rather than w(A). We find the optimal value of α for every d, and the resulting ratio is roughly 0.667d for d = 3, 0.651d for d = 4 and 0.646d for d > 4.

    Original languageEnglish (US)
    Pages192-201
    Number of pages10
    StatePublished - Jan 1 2003
    EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
    Duration: Nov 2 1998Nov 3 1998

    Other

    OtherConfiguralble Computing: Technology and Applications
    CountryUnited States
    CityBoston, MA
    Period11/2/9811/3/98

    All Science Journal Classification (ASJC) codes

    • Software
    • Mathematics(all)

    Fingerprint Dive into the research topics of 'Optimizing misdirection'. Together they form a unique fingerprint.

    Cite this