WAOA
2007
Springer
15 years 12 days ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
WAOA
2007
Springer
15 years 12 days ago
2007
Springer
