{"id":"https://openalex.org/W2035404925","doi":"https://doi.org/10.1007/bf01762116","title":"Data transfers in networks","display_name":"Data transfers in networks","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2035404925","doi":"https://doi.org/10.1007/bf01762116","mag":"2035404925"},"language":"en","primary_location":{"id":"doi:10.1007/bf01762116","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762116","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108447178","display_name":"Hyeong -Ah Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hyeong -Ah Choi","raw_affiliation_strings":["Department of Computer Science, Michigan State University, 48824, East Lansing, MI, USA","Department of Computer Science, Michigan State University, East Lansing, USA","Department of Computer Science, Michigan State University, East Lansing, USA 48824#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan State University, 48824, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Computer Science, Michigan State University, East Lansing, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Computer Science, Michigan State University, East Lansing, USA 48824#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108528137","display_name":"S. L. Hakimi","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Louis Hakimi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, 95616, Davis, CA, USA","Department of Electrical and Computer Engineering, University of California, Davis, USA","Department of Electrical and Computer Engineering, University of California, Davis, USA 95616"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, 95616, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Davis, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Davis, USA 95616","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.0472,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.74414293,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"1-4","first_page":"223","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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.9991000294685364,"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/theory-of-computation","display_name":"Theory of computation","score":0.6429392099380493},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.642633318901062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6329483985900879},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6007269620895386},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5628474950790405},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4701915979385376},{"id":"https://openalex.org/keywords/nurse-scheduling-problem","display_name":"Nurse scheduling problem","score":0.4288116693496704},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4184337258338928},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4152139723300934},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40364834666252136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34380632638931274},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3433600068092346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30953508615493774},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.21351680159568787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1827329397201538}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6429392099380493},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.642633318901062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6329483985900879},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6007269620895386},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5628474950790405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4701915979385376},{"id":"https://openalex.org/C102370290","wikidata":"https://www.wikidata.org/wiki/Q7070210","display_name":"Nurse scheduling problem","level":5,"score":0.4288116693496704},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4184337258338928},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4152139723300934},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40364834666252136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34380632638931274},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3433600068092346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30953508615493774},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.21351680159568787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1827329397201538},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01762116","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01762116","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W157191169","https://openalex.org/W1484040084","https://openalex.org/W1753139847","https://openalex.org/W1965437596","https://openalex.org/W1984939896","https://openalex.org/W1991316766","https://openalex.org/W1997370889","https://openalex.org/W2045611333","https://openalex.org/W2053050060","https://openalex.org/W2055748234","https://openalex.org/W2068305979","https://openalex.org/W2078112894","https://openalex.org/W2099806658","https://openalex.org/W2120000070","https://openalex.org/W2137468369","https://openalex.org/W2168013937","https://openalex.org/W2170198451","https://openalex.org/W2732454385","https://openalex.org/W3000441650","https://openalex.org/W6601760687"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2151412766","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}