1404 search results - page 65 / 281 » Optimization problems in multiple-interval graphs |
105
click to vote
SODA
1992
ACM
14 years 11 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...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
PR
2007
14 years 9 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
CADE
2012
Springer
13 years 4 days ago
2012
Springer
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
107
click to vote
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...