3092 search results - page 520 / 619 » Where are you pointing |
GD
2003
Springer
14 years 2 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
SIGUCCS
2000
ACM
14 years 1 months ago
2000
ACM
Creating a university Help Center from scratch can be a challenging yet very rewarding experience for an IT professional. Buying computers, building networks, and installing softw...
HPDC
1999
IEEE
14 years 1 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...