489 search results - page 40 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
SIBGRAPI
2005
IEEE
14 years 2 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
CCCG
2007
13 years 10 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...