2137 search results - page 228 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
151
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
160
click to vote
ISMIR
2004
Springer
15 years 11 months ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
159
click to vote
COR
2006
15 years 6 months ago
2006
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
193
click to vote
ECEASST
2006
15 years 6 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
200
click to vote
INFORMS
1998
15 years 6 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...