12 search results - page 2 / 3 » Maximal Strip Recovery Problem with Gaps: Hardness and Appro... |
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
CPM
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...