37 search results - page 3 / 8 » esa 2003 |
ESA
2003
Springer
14 years 4 months ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
ESA
2003
Springer
14 years 4 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
ESA
2003
Springer
14 years 4 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
ESA
2003
Springer
14 years 4 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
ESA
2003
Springer
14 years 4 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...