Counteract
发表于 2025-3-25 04:36:52
https://doi.org/10.1007/978-3-322-99757-9t the tasks they are able to perform. We study here the case where the weights are private data. We are interested in the best approximation ratios that can be achieved by a truthful mechanism. In particular, we investigate the problem under various assumptions on the way the agents can misreport the weights.
入会
发表于 2025-3-25 11:15:51
http://reply.papertrans.cn/16/1532/153108/153108_22.png
品尝你的人
发表于 2025-3-25 12:34:26
Four Measures of Nonlinearity,e sense that for each pair of measures, ..,.., there exist functions ..,.. with ..(..) > ..(..) but ..(..) < ..(..). We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions.
PALL
发表于 2025-3-25 18:58:34
New Results on Stabbing Segments with a Polygon, the problem is NP-hard. Further, an adaptation of our polynomial-time algorithm solves an open problem posed by Löffler and van Kreveld about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.
AVOID
发表于 2025-3-25 21:11:03
http://reply.papertrans.cn/16/1532/153108/153108_25.png
Adulterate
发表于 2025-3-26 03:22:19
Algorithms and Complexity978-3-642-38233-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
物种起源
发表于 2025-3-26 04:28:24
https://doi.org/10.1007/978-3-322-98943-7s problem runs in time .(..) and requires .(..) memory. We present a simple greedy algorithm that approximates the optimum solution within a factor of 2 and show that our analysis is tight. Our algorithm runs in time .(.. log.) and needs only .(.) memory. In fact, the running time is .(...log.), where .. is the minimum number of gaps.
GRUEL
发表于 2025-3-26 08:51:06
http://reply.papertrans.cn/16/1532/153108/153108_28.png
江湖郎中
发表于 2025-3-26 12:49:07
978-3-642-38232-1Springer-Verlag Berlin Heidelberg 2013
Concomitant
发表于 2025-3-26 19:26:37
http://reply.papertrans.cn/16/1532/153108/153108_30.png