3875 search results - page 44 / 775 » Approximation Algorithms for the Max-coloring Problem |
IJCGA
2002
13 years 8 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
TOC
2008
13 years 8 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
ALGORITHMICA
2011
13 years 3 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...