4843 search results - page 184 / 969 » The Shortcut Problem - Complexity and Approximation |
107
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
125
click to vote
ALGORITHMICA
1999
15 years 3 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
129
Voted
IPL
2002
15 years 3 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
142
click to vote
PVLDB
2010
15 years 1 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
124
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...