{"id":"https://openalex.org/W2622491724","doi":"https://doi.org/10.5555/1283383.1283412","title":"Optimization problems in multiple-interval graphs","display_name":"Optimization problems in multiple-interval graphs","alternate_titles":[],"publication_year":2007,"publication_date":"2007-01-07","ids":{"openalex":"https://openalex.org/W2622491724","doi":"https://doi.org/10.5555/1283383.1283412","mag":"2622491724"},"language":"en","primary_location":{"id":"mag:2622491724","doi":"https://doi.org/10.5555/1283383.1283412","is_oa":false,"landing_page_url":"https://www.eng.biu.ac.il/~rawitzd/Papers/multiple.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2622491724"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5070120604","display_name":"Ayelet Butman","orcid":"https://orcid.org/0009-0007-5786-1986","observed_orcids":["https://orcid.org/0009-0007-5786-1986"]},"institutions":[{"id":"https://openalex.org/I157943965","display_name":"Holon Institute of Technology","ror":"https://ror.org/02prqh017","country_code":"IL","type":"education","lineage":["https://openalex.org/I157943965"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Ayelet Butman","raw_affiliation_strings":["Holon Institute of Technology Holon Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Holon Institute of Technology Holon Israel","institution_ids":["https://openalex.org/I157943965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052950579","display_name":"Danny Hermelin","orcid":"https://orcid.org/0000-0002-6379-0383","observed_orcids":["https://orcid.org/0000-0002-6379-0383"]},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Danny Hermelin","raw_affiliation_strings":["University of Haifa, Mount Carmel; Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-6379-0383","affiliations":[{"raw_affiliation_string":"University of Haifa, Mount Carmel; Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012404981","display_name":"Moshe Lewenstein","orcid":"https://orcid.org/0000-0002-8272-244X","observed_orcids":["https://orcid.org/0000-0002-8272-244X"]},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Moshe Lewenstein","raw_affiliation_strings":["Bar-Ilan University, Ramat\u00a0Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat\u00a0Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044026612","display_name":"Dror Rawitz","orcid":"https://orcid.org/0000-0003-0323-6097","observed_orcids":["https://orcid.org/0000-0003-0323-6097"]},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Dror Rawitz","raw_affiliation_strings":["University of Haifa, Mount Carmel; Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0003-0323-6097","affiliations":[{"raw_affiliation_string":"University of Haifa, Mount Carmel; Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3734,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95553975,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"277"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5268999934196472,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.5268999934196472,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.47119998931884766,"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/T12288","display_name":"Optimization and Search Problems","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interval-graphs","display_name":"interval graphs","score":0.8920000195503235},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.7870000004768372},{"id":"https://openalex.org/keywords/dominating-sets","display_name":"dominating sets","score":0.9340000152587891},{"id":"https://openalex.org/keywords/maximum-clique-problem","display_name":"maximum clique problem","score":0.9850000143051147},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9959999918937683},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9279999732971191},{"id":"https://openalex.org/keywords/transversal-number","display_name":"transversal number","score":0.9869999885559082},{"id":"https://openalex.org/keywords/bounded-degree-graphs","display_name":"bounded degree graphs","score":0.6570000052452087}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7443875074386597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7043915390968323},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.7008110284805298},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.6912788152694702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6538302898406982},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5886141061782837},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5600322484970093},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5586315393447876},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5537531971931458},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5417038798332214},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5303229689598083},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5184299945831299},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5157675743103027},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4603962302207947},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.44220080971717834},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4257509708404541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3319506049156189},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23091483116149902},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2622491724","doi":"https://doi.org/10.5555/1283383.1283412","is_oa":false,"landing_page_url":"https://www.eng.biu.ac.il/~rawitzd/Papers/multiple.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W112858196","https://openalex.org/W1488037301","https://openalex.org/W1550097844","https://openalex.org/W1572977974","https://openalex.org/W1579049696","https://openalex.org/W1758149641","https://openalex.org/W1971007914","https://openalex.org/W1977986589","https://openalex.org/W1983151348","https://openalex.org/W1994612875","https://openalex.org/W2003159902","https://openalex.org/W2003902046","https://openalex.org/W2011039300","https://openalex.org/W2013415302","https://openalex.org/W2026653490","https://openalex.org/W2028181262","https://openalex.org/W2028738060","https://openalex.org/W2031149390","https://openalex.org/W2031347356","https://openalex.org/W2036285035","https://openalex.org/W2038225707","https://openalex.org/W2039518074","https://openalex.org/W2043274817","https://openalex.org/W2044016543","https://openalex.org/W2049807202","https://openalex.org/W2051822734","https://openalex.org/W2053079614","https://openalex.org/W2063572899","https://openalex.org/W2063775175","https://openalex.org/W2064600658","https://openalex.org/W2071261821","https://openalex.org/W2076027639","https://openalex.org/W2077783414","https://openalex.org/W2085327320","https://openalex.org/W2088815036","https://openalex.org/W2094511120","https://openalex.org/W2103772568","https://openalex.org/W2110282707","https://openalex.org/W2112631288","https://openalex.org/W2143474538","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W77483341","https://openalex.org/W2045135589","https://openalex.org/W2112723368","https://openalex.org/W7099694669","https://openalex.org/W1968988491","https://openalex.org/W2079170078","https://openalex.org/W2041800134","https://openalex.org/W2989553650","https://openalex.org/W4302441754","https://openalex.org/W4410989535"],"abstract_inverted_index":{"Multiple-interval":[0],"graphs":[1,8,30,108,116],"are":[2,109],"a":[3,82,92,135,171],"natural":[4],"generalization":[5],"of":[6,25,51,75,149,165,186],"interval":[7,17],"where":[9],"each":[10,49,79,122],"vertex":[11,80],"may":[12],"have":[13],"more":[14,146],"then":[15,55,153],"one":[16,50],"associated":[18,77,120],"with":[19,78,117],"it.":[20],"We":[21,45,152],"initiate":[22],"the":[23,73,97,150,163,175,182],"study":[24],"optimization":[26],"problems":[27],"in":[28,81,114,127],"multiple-interval":[29,84,115],"by":[31],"considering":[32],"three":[33],"classical":[34],"problems:":[35],"MINIMUM":[36,39,87,139],"VERTEX":[37,88],"COVER,":[38,89],"DOMINATING":[40,140],"SET,":[41],"and":[42,54,169],"MAXIMUM":[43,158],"CLIQUE.":[44],"describe":[46],"applications":[47],"for":[48,61,101,138,162,174,181],"these":[52,107],"problems,":[53],"proceed":[56,154],"to":[57,111,121,145,155],"discuss":[58],"approximation":[59],"algorithms":[60],"them.":[62],"Our":[63],"results":[64],"can":[65],"be":[66,72,112],"summarized":[67],"as":[68],"follows:":[69],"Let":[70],"t":[71,118,166],"number":[74,185],"intervals":[76,119],"given":[83],"graph.":[85],"For":[86],"we":[90,133],"give":[91,134],"(2--1/t)-approximation":[93],"algorithm":[94,137,173],"which":[95,142],"equals":[96],"best":[98],"known":[99,110],"ratio":[100,125],"2t--1":[102],"bounded":[103],"degree":[104],"graphs.":[105],"Since":[106],"included":[113],"vertex,":[123],"this":[124],"is":[126,160],"some":[128],"sense":[129],"tight.":[130],"Following":[131],"this,":[132],"t2-approximation":[136],"SET":[141],"adapts":[143],"well":[144],"general":[147],"variants":[148],"problem.":[151],"prove":[156],"that":[157],"CLIQUE":[159],"NP-complete":[161],"case":[164],"=":[167],"3,":[168],"provide":[170],"(t2--t+1)/2-approximation":[172],"problem,":[176],"using":[177],"recent":[178],"bounds":[179],"proven":[180],"so-called":[183],"transversal":[184],"t-interval":[187],"families.":[188]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2622491724","counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2017-06-15T00:00:00"}
