{"id":"https://openalex.org/W2802366486","doi":"https://doi.org/10.1016/j.ipl.2018.04.013","title":"Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces","display_name":"Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces","publication_year":2018,"publication_date":"2018-04-25","ids":{"openalex":"https://openalex.org/W2802366486","doi":"https://doi.org/10.1016/j.ipl.2018.04.013","mag":"2802366486"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2018.04.013","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2018.04.013","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5004025610","display_name":"Junran Lichen","orcid":"https://orcid.org/0000-0003-1385-8957"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junran Lichen","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming 650091, PR China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming 650091, PR China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018144399","display_name":"Jianping Li","orcid":"https://orcid.org/0000-0003-1508-1440"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianping Li","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming 650091, PR China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming 650091, PR China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108045111","display_name":"Ko\u2010Wei Lih","orcid":"https://orcid.org/0000-0003-1523-3555"},"institutions":[{"id":"https://openalex.org/I4210099334","display_name":"Institute of Mathematics, Academia Sinica","ror":"https://ror.org/0120q3031","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210099334","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ko-Wei Lih","raw_affiliation_strings":["Institute of Mathematics, Academia Sinica, Taipei 10617, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Academia Sinica, Taipei 10617, Taiwan","institution_ids":["https://openalex.org/I4210099334"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018144399"],"corresponding_institution_ids":["https://openalex.org/I189210763"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05173513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"137","issue":null,"first_page":"11","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7824026346206665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.723316490650177},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7119801640510559},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6756296157836914},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.639191210269928},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5974934101104736},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.594347357749939},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44914132356643677},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4429391026496887},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43517377972602844},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41255003213882446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35230037569999695},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2749179005622864}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7824026346206665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.723316490650177},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7119801640510559},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6756296157836914},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.639191210269928},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5974934101104736},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.594347357749939},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44914132356643677},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4429391026496887},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43517377972602844},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41255003213882446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35230037569999695},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2749179005622864},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ipl.2018.04.013","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2018.04.013","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5908643955","display_name":null,"funder_award_id":"11461081","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306875","display_name":"American Physical Therapy Association","ror":"https://ror.org/03k1e3764"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1543921836","https://openalex.org/W1983607113","https://openalex.org/W1990313671","https://openalex.org/W2052064586","https://openalex.org/W2069002708","https://openalex.org/W2611804663","https://openalex.org/W2988480584","https://openalex.org/W4230573295","https://openalex.org/W6632632525"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2803918337","https://openalex.org/W2015718828","https://openalex.org/W2053060257","https://openalex.org/W4295683043","https://openalex.org/W3141326665","https://openalex.org/W2047517090","https://openalex.org/W2350799039"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}