IDEAS home Printed from https://ideas.repec.org/p/mse/wpsorb/v06034.html
   My bibliography  Save this paper

On-line computation and maximum-weighted hereditary subgraph problems

Author

Listed:

Abstract

In this paper, we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance-graph (which has n vertices) is revealed in t clusters, 2 £ t £ n. We first focus on the on-line version of the following problem: finding a maximum-weighted subgraph satisfying some hereditary property. Then, we deal with the particular case of the independent set. For all these problems, we are interested in two types of results: the competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problems and for the quality of algorithms developed to solve them

Suggested Citation

  • Marc Demange & Bernard Kouakou & Eric Soutif, 2006. "On-line computation and maximum-weighted hereditary subgraph problems," Cahiers de la Maison des Sciences Economiques v06034, Université Panthéon-Sorbonne (Paris 1).
    • Handle: RePEc:mse:wpsorb:v06034
    DOI: 10.1007/11602613_44
    as

    Download full text from publisher

    File URL: https://hal.archives-ouvertes.fr/halshs-00115615
    Download Restriction: no
    File URL: https://doi.org/10.1007/11602613_44
    Download Restriction: no
    File URL: https://libkey.io/10.1007/11602613_44?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mse:wpsorb:v06034. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/msep1fr.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.