2137 search results - page 90 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
119
click to vote
COR
2007
15 years 2 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
139
Voted
NIPS
2008
15 years 3 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
227
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
113
Voted
ESA
2006
Springer
15 years 5 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
107
Voted
CCCG
2008
15 years 3 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...