{"id":"https://openalex.org/W2054319357","doi":"https://doi.org/10.1007/s00453-011-9531-4","title":"Minimize the Maximum Duty in Multi-interface Networks","display_name":"Minimize the Maximum Duty in Multi-interface Networks","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2054319357","doi":"https://doi.org/10.1007/s00453-011-9531-4","mag":"2054319357"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-011-9531-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9531-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00643961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050291532","display_name":"Gianlorenzo D\u2019Angelo","orcid":"https://orcid.org/0000-0003-0377-7037"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT","IT"],"is_corresponding":true,"raw_author_name":"Gianlorenzo D\u2019Angelo","raw_affiliation_strings":["Department of Electrical and Information Engineering, University of L\u2019Aquila, Via Gronchi 18, 67100, L\u2019Aquila, Italy","Algorithms, simulation, combinatorics and optimization for telecommunications","University of L'Aquila [Italy]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Engineering, University of L\u2019Aquila, Via Gronchi 18, 67100, L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"Algorithms, simulation, combinatorics and optimization for telecommunications","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"University of L'Aquila [Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029633057","display_name":"Gabriele Di Stefano","orcid":"https://orcid.org/0000-0003-4521-8356"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gabriele Di Stefano","raw_affiliation_strings":["Department of Electrical and Information Engineering, University of L\u2019Aquila, Via Gronchi 18, 67100, L\u2019Aquila, Italy","University of L'Aquila [Italy]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Information Engineering, University of L\u2019Aquila, Via Gronchi 18, 67100, L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"University of L'Aquila [Italy]","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023681870","display_name":"Alfredo Navarra","orcid":"https://orcid.org/0000-0001-8547-5934"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alfredo Navarra","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy","Dipartimento di Matematica e Informatica [Perugia]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli 1, 06123, Perugia, Italy","institution_ids":["https://openalex.org/I27483092"]},{"raw_affiliation_string":"Dipartimento di Matematica e Informatica [Perugia]","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050291532"],"corresponding_institution_ids":["https://openalex.org/I26415053","https://openalex.org/I4210099593"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0733,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.78722222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"63","issue":"1-2","first_page":"274","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6140233874320984},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5555465817451477},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5395772457122803},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5113005638122559},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48561158776283264},{"id":"https://openalex.org/keywords/interface","display_name":"Interface (matter)","score":0.47959744930267334},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44611552357673645},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4426579177379608},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.43373364210128784},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41913357377052307},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4105709493160248},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3946886658668518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3027108907699585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27893301844596863},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.2620124816894531},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23051604628562927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21418362855911255}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6140233874320984},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5555465817451477},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5395772457122803},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5113005638122559},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48561158776283264},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.47959744930267334},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44611552357673645},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4426579177379608},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.43373364210128784},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41913357377052307},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4105709493160248},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3946886658668518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3027108907699585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27893301844596863},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2620124816894531},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23051604628562927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21418362855911255},{"id":"https://openalex.org/C129307140","wikidata":"https://www.wikidata.org/wiki/Q6795880","display_name":"Maximum bubble pressure method","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C157915830","wikidata":"https://www.wikidata.org/wiki/Q2928001","display_name":"Bubble","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-011-9531-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-011-9531-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.1198","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.1198","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/hal-00643961/PDF/Min-Max-coverage.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.5161","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.5161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/hal-00643961/PDF/Min-Max-coverage.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00643961v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00643961","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Algorithmica, 2012, 63 (1-2), pp.274-295. &#x27E8;10.1007/s00453-011-9531-4&#x27E9;","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00643961v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00643961","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Algorithmica, 2012, 63 (1-2), pp.274-295. &#x27E8;10.1007/s00453-011-9531-4&#x27E9;","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W272002020","https://openalex.org/W1499703819","https://openalex.org/W1522862982","https://openalex.org/W1523298838","https://openalex.org/W1528291559","https://openalex.org/W1587208437","https://openalex.org/W1887678061","https://openalex.org/W1980248515","https://openalex.org/W1994851315","https://openalex.org/W2011039300","https://openalex.org/W2022783258","https://openalex.org/W2035019112","https://openalex.org/W2039323379","https://openalex.org/W2040924621","https://openalex.org/W2051825184","https://openalex.org/W2059372025","https://openalex.org/W2061591914","https://openalex.org/W2079522169","https://openalex.org/W2094826544","https://openalex.org/W2101771805","https://openalex.org/W2119044526","https://openalex.org/W2126479983","https://openalex.org/W2134711218","https://openalex.org/W2170192755","https://openalex.org/W2476096155","https://openalex.org/W4245779040","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3184131894","https://openalex.org/W1490764355","https://openalex.org/W2513388465","https://openalex.org/W2329407138","https://openalex.org/W885288402","https://openalex.org/W2028885955","https://openalex.org/W1733367267","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2007607373"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}
