{"id":"https://openalex.org/W2092518753","doi":"https://doi.org/10.1137/0213040","title":"On Some Variants of the Bandwidth Minimization Problem","display_name":"On Some Variants of the Bandwidth Minimization Problem","publication_year":1984,"publication_date":"1984-08-01","ids":{"openalex":"https://openalex.org/W2092518753","doi":"https://doi.org/10.1137/0213040","mag":"2092518753"},"language":"en","primary_location":{"id":"doi:10.1137/0213040","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213040","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph Y-T. Leung","raw_affiliation_strings":["Northwestern University Evanston IL"],"affiliations":[{"raw_affiliation_string":"Northwestern University Evanston IL","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085072639","display_name":"Oliver Vornberger","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oliver Vornberger","raw_affiliation_strings":["Universitat Paderborn, Paderborn, West Germany"],"affiliations":[{"raw_affiliation_string":"Universitat Paderborn, Paderborn, West Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052721153","display_name":"James D. Witthoff","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James D. Witthoff","raw_affiliation_strings":["AT&T Bell Laboratories, Naperville, IL#TAB#"],"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories, Naperville, IL#TAB#","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108400400"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":8.1965,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.96942541,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"650","last_page":"667"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9915000200271606,"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/mathematics","display_name":"Mathematics","score":0.6829531788825989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6640377640724182},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5452696084976196},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5250504016876221},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4452306032180786},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4328407347202301},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43233510851860046},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41178014874458313},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39830976724624634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3543455898761749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23817449808120728},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06571251153945923}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6829531788825989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6640377640724182},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5452696084976196},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5250504016876221},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4452306032180786},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4328407347202301},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43233510851860046},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41178014874458313},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39830976724624634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3543455898761749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23817449808120728},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06571251153945923}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0213040","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0213040","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":11,"referenced_works":["https://openalex.org/W85690038","https://openalex.org/W1487184349","https://openalex.org/W2001364911","https://openalex.org/W2027077493","https://openalex.org/W2030087828","https://openalex.org/W2055849951","https://openalex.org/W2057392949","https://openalex.org/W2060983467","https://openalex.org/W2092333800","https://openalex.org/W2110920860","https://openalex.org/W2162371997"],"related_works":["https://openalex.org/W3151522584","https://openalex.org/W1497123311","https://openalex.org/W2090386787","https://openalex.org/W2155226164","https://openalex.org/W2110536527","https://openalex.org/W2364531301","https://openalex.org/W2145169614","https://openalex.org/W1971979548","https://openalex.org/W2539729130","https://openalex.org/W4309397562"],"abstract_inverted_index":{"We":[0,95,133],"consider":[1],"the":[2,6,11,45,71,98,109,124,143,150,153],"following":[3],"variants":[4],"of":[5,35,60,86,142,152],"bandwidth":[7],"minimization":[8],"problem:":[9],"(1)":[10],"cycle-bandwidth":[12,99],"problem":[13,47,73,100,127,156],"which":[14,48,74],"for":[15,103,117,130,138],"a":[16,28,39,53,64,79,90],"given":[17],"graph":[18],"G":[19],"and":[20,69,111,123],"positive":[21],"integer":[22],"k,":[23,43,68],"asks":[24,49,75],"if":[25,50,76],"there":[26,51,77],"is":[27,52,78,101,128],"circular":[29,80],"layout":[30,55,81],"such":[31,56,82],"that":[32,57,83,97],"every":[33,58,84],"pair":[34,59,85],"adjacent":[36,61,87],"vertexes":[37,62,88],"have":[38,63,89],"distance":[40,65,91],"at":[41],"most":[42],"(2)":[44],"separation":[46,110,126,145,155],"linear":[54],"greater":[66,92],"than":[67,93],"(3)":[70],"cycle-separation":[72,112],"k.":[94,132],"show":[96,149],"NP-complete":[102,116,129],"each":[104,118],"fixed":[105,119],"$k":[106,120],"\\geqslant":[107,121],"2$":[108],"problems":[113,160],"are":[114],"both":[115],"1$,":[122],"directed":[125,144,154],"arbitrary":[131],"give":[134],"polynomial":[135],"time":[136],"algorithms":[137],"several":[139,158],"special":[140],"cases":[141],"problem.":[146],"Finally,":[147],"we":[148],"relationships":[151],"with":[157],"scheduling":[159],"by":[161],"giving":[162],"reductions":[163],"among":[164],"them.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}