维普期刊资源整合服务平台（V6.5）

39篇 您的检索式：期刊名="ACM Transactions on Algorithms"

选中清除导出查看参考文献查看引证文献引用追踪共2页首页上一页第1页下一页末页 /2 跳转

	题名	作者	年代	出处	被引量
1	A Polyno-mial- time Approximation Scheme for Euclidean Steiner Forest 显示文摘	BORRADAILE G KLEIN P N MATHIEU C	2015	ACM Transactions on Algorithms2015，11，3：	1
2	Fault-tolerant facility location 显示文摘	Swamy C Shmoys D B	2008	ACM Transactions on Algorithms2008，4，：	1
3	Finding equitable convex partitions of points in a polygon efficiently显示文摘	Cartsson J G	2010	ACM Transactions on Algorithms2010，6，4：	1
4	Clustering, community partition and disjoint spanning trees显示文摘	Cun-Quan Zhang Yongbin Ou	2008	ACM Transactions on Algorithms (TALG)2008，，3：	1
5	Fault-tolerant facility location显示文摘	Swamy C Shmoys D B	2008	ACM Transactions on Algorithms2008，4，4：	1
6	A better approximation ratio for the vertex cover problem 显示文摘	George Karakostas	2009	ACM Transactions on Algorithms2009，5，4：	1
7	Finding thek shortest simple paths: A new algorithm and its implementation 显示文摘	Hershberger J Maxel M Suri S	2007	ACM Transactions on Algorithms (TALG)2007，3，4：	1
8	The NP-Complete Column: the Many Limits on Approximation显示文摘	Johnson D S	2006	ACM Transactions on Algorithms2006，2，3：	1
9	Finding the k shortest simple paths: a new algorithm and its implementation 显示文摘	Hershberger J E Maxel M Suri S	2007	ACM Transactions on Algorithms (S1549-6325)2007，3，4：	1
10	Lower-bounded facility location显示文摘	Svitkina Z	2010	ACM Transactions on Algorithms2010，6，4：	1
11	Lower-bounded facility location 显示文摘	Svitkina Z	2010	Journal ACM Transactions on Algorithms2010，69，：	1
12	Approximate majorization and fair online load balancing显示文摘	Goel A Meyerson A Plotkin S	2005	ACM Transactions on Algorithms2005，1，2：	1
13	Minimizing movement in mobile facility location problems显示文摘	Zachary Friggstad Mohammad R. Salavatipour	2011	ACM Transactions on Algorithms (TALG)2011，，3：	1
14	Algorithms for distributed functional monitoring显示文摘	Cormode G Muthukrishnan S Yi K	2011	ACM Transactions on Algorithms2011，7，2：	1
15	Finding the K shortest simple paths: A new algorithm and its implementation 显示文摘	Hershberger J Maxel M Sur S	2007	ACM Transactions on Algorithms2007，3，4：	1
16	Dynamic pricing for impatient bidders 显示文摘	BANSAL N CHEN N Chemiavsky N	2010	ACM Transactions on Algorithms2010，6，2：	1
17	Edge-disjoint paths revisited显示文摘	Chekuri C Khanna S	2007	ACM Transactions on Algorithms2007，3，4：	1
18	Fast sparse matrix multiplication 显示文摘	Yuster R Zwick U	2005	ACM Transactions on Algorithms (TALG)2005，1，1：	1
19	Finding the k shortest simple paths显示文摘	John Hershberger Matthew Maxel Subhash Suri	2007	ACM Transactions on Algorithms (TALG)2007，，4：	1
20	Faster fixed parameter tractable algorithms for finding feedback vertex sets 显示文摘	Raman V Saurabh S Suhramanian C	2006	ACM Transactions on Algorithms2006，2，3：	1

返回顶部每页显示：

共2页首页上一页第1页下一页末页 /2 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示