Search

Skip to main content Accessibility help

Home
Search

Only show content I have access to (0)

Articles (1)

Over 3 years (1)

From year:

To year:

Apply

Mathematics (1)

on-line algorithms.

RAIRO - Operations Research (1)

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

1 results

On-line models and algorithms for max independent set
Bruno Escoffier, Vangelis Th. Paschos
Journal:

RAIRO - Operations Research / Volume 40 / Issue 2 / April 2006

Published online by Cambridge University Press:

12 October 2006, pp. 129-142

Print publication:

April 2006
- Article
- - Get access
    
    Check if you have access via personal or institutional login
    
    Log in Register
- Export citation
In on-line computation, the instance of the problem dealt is notentirely known from the beginning of the solution process, but itis revealed step-by-step. In this paper we deal with on-lineindependent set. On-line models studied until now for this problemsuppose that the input graph is initially empty and revealedeither vertex-by-vertex, or cluster-by-cluster. Here we present anew on-line model quite different to the ones already studied. Itassumes that a superset of the final graph is initially present(in our case the complete graph on the order n of the finalgraph) and edges are progressively removed until the achievementof the final graph. Next, we revisit the model introduced in[Demange, Paradon and Paschos, Lect. Notes Comput. Sci.1963 (2000)326–334] and study relaxations assuming that somepaying backtracking is allowed.