1101 search results - page 80 / 221 » An Algorithm for the Graph Crossing Number Problem |
102
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
165
click to vote
NETWORKS
2002
15 years 4 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
154
click to vote
JDA
2006
15 years 4 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
126
click to vote
LOPSTR
2004
Springer
15 years 10 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
157
click to vote
JCO
1998
15 years 4 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...