415 search results - page 30 / 83 » An efficient approximation for the Generalized Assignment Pr... |
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
CP
2008
Springer
13 years 10 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
BTW
2007
Springer
14 years 15 days ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...