35 search results - page 1 / 7 » Improved LP Lower Bounds for Difference Triangle Sets |
COMBINATORICS
1999
13 years 10 months ago
1999
STACS
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
FOCS
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
DM
2008
13 years 11 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...