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...
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...
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...
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...
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 ...