{"id":"https://openalex.org/W2016814046","doi":"https://doi.org/10.1137/s1052623497344002","title":"A Polynomial Time Algorithm for Shaped Partition Problems","display_name":"A Polynomial Time Algorithm for Shaped Partition Problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2016814046","doi":"https://doi.org/10.1137/s1052623497344002","mag":"2016814046"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623497344002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497344002","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","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/A5103573008","display_name":"Frank K. Hwang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank K. Hwang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064145786","display_name":"Shmuel Onn","orcid":"https://orcid.org/0000-0002-4526-5534"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shmuel Onn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044612344","display_name":"Uriel G. Rothblum","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uriel G. Rothblum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.879,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.96110499,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"1","first_page":"70","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.887892484664917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8358415961265564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7757992744445801},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7504431009292603},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6638585329055786},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5317102074623108},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45001664757728577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43326663970947266},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42373886704444885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07026639580726624}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.887892484664917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8358415961265564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7757992744445801},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7504431009292603},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6638585329055786},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5317102074623108},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45001664757728577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43326663970947266},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42373886704444885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07026639580726624},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623497344002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497344002","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"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 Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.601.6363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.601.6363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ir.lib.nctu.edu.tw/bitstream/987654321/8882/1/040219018.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1963547452","https://openalex.org/W1980471344","https://openalex.org/W1981609337","https://openalex.org/W1994709142","https://openalex.org/W2001242324","https://openalex.org/W2021051430","https://openalex.org/W2022336615","https://openalex.org/W2037855401","https://openalex.org/W2038021690","https://openalex.org/W2046513157","https://openalex.org/W2050230854","https://openalex.org/W2061577768","https://openalex.org/W2088278186","https://openalex.org/W2098612971","https://openalex.org/W2098780983","https://openalex.org/W2103777374","https://openalex.org/W2148642357","https://openalex.org/W2184707108","https://openalex.org/W2911447274"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W2507185596","https://openalex.org/W1493684871","https://openalex.org/W4287022798","https://openalex.org/W2901329027","https://openalex.org/W1987507258","https://openalex.org/W1598028160","https://openalex.org/W3153687528","https://openalex.org/W4287212971","https://openalex.org/W1774334694"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,32,44,81,96,132],"class":[3,52,98],"of":[4,8,34,46,99,115,134,136],"shaped":[5,100,138],"partition":[6,101,139],"problems":[7,60],"partitioning":[9],"n":[10],"given":[11],"vectors":[12,35],"in":[13,36,48,86,150],"d-dimensional":[14],"criteria":[15],"space":[16],"into":[17],"p":[18,66,78,118,129],"parts":[19],"so":[20],"as":[21],"to":[22,40],"maximize":[23],"an":[24],"arbitrary":[25,41],"objective":[26],"function":[27],"which":[28],"is":[29,67,119,141],"convex":[30],"on":[31,43,94],"sum":[33],"each":[37,49],"part,":[38],"subject":[39],"constraints":[42],"number":[45,133],"elements":[47],"part.":[50],"This":[51],"has":[53],"broad":[54],"expressive":[55],"power":[56],"and":[57,77,110,128,144],"captures":[58],"NP-hard":[59],"even":[61,112],"if":[62],"either":[63],"d":[64,76,116,127],"or":[65,117],"fixed.":[68],"In":[69],"contrast,":[70],"we":[71,122],"show":[72,123],"that":[73,124],"when":[74,113,125],"both":[75,126],"are":[79,130],"fixed,":[80,131],"problem":[82],"can":[83,147],"be":[84,148],"solved":[85],"strongly":[87,151],"polynomial":[88,152],"time.":[89,153],"Our":[90],"solution":[91],"method":[92],"relies":[93],"studying":[95],"corresponding":[97],"polytopes.":[102],"Such":[103],"polytopes":[104],"may":[105],"have":[106],"exponentially":[107],"many":[108],"vertices":[109,135,146],"facets":[111],"one":[114],"fixed;":[120],"however,":[121],"any":[137],"polytope":[140],"$O(n^{d{p\\choose":[142],"2}})$":[143],"all":[145],"produced":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}