Titlebook: Algorithms and Computation; 26th International S Khaled Elbassioni,Kazuhisa Makino Conference proceedings 2015 Springer-Verlag Berlin Heide

显示全部楼层 · 发表于 2025-3-21 18:33:20

书目名称Algorithms and Computation影响因子(影响力)

书目名称Algorithms and Computation影响因子(影响力)学科排名

书目名称Algorithms and Computation网络公开度

书目名称Algorithms and Computation网络公开度学科排名

书目名称Algorithms and Computation被引频次

书目名称Algorithms and Computation被引频次学科排名

书目名称Algorithms and Computation年度引用

书目名称Algorithms and Computation年度引用学科排名

书目名称Algorithms and Computation读者反馈

书目名称Algorithms and Computation读者反馈学科排名

显示全部楼层 · 发表于 2025-3-21 22:52:28

Competitive Local Routing with Constraintse if the straight line segment connecting them does not properly intersect any constraints. The constrained .-graph is constructed by partitioning the plane around each vertex into . disjoint cones with aperture ., and adding an edge to the ‘closest’ visible vertex in each cone. We consider how to r

显示全部楼层 · 发表于 2025-3-22 03:52:24

显示全部楼层 · 发表于 2025-3-22 07:26:25

How to Select the Top , Elements from Evolving Data? that the underlying total order evolves over time, and that the order can only be probed by pair-wise comparisons. It is assumed that at each time step, only one pair of elements can be compared. This assumption of restricted access is reasonable in the dynamic model, especially for massive data se

显示全部楼层 · 发表于 2025-3-22 09:05:46

显示全部楼层 · 发表于 2025-3-22 16:46:30

显示全部楼层 · 发表于 2025-3-22 19:44:31

显示全部楼层 · 发表于 2025-3-22 23:01:41

On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems-vertex undirected graph, with each edge colored with one of . colors. The goal is to find a subgraph on a minimum number of vertices which has one induced edge of each color. The problem is known to be NP-hard, and has an upper bound of . and a lower bound of . on its approximation ratio..We define

显示全部楼层 · 发表于 2025-3-23 03:11:55

显示全部楼层 · 发表于 2025-3-23 07:16:25

The Secretary Problem with a Choice Functiongoal is to maximize the probability of choosing the best applicant. In this paper, we introduce the secretary problem with a choice function. The choice function represents the preference of the decision-maker. In this problem, the decision-maker hires some applicants, and the goal is to maximize th

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	吾爱论文网	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-28 13:42
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved