2137 search results - page 141 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
134
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
130
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
137
Voted
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
176
Voted
CDC
2010
IEEE
15 years 3 days ago
2010
IEEE
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
135
click to vote
GC
2007
Springer
15 years 5 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...