Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

請用此 Handle URI 來引用此文件： http://ir.sinica.edu.tw/handle/201000000A/80891

題名:	Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
作者:	Lichen, Junran Li, Jianping Lih, Ko-Wei Yu, Xingxing
公開日期:	2020
關聯:	Journal of Combinatorial Optimization RESTRICTED ACCESS
URI:	http://ir.sinica.edu.tw/handle/201000000A/80891
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=1382-6905&DestApp=JCR&RQ=IF_CAT_BOXPLOT
URL:	http://dx.doi.org/10.1007/s10878-020-00543-x
顯示於：	數學研究所

顯示文件完整紀錄

上周
0

上個月
1

checked on 2023/1/4

檢查

TAIR相關文章