{"id":"https://openalex.org/W2126626094","doi":"https://doi.org/10.1109/hicss.2003.1174186","title":"A hop constrained min-sum arborescence with outage costs","display_name":"A hop constrained min-sum arborescence with outage costs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2126626094","doi":"https://doi.org/10.1109/hicss.2003.1174186","mag":"2126626094"},"language":"en","primary_location":{"id":"doi:10.1109/hicss.2003.1174186","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hicss.2003.1174186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the","raw_type":"proceedings-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/A5088438315","display_name":"Rakesh Kawatra","orcid":"https://orcid.org/0000-0001-8933-4493"},"institutions":[{"id":"https://openalex.org/I152014189","display_name":"Minnesota State University, Mankato","ror":"https://ror.org/04att9732","country_code":"US","type":"education","lineage":["https://openalex.org/I152014189","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Kawatra","raw_affiliation_strings":["Minnesota State University, Mankato, MN, USA","Minnesota State University,Mankato,MN,USA"],"affiliations":[{"raw_affiliation_string":"Minnesota State University, Mankato, MN, USA","institution_ids":["https://openalex.org/I152014189"]},{"raw_affiliation_string":"Minnesota State University,Mankato,MN,USA","institution_ids":["https://openalex.org/I152014189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088438315"],"corresponding_institution_ids":["https://openalex.org/I152014189"],"apc_list":null,"apc_paid":null,"fwci":0.3545,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62617032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5 pp.","last_page":"5 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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.9983999729156494,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/hop","display_name":"Hop (telecommunications)","score":0.7372865676879883},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6325989365577698},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5892201662063599},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.5477404594421387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5332244038581848},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45368775725364685},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.4255695641040802},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41401544213294983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38208630681037903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28591257333755493},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1452060043811798},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14328306913375854}],"concepts":[{"id":"https://openalex.org/C25906391","wikidata":"https://www.wikidata.org/wiki/Q1432381","display_name":"Hop (telecommunications)","level":2,"score":0.7372865676879883},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6325989365577698},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5892201662063599},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5477404594421387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5332244038581848},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45368775725364685},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.4255695641040802},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41401544213294983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38208630681037903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28591257333755493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1452060043811798},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14328306913375854},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hicss.2003.1174186","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hicss.2003.1174186","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4399999976158142,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1523334965","https://openalex.org/W1560173509","https://openalex.org/W1971782520","https://openalex.org/W1991573132","https://openalex.org/W2017697298","https://openalex.org/W2019067222","https://openalex.org/W2052035035","https://openalex.org/W2057725412","https://openalex.org/W2067802172","https://openalex.org/W2069926749","https://openalex.org/W2085416165","https://openalex.org/W2104431850","https://openalex.org/W2138913744","https://openalex.org/W4236384091","https://openalex.org/W6631436888"],"related_works":["https://openalex.org/W3211557223","https://openalex.org/W2117210722","https://openalex.org/W1978191894","https://openalex.org/W2007036916","https://openalex.org/W2589759689","https://openalex.org/W2120266540","https://openalex.org/W3015807911","https://openalex.org/W872563264","https://openalex.org/W2164087676","https://openalex.org/W4240867999"],"abstract_inverted_index":{"The":[0],"hop":[1],"constrained":[2],"min-sum":[3],"arborescence":[4],"with":[5,31],"outage":[6,96],"costs":[7],"problem":[8],"consists":[9],"of":[10,22,72,116,131],"selecting":[11],"links":[12,73],"in":[13],"a":[14,20,28,54,83,117,121],"network":[15,106,133],"so":[16],"as":[17],"to":[18,27,61,82,114,125],"connect":[19],"set":[21],"terminal":[23,40,51,67,91],"nodes":[24],"N={2,3,":[25],"...n}":[26],"central":[29,59,76],"node":[30,41,52,60,68,77,92,110],"minimal":[32],"total":[33],"link":[34],"cost":[35,102],"such":[36],"that":[37,109],"(a)":[38],"each":[39,50,66,90],"j":[42,62,69,79],"has":[43,93],"exactly":[44],"one":[45],"entering":[46],"link;":[47],"(b)":[48],"for":[49,65],"j,":[53],"unique":[55],"path":[56],"from":[57],"the":[58,70,75,100,105,127],"exists;":[63],"(c)":[64],"number":[71,85],"between":[74],"and":[78,88],"is":[80,99,111],"limited":[81],"predefined":[84],"h/sub":[86],"j/,":[87],"(d)":[89],"an":[94],"associated":[95],"cost,":[97],"which":[98],"economic":[101],"incurred":[103],"by":[104],"user":[107],"whenever":[108],"disabled":[112],"due":[113],"failure":[115],"link.":[118],"We":[119],"suggest":[120],"Lagrangian":[122],"based":[123],"heuristic":[124],"solve":[126],"integer":[128],"programming":[129],"formulation":[130],"this":[132],"problem.":[134]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}