Skip to main content
SpringerLink
Log in

Improved Approximations for Weighted and Unweighted Graph Problems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We obtain improved approximation ratios for problems of a broad class called weighted hereditary induced-subgraph maximization problems, in particular for the maximum independent set, maximum clique and maximum ℓ-colorable induced subgraph, as well as for the minimum coloring problem. We also study the minimum chromatic sum and show that its weighted version polynomially reduces to the weighted independent set problem in such a way that approximation ratios are preserved (up to a multiplicative constant).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Decision and Information Sciences, ESSEC, France

    Marc Demange

  2. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France

    Vangelis Paschos

Authors
  1. Marc Demange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vangelis Paschos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Marc Demange or Vangelis Paschos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demange, M., Paschos, V. Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput Syst 38, 763–787 (2005). https://doi.org/10.1007/s00224-004-1162-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1162-6

Keywords

Search

Navigation