On-Line Maximum-Order Induced Hereditary Subgraph Problems

  • Marc Demange
  • Xavier Paradon
  • Vangelis Th. Paschos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1963)


We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters. Then, we focus ourselves on two of the most known instantiations of this problem, the maximum independent set and the maximum clique.


Approximation Ratio Competitivity Ratio Maximum Clique Maximum Clique Problem Hereditary Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boppana, B. B., Halldórsson, M. M.: Approximating maximum independent sets by excluding subgraphs. BIT 32(2) (1992) 180–196. 331, 332zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Demange, M., Paschos, V. Th.: Maximum-weight independent set is as “wellapproximated” as the unweighted one. Technical Report 163 (1999) LAMSADE, Université Paris-Dauphine. 332Google Scholar
  3. 3.
    Demange, M., Paradon, X., Paschos, V. Th.: On-line maximum-order induced hereditary subgraph problems. Research Note 25 (2000) LAMSADE, Université Paris-Dauphine. 328, 329, 331, 332Google Scholar
  4. 4.
    Halldórsson, M. M.: Approximations via partitioning. JAIST Research Report ISRR-95-0003F (1995) Japan Advanced Institute of Science and Technology, Japan. 329Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Marc Demange
    • 1
  • Xavier Paradon
    • 2
  • Vangelis Th. Paschos
    • 2
  1. 1.CERMSEMUniversité Paris IParis Cedex 13France
  2. 2.LAMSADEUniversité Paris-DauphineParis Cedex 16France

Personalised recommendations