728 search results - page 83 / 146 » Compressing combinatorial objects |
FSE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
111
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
93
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
98
Voted
AAIM
2006
Springer
15 years 6 months ago
2006
Springer
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
110
click to vote
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...