40 search results - page 5 / 8 » On the perimeter of fat objects |
72
Voted
GIS
1995
ACM
15 years 1 months ago
1995
ACM
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
76
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
DM
2010
14 years 9 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
WAOA
2010
Springer
14 years 7 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
109
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...