3875 search results - page 654 / 775 » Approximation algorithms for the 0-extension problem |
151
click to vote
EOR
2007
15 years 4 months ago
2007
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
131
click to vote
JACM
2007
15 years 4 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
146
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
128
click to vote
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...