Sciweavers

2796 search results - page 2 / 560
» The coolest path problem
Sort
View
ORL
2007
82views more  ORL 2007»
13 years 4 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
13 years 12 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
EVOW
2001
Springer
13 years 10 months ago
Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem
This contribution investigates the usefulness of F. Glover’s path tracing concept within a Genetic Algorithm context for the solution of the multiconstrained knapsack problem (MK...
Jens Levenhagen, Andreas Bortfeldt, Hermann Gehrin...
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
14 years 1 days ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
COMCOM
1999
87views more  COMCOM 1999»
13 years 5 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang