1404 search results - page 89 / 281 » Optimization problems in multiple-interval graphs |
136
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
130
click to vote
COR
2008
15 years 3 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
134
click to vote
ESA
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
120
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
119
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...