{"id":"https://openalex.org/W2082534785","doi":"https://doi.org/10.1051/ro:2006014","title":"On-line models and algorithms for max independent set","display_name":"On-line models and algorithms for max independent set","publication_year":2006,"publication_date":"2006-04-01","ids":{"openalex":"https://openalex.org/W2082534785","doi":"https://doi.org/10.1051/ro:2006014","mag":"2082534785"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2006014","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2006014","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020410268","display_name":"Bruno Escoffier","orcid":"https://orcid.org/0000-0002-6477-8706"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bruno Escoffier","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France; e-mail: {escoffier,paschos}@lamsade.dauphine.fr","e-mail: {escoffier,paschos}@lamsade.dauphine.fr","LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France; e-mail: {escoffier,paschos}@lamsade.dauphine.fr","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"e-mail: {escoffier,paschos}@lamsade.dauphine.fr","institution_ids":[]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France; e-mail: {escoffier,paschos}@lamsade.dauphine.fr","LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France","e-mail: {escoffier,paschos}@lamsade.dauphine.fr"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France; e-mail: {escoffier,paschos}@lamsade.dauphine.fr","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, 75775 Paris Cedex\u00a016, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"e-mail: {escoffier,paschos}@lamsade.dauphine.fr","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020410268"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.16466186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":"2","first_page":"129","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6095160245895386},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6085484027862549},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5871148109436035},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.57058185338974},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.539622962474823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4775272607803345},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45698219537734985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45591530203819275},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4302307963371277},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.41214147210121155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3766965866088867}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6095160245895386},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6085484027862549},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5871148109436035},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.57058185338974},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.539622962474823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4775272607803345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45698219537734985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45591530203819275},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4302307963371277},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.41214147210121155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3766965866088867},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:2006014","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2006014","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2006__40_2_129_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro:2006014/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W352189590","https://openalex.org/W1530753374","https://openalex.org/W1972228828","https://openalex.org/W1990313671","https://openalex.org/W2017052164","https://openalex.org/W2050272710","https://openalex.org/W2094683677","https://openalex.org/W2113529358","https://openalex.org/W2164654851"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2362020254","https://openalex.org/W4390436776","https://openalex.org/W3016558738","https://openalex.org/W2801245139","https://openalex.org/W33910237","https://openalex.org/W1637557868","https://openalex.org/W2082534785"],"abstract_inverted_index":{"In":[0,25],"on-line":[1,31,61],"computation,":[2],"the":[3,6,14,17,44,66,76,85,89,93,102,105,111],"instance":[4],"of":[5,16,75,92,104],"problem":[7,41],"dealt":[8],"is":[9,22,47,79,134],"not":[10],"entirely":[11],"known":[12],"from":[13],"beginning":[15],"solution":[18],"process,":[19],"but":[20],"it":[21],"revealed":[23,51],"step-by-step.":[24],"this":[26,40],"paper":[27],"we":[28,57,109],"deal":[29],"with":[30],"independent":[32],"set.":[33],"On-line":[34],"models":[35],"studied":[36],"until":[37,101],"now":[38],"for":[39],"suppose":[42],"that":[43,72,130],"input":[45],"graph":[46,78,87],"initially":[48,80],"empty":[49],"and":[50,96,117,126],"either":[52],"vertex-by-vertex,":[53],"or":[54],"cluster-by-cluster.":[55],"Here":[56],"present":[58,81],"a":[59,73],"new":[60],"model":[62,112],"quite":[63],"different":[64],"to":[65],"ones":[67],"already":[68],"studied.":[69],"It":[70],"assumes":[71],"superset":[74],"final":[77,94,106],"(in":[82],"our":[83],"case":[84],"complete":[86],"on":[88],"order":[90],"n":[91],"graph)":[95],"edges":[97],"are":[98],"progressively":[99],"removed":[100],"achievement":[103],"graph.":[107],"Next,":[108],"revisit":[110],"introduced":[113],"in":[114],"[Demange,":[115],"Paradon":[116],"Paschos,":[118],"Lect.":[119],"Notes":[120],"Comput.":[121],"Sci.":[122],"1963":[123],"(2000)":[124],"326\u2013334]":[125],"study":[127],"relaxations":[128],"assuming":[129],"some":[131],"paying":[132],"backtracking":[133],"allowed.":[135]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}