Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...