14 search results - page 2 / 3 » On minimum reload cost paths, tours and flows |
EMMCVPR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
HEURISTICS
2002
13 years 5 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
MOBICOM
2006
ACM
13 years 11 months ago
2006
ACM
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
ISCC
2005
IEEE
13 years 11 months ago
2005
IEEE
The volume of higher priority Internet applications is increasing as the Internet continues to evolve. Customers require Quality of Service (QoS) guarantees with not only guarante...
NETWORKS
2002
13 years 5 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 ...