ESA
2006
Springer
13 years 8 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We study congestion games where players aim to access a set of resources. Each player has a set of possible strategies and each resource has a function associating the latency it i...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...