251 search results - page 22 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
SIAMCOMP
2008
13 years 7 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
TIME
2002
IEEE
14 years 15 days ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...