中国机械工程学会生产工程分会知识服务平台 | sc.gmachineinfo.com

期刊

ISSN	0304-3975
刊名	Theoretical Computer Science
参考译名	理论计算机科学
收藏年代	2002～2024

全部

题名	作者	出版年	年卷期
On the probe problem for (r, l)-well-coveredness: Algorithms and complexity	Faria, Luerbio; Souza, Ueverton S.	2022	2022, vol.932
Computing the best-case energy complexity of satisfying assignments in monotone circuits	Nascimento Silva, Janio Carlos; Souza, Ueverton S.	2022	2022, vol.932
APX-hardness and approximation for the k-burning number problem	Mondal, Debajyoti; Rajasingh, Angelin Jemima; Parthiban, N.; Rajasingh, Indra	2022	2022, vol.932
New approximation algorithms for the heterogeneous weighted delivery problem	Bilo, Davide; Guala, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko	2022	2022, vol.932
Exact square coloring of certain classes of graphs: Complexity and algorithms	Priyamvada; Panda, B. S.	2022	2022, vol.932
Mechanisms for dual-role-facility location games: Truthfulness and approximability	Chen, Xujin; Li, Minming; Wang, Changjun; Wang, Chenhao; Zhang, Mengqi; Zhao, Yingchao	2022	2022, vol.932
Sublinear-time reductions for big data computing	Gao, Xiangyu; Li, Jianzhong; Miao, Dongjing	2022	2022, vol.932
A note on LP-based approximation algorithms for capacitated facility location problem	Miao, Runjie; Yuan, Jinjiang	2022	2022, vol.932
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph	Hong, Weizhi; Ran, Yingli; Zhang, Zhao	2022	2022, vol.932