{"id":"https://openalex.org/W2625762249","doi":null,"title":"Hierarchies for Constrained Partial Spanning Problems in Graphs","display_name":"Hierarchies for Constrained Partial Spanning Problems in Graphs","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2625762249","mag":"2625762249"},"language":"en","primary_location":{"id":"pmh:oai:HAL:inria-00306687v2","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00306687","pdf_url":"https://hal.inria.fr/inria-00306687v2/file/PI-1900-v2.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] PI-1900, 2008, pp.47","raw_type":"info:eu-repo/semantics/report"},"parent_works":[],"lineage":["https://openalex.org/W2625762249"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.inria.fr/inria-00306687v2/file/PI-1900-v2.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022454961","display_name":"Mikl\u00f3s Moln\u00e1r","orcid":"https://orcid.org/0000-0003-1345-4792","observed_orcids":["https://orcid.org/0000-0003-1345-4792"]},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Mikl\u00f3s Moln\u00e1r","raw_affiliation_strings":["Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires#TAB#","institution_ids":["https://openalex.org/I2802519937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022454961"],"corresponding_institution_ids":["https://openalex.org/I2802519937"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9463000297546387,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9463000297546387,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.0340999998152256,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/qos-constraints","display_name":"quality of service constraints","score":0.7670000195503235},{"id":"https://openalex.org/keywords/multicast-routing","display_name":"multicast routing","score":0.718999981880188},{"id":"https://openalex.org/keywords/wdm-networks","display_name":"WDM networks","score":0.7789999842643738},{"id":"https://openalex.org/keywords/optical-networks","display_name":"optical networks","score":0.7850000262260437},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.753000020980835},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.972000002861023}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7164912223815918},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6457076668739319},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5677964091300964},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.560158908367157},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49736955761909485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4910910129547119},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48402875661849976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4603021740913391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4448094666004181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33745530247688293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26609307527542114},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2651624083518982},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24216115474700928},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1597522795200348}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:inria-00306687v2","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00306687","pdf_url":"https://hal.inria.fr/inria-00306687v2/file/PI-1900-v2.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] PI-1900, 2008, pp.47","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:2625762249","doi":null,"is_oa":false,"landing_page_url":"https://hal.inria.fr/inria-00306687/document","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00306687v2","doi":null,"is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00306687","pdf_url":"https://hal.inria.fr/inria-00306687v2/file/PI-1900-v2.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] PI-1900, 2008, pp.47","raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2625762249.pdf","grobid_xml":"https://content.openalex.org/works/W2625762249.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W94711928","https://openalex.org/W1505489763","https://openalex.org/W1526298436","https://openalex.org/W1527852317","https://openalex.org/W1557391367","https://openalex.org/W1564927858","https://openalex.org/W1603421663","https://openalex.org/W1969197990","https://openalex.org/W1971968148","https://openalex.org/W1973470007","https://openalex.org/W2000881147","https://openalex.org/W2004308928","https://openalex.org/W2008499862","https://openalex.org/W2009196115","https://openalex.org/W2015139100","https://openalex.org/W2025533662","https://openalex.org/W2035841327","https://openalex.org/W2038129566","https://openalex.org/W2068277713","https://openalex.org/W2076500050","https://openalex.org/W2080156195","https://openalex.org/W2084876869","https://openalex.org/W2088842371","https://openalex.org/W2096774592","https://openalex.org/W2098862160","https://openalex.org/W2103992844","https://openalex.org/W2109954492","https://openalex.org/W2114119911","https://openalex.org/W2117962854","https://openalex.org/W2119775299","https://openalex.org/W2123073286","https://openalex.org/W2127240180","https://openalex.org/W2132087752","https://openalex.org/W2132941057","https://openalex.org/W2137877895","https://openalex.org/W2147971081","https://openalex.org/W2148836938","https://openalex.org/W2149362844","https://openalex.org/W2152950844","https://openalex.org/W2157459541","https://openalex.org/W2163097501","https://openalex.org/W2166418855","https://openalex.org/W2168456383","https://openalex.org/W2619357482","https://openalex.org/W3127447045","https://openalex.org/W4230940080","https://openalex.org/W4246633849","https://openalex.org/W7039671783","https://openalex.org/W7099489277"],"related_works":["https://openalex.org/W1143194816","https://openalex.org/W1973606291","https://openalex.org/W7095805091","https://openalex.org/W4403602656","https://openalex.org/W2505961683","https://openalex.org/W6980923190","https://openalex.org/W4404229846","https://openalex.org/W2556795721","https://openalex.org/W4385934874","https://openalex.org/W7098793194"],"abstract_inverted_index":{"The":[0],"problem":[1,15],"of":[2,44,79,108,121,156],"minimal":[3],"cost":[4],"partial":[5,46,58],"spanning":[6,32,47,59,66,80],"trees":[7],"is":[8,136,145,151],"well":[9],"known":[10],"as":[11],"the":[12,31,37,45,50,72,77,97,100,105,109,115,119,129,132,141,154,157],"NP-complete":[13],"Steiner":[14],"in":[16,30,84,111,125],"graphs.":[17],"If":[18],"there":[19],"are":[20,88,94,102,165],"constraints":[21,35,101],"to":[22,40,71,104],"respect":[23],"by":[24],"using":[25],"some":[26,160],"edges":[27],"and":[28],"nodes":[29,110,124],"structure":[33,52,144],"or":[34],"on":[36,162],"required":[38],"end":[39,41],"(QoS)":[42],"properties":[43],"structure,":[48],"then":[49],"optimal":[51,73,142],"can":[53],"be":[54],"different":[55],"from":[56],"a":[57,146],"tree.":[60],"This":[61],"paper":[62],"present":[63],"simple":[64],"hierarchical":[65],"structures":[67],"which":[68,87],"correspond":[69],"generally":[70],"solution.":[74],"To":[75],"illustrate":[76],"optimality":[78],"hierarchies,":[81],"two":[82],"problems":[83],"communication":[85],"networks,":[86],"very":[89],"usefull":[90],"for":[91],"multicast":[92,134],"routing,":[93],"analyzed.":[95,137],"In":[96,128,138],"first":[98],"problem,":[99],"related":[103],"physical":[106],"capacity":[107],"WDM":[112],"networks.":[113,127],"Namely,":[114],"analyzed":[116],"example":[117],"presents":[118],"case":[120],"sparse":[122],"splitter":[123],"optical":[126],"second":[130],"example,":[131],"multi-constrained":[133],"routing":[135,143],"both":[139],"cases,":[140],"hierarchy.":[147],"Since":[148],"its":[149],"computation":[150,158],"NP-complete,":[152],"after":[153],"presentation":[155],"difficulties":[159],"ideas":[161],"heuristic":[163],"algorithms":[164],"discussed.":[166]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2625762249","counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2017-06-23T00:00:00"}
