1090 search results - page 83 / 218 » Priority Algorithms for Graph Optimization Problems |
140
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
154
click to vote
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
132
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
128
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
161
Voted
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...