Skip to main content
SpringerLink
Log in

On-Line Maximum-Order Induced Hereditary Subgraph Problems

  • Conference paper
  • First Online:
SOFSEM 2000: Theory and Practice of Informatics (SOFSEM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1963))

Abstract

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boppana, B. B., Halldórsson, M. M.: Approximating maximum independent sets by excluding subgraphs. BIT 32(2) (1992) 180–196. 331, 332

    Article  MATH  MathSciNet  Google Scholar 

  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. 332

    Google Scholar 

  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, 332

    Google Scholar 

  4. Halldórsson, M. M.: Approximations via partitioning. JAIST Research Report ISRR-95-0003F (1995) Japan Advanced Institute of Science and Technology, Japan. 329

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CERMSEM, Université Paris I, Maison des Sciences Economiques, 106-112 boulevard de l’Hôpital, 75647, Paris Cedex 13, France

    Marc Demange

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

    Xavier Paradon & Vangelis Th. Paschos

Authors
  1. Marc Demange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xavier Paradon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vangelis Th. Paschos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Cybernetics, Czech Technical University, Karlovo nám. 13, 121 35, Prague, Czech Republic

    Václav Hlaváč

  2. Information Technology Department, CLRC RAL, Chilton, Didcot, Oxfordshire, UK

    Keith G. Jeffery

  3. Insitute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 2, 182 07, Prague, Czech Republic

    Jiří Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demange, M., Paradon, X., Paschos, V.T. (2000). On-Line Maximum-Order Induced Hereditary Subgraph Problems. In: Hlaváč, V., Jeffery, K.G., Wiedermann, J. (eds) SOFSEM 2000: Theory and Practice of Informatics. SOFSEM 2000. Lecture Notes in Computer Science, vol 1963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44411-4_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44411-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41348-6

  • Online ISBN: 978-3-540-44411-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation