464 search results - page 9 / 93 » Improved Fixed-Parameter Algorithms for Two Feedback Set Pro... |
ESA
2011
Springer
12 years 6 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
GBRPR
2005
Springer
14 years 7 days ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
JMLR
2006
13 years 6 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
ESA
2003
Springer
13 years 12 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
EVOW
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...