1871 search results - page 44 / 375 » The Ephemeral Pairing Problem |
HEURISTICS
2002
14 years 11 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...
COMPGEOM
1997
ACM
15 years 3 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
121
click to vote
CCCG
2006
15 years 16 days ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
LATA
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
100
Voted
NETWORKS
2007
14 years 10 months ago
2007
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...