Titlebook: Automata, Languages, and Programming; 39th International C Artur Czumaj,Kurt Mehlhorn,Roger Wattenhofer Conference proceedings 2012 Springe

genesis

Secretary Problems with Convex Costsunder various feasibility constraints and present online algorithms with competitive ratios only a constant factor worse than those known in the absence of costs for the same feasibility constraints. We also consider a multi-dimensional version of the problem that generalizes multi-dimensional knaps

FAST

Nearly Simultaneously Resettable Black-Box Zero Knowledgeumber of times. The main contribution of our construction is that the round complexity is independent of the above bound. To achieve our result, we construct a constant-round nearly simultaneously resettable coin-flipping protocol that we believe is of independent interest.

親愛

Chagrin

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraintsime. This problem is a natural extension of two well-studied streams of earlier work: the first is on online set cover algorithms (in particular for the max coverage version) while the second is on approximately maximizing submodular functions under a matroid constraint..In this paper, we present th

Harbor

阻礙

bronchiole

ALIAS

PANIC

https://doi.org/10.1007/978-3-658-01870-2orithms and evidence for the hardness of approximating these problems..We consider an SDP relaxation obtained by adding constraints to the natural eigenvalue (or SDP) relaxation for this problem. Using this, we obtain an . approximation algorithm for QP-ratio. We also give a . approximation for bipa

預(yù)感