841 search results - page 63 / 169 » Approximability of Minimum AND-Circuits |
137
click to vote
CAIP
2005
Springer
15 years 9 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
127
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
109
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
This paper compares two techniques for measuring the length of a digital curve. Both techniques (digital straight segment approximation, minimum length polygon) are known to be co...
167
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
138
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...