{"id":"https://openalex.org/W2090279452","doi":"https://doi.org/10.1002/net.3230080104","title":"Cost allocation for steiner trees","display_name":"Cost allocation for steiner trees","publication_year":1978,"publication_date":"1978-03-01","ids":{"openalex":"https://openalex.org/W2090279452","doi":"https://doi.org/10.1002/net.3230080104","mag":"2090279452"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080104","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5019904083","display_name":"Nimrod Megiddo","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"N. Megiddo","raw_affiliation_strings":["Tel Aviv University Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019904083"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.8643,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.85635533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"1","first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9908999800682068,"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.972100019454956,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8639940619468689},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.7021257281303406},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5918234586715698},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5659573674201965},{"id":"https://openalex.org/keywords/cost-allocation","display_name":"Cost allocation","score":0.5647441744804382},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5355743169784546},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5300303101539612},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5256163477897644},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4515577256679535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4419126808643341},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4340444803237915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4192696511745453},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.41678738594055176},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.138953298330307},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06282570958137512}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8639940619468689},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.7021257281303406},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5918234586715698},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5659573674201965},{"id":"https://openalex.org/C2781426564","wikidata":"https://www.wikidata.org/wiki/Q13479712","display_name":"Cost allocation","level":2,"score":0.5647441744804382},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5355743169784546},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5300303101539612},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5256163477897644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4515577256679535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4419126808643341},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4340444803237915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4192696511745453},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.41678738594055176},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.138953298330307},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06282570958137512},{"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/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080104","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080104","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1990488643","https://openalex.org/W2076332815","https://openalex.org/W2086709935","https://openalex.org/W4302399279"],"related_works":["https://openalex.org/W2011703460","https://openalex.org/W1992380975","https://openalex.org/W2080581853","https://openalex.org/W3201893458","https://openalex.org/W2090152127","https://openalex.org/W2008939113","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W14679004","https://openalex.org/W1566651525"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"set":[2],"of":[3,21,63,67,75],"points,":[4],"called":[5,10],"consumers,":[6,72],"and":[7],"another":[8],"point":[9],"central":[11,92],"supplier,":[12],"are":[13],"located":[14],"in":[15,58],"a":[16,23,50,73],"Euclidean":[17],"plane.":[18],"The":[19,35],"cost":[20,37,66,84],"constructing":[22],"connection":[24],"between":[25,33],"two":[26],"points":[27],"is":[28,47,56,79],"proportional":[29],"to":[30,44,70,90],"the":[31,42,45,64,68,71,83,91],"distance":[32],"them.":[34],"minimum":[36],"required":[38,85],"for":[39,60,86],"connecting":[40,87],"all":[41],"consumers":[43,76],"supplier":[46],"given":[48,57],"by":[49],"minimal":[51],"Steiner":[52],"tree.":[53],"An":[54],"example":[55],"which":[59,78],"every":[61],"allocation":[62],"total":[65],"tree":[69],"coalition":[74],"exists,":[77],"charged":[80],"more":[81],"than":[82],"its":[88],"members":[89],"supplier.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}