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

Counteract

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.

入會(huì)

品嘗你的人

Four Measures of Nonlinearity,e sense that for each pair of measures, ..,.., there exist functions ..,.. with ..(..)?>?..(..) but ..(..)?

PALL

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?[Algorithmica 56(2), 236–269 (2010)] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments.

AVOID

Adulterate

Algorithms and Complexity978-3-642-38233-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

物種起源

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

江湖郎中

978-3-642-38232-1Springer-Verlag Berlin Heidelberg 2013

Concomitant