救护车
发表于 2025-3-25 03:44:42
http://reply.papertrans.cn/17/1605/160465/160465_21.png
deadlock
发表于 2025-3-25 11:22:23
Wei-Ying Chou,Bi-Hui Chen,Wen-Ko ChiouThis improves the previous factor of . by Trevisan . For low . values we prove NP-hardness factors of . and . for 4-DM, 5-DM and 6-DM respectively. These results extend to the problem of .-Set-Packing and the problem of Maximum Independent-Set in (.+1)-claw-free graphs.
Obvious
发表于 2025-3-25 13:12:23
http://reply.papertrans.cn/17/1605/160465/160465_23.png
GULP
发表于 2025-3-25 17:44:51
http://reply.papertrans.cn/17/1605/160465/160465_24.png
endocardium
发表于 2025-3-25 23:38:07
Covering Graphs Using Trees and Starshas no more than . trees. Star covers are defined analogously. Additionally, we may also be provided with a set of . vertices which are to serve as roots of the trees or stars. In this paper, we provide constant factor approximation algorithms for finding tree and star covers of graphs, in the rooted and un-rooted versions.
令人作呕
发表于 2025-3-26 00:41:46
http://reply.papertrans.cn/17/1605/160465/160465_26.png
Small-Intestine
发表于 2025-3-26 04:56:34
Approximating Market Equilibriaprice vector. The main tool in our algorithm is the polynomial-time algorithm of Devanur et al. for a variant of the problem in which there is a clear demarcation between buyers and sellers. Their algorithm is used as a subroutine in our algorithm.
大洪水
发表于 2025-3-26 11:01:19
http://reply.papertrans.cn/17/1605/160465/160465_28.png
Rotator-Cuff
发表于 2025-3-26 16:33:26
http://reply.papertrans.cn/17/1605/160465/160465_29.png
不可比拟
发表于 2025-3-26 20:25:27
http://reply.papertrans.cn/17/1605/160465/160465_30.png