{"id":"https://openalex.org/W1967968533","doi":"https://doi.org/10.1142/s179383091250005x","title":"FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX\u2013MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS","display_name":"FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX\u2013MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W1967968533","doi":"https://doi.org/10.1142/s179383091250005x","mag":"1967968533"},"language":"en","primary_location":{"id":"doi:10.1142/s179383091250005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250005x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5012701826","display_name":"Bang Ye Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"BANG YE WU","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chung Cheng University, ChiaYi 621, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, ChiaYi 621, Taiwan, R.O.C","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012701826"],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":null,"apc_paid":null,"fwci":1.3478,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.79743497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"04","issue":"01","first_page":"1250005","last_page":"1250005"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.752205491065979},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7510694861412048},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7185102701187134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7008813619613647},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5649120211601257},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5526630282402039},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5315627455711365},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5281736254692078},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.5106619000434875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.480465829372406},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4686046838760376},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42722728848457336},{"id":"https://openalex.org/keywords/frequency-partition-of-a-graph","display_name":"Frequency partition of a graph","score":0.4102548062801361},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.21902510523796082},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14004620909690857},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06373372673988342}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.752205491065979},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7510694861412048},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7185102701187134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7008813619613647},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5649120211601257},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5526630282402039},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5315627455711365},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5281736254692078},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.5106619000434875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.480465829372406},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4686046838760376},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42722728848457336},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.4102548062801361},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.21902510523796082},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14004620909690857},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06373372673988342}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383091250005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383091250005x","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1586726865","https://openalex.org/W1970194957","https://openalex.org/W1970776799","https://openalex.org/W1977623721","https://openalex.org/W1983999399","https://openalex.org/W1993150073","https://openalex.org/W1997165382","https://openalex.org/W2002805364","https://openalex.org/W2011039300","https://openalex.org/W2083409154","https://openalex.org/W2706392777"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2732982824","https://openalex.org/W1443174385","https://openalex.org/W3123730328","https://openalex.org/W1967968533"],"abstract_inverted_index":{"We":[0],"study":[1],"how":[2],"to":[3,78],"partition":[4,27],"an":[5,74],"interval":[6,80],"graph":[7],"with":[8],"non-negative":[9],"vertex":[10],"weights":[11],"into":[12],"k":[13,31,67],"connected":[14],"subgraphs":[15],"such":[16],"that":[17,37],"the":[18,26,70],"minimum":[19],"total":[20],"weight":[21],"of":[22,25],"any":[23,39,65],"part":[24],"is":[28,35],"maximized.":[29],"For":[30,64],"=":[32],"2,":[33,69],"it":[34,56],"shown":[36],"for":[38],"\u03b5":[40],">":[41,68],"0,":[42],"a":[43,58],"(1":[44],"+":[45],"\u03b5)-approximation":[46],"can":[47],"be":[48],"found":[49],"in":[50],"O((1/\u03b5)n":[51],"3":[52],")":[53],"time,":[54],"i.e.,":[55],"admits":[57,73],"fully":[59],"polynomial-time":[60],"approximation":[61],"scheme":[62],"(FPTAS).":[63],"fixed":[66],"problem":[71],"also":[72],"FPTAS":[75],"when":[76],"restricted":[77],"k-connected":[79],"graphs.":[81]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}