{"id":"https://openalex.org/W4285009486","doi":"https://doi.org/10.1145/3490148.3538580","title":"Bamboo Trimming Revisited","display_name":"Bamboo Trimming Revisited","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285009486","doi":"https://doi.org/10.1145/3490148.3538580"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538580","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol275-approx-random2023/LIPIcs.APPROX-RANDOM.2023.16/LIPIcs.APPROX-RANDOM.2023.16.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044152037","display_name":"John Kuszmaul","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Kuszmaul","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044152037"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.4512,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65125037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"411","last_page":"417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9939000010490417,"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.9939000010490417,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9887999892234802,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9884999990463257,"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/bamboo","display_name":"Bamboo","score":0.9366751313209534},{"id":"https://openalex.org/keywords/trimming","display_name":"Trimming","score":0.9017786383628845},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5523492097854614},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5481644868850708},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47248902916908264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4709666073322296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42416226863861084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4000139832496643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3798374533653259},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09419357776641846},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.08232414722442627}],"concepts":[{"id":"https://openalex.org/C2778704284","wikidata":"https://www.wikidata.org/wiki/Q670887","display_name":"Bamboo","level":2,"score":0.9366751313209534},{"id":"https://openalex.org/C56951928","wikidata":"https://www.wikidata.org/wiki/Q3539213","display_name":"Trimming","level":2,"score":0.9017786383628845},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5523492097854614},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5481644868850708},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47248902916908264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4709666073322296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42416226863861084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4000139832496643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3798374533653259},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09419357776641846},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.08232414722442627},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3490148.3538580","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:18841","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol275-approx-random2023/LIPIcs.APPROX-RANDOM.2023.16/LIPIcs.APPROX-RANDOM.2023.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.approx/random.2023.16","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2023.16","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:18841","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.16","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol275-approx-random2023/LIPIcs.APPROX-RANDOM.2023.16/LIPIcs.APPROX-RANDOM.2023.16.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G2198844204","display_name":null,"funder_award_id":"CNS-1938709, CCF-2106827","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4285009486.pdf","grobid_xml":"https://content.openalex.org/works/W4285009486.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1628974215","https://openalex.org/W1884472997","https://openalex.org/W1998014198","https://openalex.org/W2003523151","https://openalex.org/W2010063782","https://openalex.org/W2025470700","https://openalex.org/W2026511056","https://openalex.org/W2039208882","https://openalex.org/W2051392328","https://openalex.org/W2056830486","https://openalex.org/W2071632823","https://openalex.org/W2097145526","https://openalex.org/W2104338317","https://openalex.org/W2109488193","https://openalex.org/W2111046894","https://openalex.org/W2120234059","https://openalex.org/W2127087946","https://openalex.org/W2160702061","https://openalex.org/W2165659786","https://openalex.org/W2167661731","https://openalex.org/W2169152518","https://openalex.org/W2568208948","https://openalex.org/W2721925531","https://openalex.org/W2805677007","https://openalex.org/W2935750213","https://openalex.org/W2964054046","https://openalex.org/W2997525450","https://openalex.org/W3003073781","https://openalex.org/W3013078030","https://openalex.org/W3116154046","https://openalex.org/W3166763682","https://openalex.org/W3181683098","https://openalex.org/W4206943784","https://openalex.org/W4235774361","https://openalex.org/W4243962573","https://openalex.org/W6604905110"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2467235537","https://openalex.org/W4243755427","https://openalex.org/W1493074871","https://openalex.org/W2222099502","https://openalex.org/W2128287377","https://openalex.org/W1979067309","https://openalex.org/W2375590729","https://openalex.org/W2385024427","https://openalex.org/W2390747034"],"abstract_inverted_index":{"The":[0,49,65],"bamboo":[1,6,27,43,66],"trimming":[2,67],"problem":[3,68],"considers":[4],"n":[5],"with":[7,90],"growth":[8],"rates":[9],"h1,":[10],"2,":[11],".":[12,13,14],",":[15,31],"satisfying":[16],"\u03a3ihi":[17],"=":[18],"1.":[19],"During":[20],"a":[21,81],"given":[22],"unit":[23],"of":[24,41,56,83],"time,":[25],"each":[26],"grows":[28],"by":[29],"hi":[30],"and":[32,76],"then":[33],"the":[34,42,54,57,63,84],"bamboo-trimming":[35],"algorithm":[36],"gets":[37],"to":[38,46,52,72],"trim":[39],"one":[40],"back":[44],"down":[45],"height":[47,55],"zero.":[48],"goal":[50],"is":[51,69],"minimize":[53],"tallest":[58],"bamboo,":[59],"also":[60],"known":[61],"as":[62,80],"backlog.":[64],"closely":[70],"related":[71],"many":[73],"scheduling":[74],"problems,":[75],"can":[77],"be":[78],"viewed":[79],"variation":[82],"widely-studied":[85],"fixed-rate":[86],"cup":[87],"game,":[88],"but":[89],"constant-factor":[91],"resource":[92],"augmentation.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2022-07-12T00:00:00"}