227 search results - page 8 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
NETWORKS
2010
13 years 6 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
CVPR
2009
IEEE
14 years 12 months ago
2009
IEEE
Color is a powerful visual cue for many computer vision
applications such as image segmentation and object recognition.
However, most of the existing color models depend on the i...
ECCC
2006
13 years 7 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
DISOPT
2006
13 years 7 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...