353 search results - page 26 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
131
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
143
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
115
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
133
Voted
GECCO
2009
Springer
15 years 16 days ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
111
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...