@会议记录{chandrasekaran_et_al:LIPIcs.ESA.2020.30,author={Chandrasekaran、Karthekeyan和Grigorescu、Elena和Istrate、Gabriel和Kulkarni、Shubhang和Lin、Young-San和Zhu、Minshen},title={最大二叉树问题}},booktitle={第28届欧洲算法年会(ESA 2020)},页数={30:1--30:22},series={Leibniz国际信息学论文集(LIPIcs)},国际标准图书编号={978-3-95977-162-7},ISSN={1868-8969},年份={2020年},体积={173},editor={Grandoni、Fabrizio和Herman、Grzegorz和Sanders、Peter},publisher={Schloss Dagstuhl--Leibniz Zentrum f{\“u}r Informatik},地址={Dagstuhl,德国},URL={https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.30},URN={URN:nbn:de:0030-drops-128967},doi={10.4230/LIPIcs.ESA.2020.30},annote={关键词:最大二叉树,heapability,inproximability,fixed-parameter trability}}