1101 search results - page 28 / 221 » An Algorithm for the Graph Crossing Number Problem |
CORR
2011
Springer
13 years 1 days ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
SI3D
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COMPGEOM
1995
ACM
14 years 1 days ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
ICALP
2001
Springer
14 years 29 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...