64 search results - page 13 / 13 » Algorithms for Secretary Problems on Graphs and Hypergraphs |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
ECCC
2006
13 years 7 months ago
2006
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...