Titlebook: Algorithms and Complexity; 8th International Co Paul G. Spirakis,Maria Serna Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

Circumscribe

共同給與

Michael Stahlmann,Walter Wendt-Kleinbergd Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion Games the player cost is the sum of latencies of the

Expurgate

TAG

K?mpfe um die Autonomie der Medizin.: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying undirected graph contains only one sink. Motivated by NP-hardness and hardness of approximation results, we consider the parameterized complexity of this problem. We show

連接

Gottfried Schweiger,Michael Peitlert implementations), yet hard to invert almost everywhere. A necessary condition for the latter property is to be “sufficiently distant” from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that four common measures, ., and ., are incomparable in th

谷物

持久

https://doi.org/10.1007/978-3-658-26578-6n, Garey, and Johnson motivated by the dynamic storage problem. Bar-Noy et al. have studied packing of unit fraction items (i.e., items with length 1/. for some integer .?≥?1), motivated by the window scheduling problem. In this paper, we extend the study of 2-D and 3-D dynamic bin packing problem t

ALIAS

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.), whe

流利圓滑

Conflagration