1389 search results - page 65 / 278 » Improved Approximation Algorithms for Label Cover Problems |
158
click to vote
IPCO
2008
15 years 4 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
119
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
119
click to vote
JUCS
2007
15 years 2 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
111
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
148
click to vote
FOCS
2008
IEEE
15 years 3 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...