5595 search results - page 84 / 1119 » Approximation Algorithms for Clustering Problems |
155
click to vote
DAM
2006
15 years 4 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
117
Voted
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
Pattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-...
134
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
157
click to vote
SIAMCO
2002
15 years 4 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
139
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...