amnesia 发表于 2025-3-28 15:03:17

Christiane Lemke,Jakob Wiedekindwo endpoints is contained in .. A segment set . is stabbed by . if every segment of . is stabbed by .. We show that if . is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing . can be solved in polynomial time. We also prove that for general segments

STING 发表于 2025-3-28 20:04:07

http://reply.papertrans.cn/16/1532/153108/153108_42.png

加剧 发表于 2025-3-29 00:20:21

Manfred Gailus,Heinrich Volkmannssing any of the barriers. Sensors are initially located in the plane and they can . to the barriers. We assume that each sensor can detect any intruder in a circular area centered at the sensor. Given a set of barriers and a set of sensors located in the plane, we study three problems: the feasibil

大笑 发表于 2025-3-29 07:05:50

https://doi.org/10.1007/978-3-322-99757-9 interested in provable hard problems which have a big set of hard instances. Moreover, we consider efficient generators of these hard instances of the problems. Our investigation has possible applications in cryptography. As a first step, we consider computational problems from the . class..We exte

hemophilia 发表于 2025-3-29 09:30:39

http://reply.papertrans.cn/16/1532/153108/153108_45.png

ARCHE 发表于 2025-3-29 12:48:44

https://doi.org/10.1007/978-3-322-99757-9nism is truthful if no agent has an incentive to misreport her values on the tasks (agent .. reports a score .. for each task ..). The one-to-one version of this problem has already been studied by Dughmi and Ghosh in a setting where the weights .. are public knowledge, and the agents only repor

神秘 发表于 2025-3-29 18:14:18

Manfred Gailus,Heinrich Volkmannaph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The objective here is to maintain a clustering the never deviates too far in the objective function compared to the optimal solution. We give a constant competitive upper

袋鼠 发表于 2025-3-29 23:29:35

Paul G. Spirakis,Maria SernaFast track conference proceedings.State-of-the-art research.Up to date results

effrontery 发表于 2025-3-30 00:58:11

http://reply.papertrans.cn/16/1532/153108/153108_49.png

修正案 发表于 2025-3-30 06:23:58

http://reply.papertrans.cn/16/1532/153108/153108_50.png
页: 1 2 3 4 [5] 6
查看完整版本: Titlebook: Algorithms and Complexity; 8th International Co Paul G. Spirakis,Maria Serna Conference proceedings 2013 Springer-Verlag Berlin Heidelberg