AAIM
2009
Springer
14 years 6 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
AAIM
2009
Springer
14 years 6 months ago
2009
Springer
