黄油没有 发表于 2025-3-30 09:34:35

http://reply.papertrans.cn/16/1532/153134/153134_51.png

Ovulation 发表于 2025-3-30 15:12:05

http://reply.papertrans.cn/16/1532/153134/153134_52.png

GOAT 发表于 2025-3-30 19:40:32

http://reply.papertrans.cn/16/1532/153134/153134_53.png

NEG 发表于 2025-3-30 23:43:53

http://reply.papertrans.cn/16/1532/153134/153134_54.png

Strength 发表于 2025-3-31 04:17:52

http://reply.papertrans.cn/16/1532/153134/153134_55.png

Gleason-score 发表于 2025-3-31 08:02:13

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm,e algorithm that finds an exact solution. Combining our line-separable algorithm with techniques from the algorithm of Carmi et al. results in an .(....) time 22-approximate solution to the discrete unit disk cover problem.

痛恨 发表于 2025-3-31 11:18:01

Max-Coloring Paths: Tight Bounds and Extensions,g trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring a broad class of trees and show it can be solved in time .. When vertex weights belong to ℝ, we show a matching lower bound of Ω(|.|log|.|) in the algebraic computation tree model.

无节奏 发表于 2025-3-31 14:29:07

New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body,ew bound substantially improves the previous bound of . due to Abu-Affash and Katz, and brings us closer to the conjectured value of .. We also confirm the upper bound conjecture for centrally symmetric planar convex bodies.

aerobic 发表于 2025-3-31 17:56:10

http://reply.papertrans.cn/16/1532/153134/153134_59.png

Affable 发表于 2025-4-1 00:30:10

http://reply.papertrans.cn/16/1532/153134/153134_60.png
页: 1 2 3 4 5 [6] 7
查看完整版本: Titlebook: Algorithms and Computation; 20th International S Yingfei Dong,Ding-Zhu Du,Oscar Ibarra Conference proceedings 2009 Springer-Verlag Berlin H