823 search results - page 141 / 165 » Brick partitions of graphs |
128
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
151
Voted
NIPS
2004
15 years 3 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
140
Voted
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
124
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
112
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...