1672 search results - page 4 / 335 » Tightness problems in the plane |
MFCS
2005
Springer
14 years 29 days ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
NIPS
2004
13 years 8 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
SIU
2002
13 years 7 months ago
2002
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes