Sciweavers

WAOA
2007
Springer
106views Algorithms» more  WAOA 2007»
14 years 6 months ago
Full and Local Information in Distributed Decision Making
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
Panagiota N. Panagopoulou, Paul G. Spirakis
WAOA
2007
Springer
120views Algorithms» more  WAOA 2007»
14 years 6 months ago
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawre...
WAOA
2007
Springer
103views Algorithms» more  WAOA 2007»
14 years 6 months ago
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
How should a seller price his goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his bud...
Robert Krauthgamer, Aranyak Mehta, Atri Rudra
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 6 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
14 years 6 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
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...
José R. Correa, Cristina G. Fernandes, Mart...
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
14 years 6 months ago
Approximating Largest Convex Hulls for Imprecise Points
Maarten Löffler, Marc J. van Kreveld
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
14 years 6 months ago
Buyer-Supplier Games: Optimization over the Core
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...
Nedialko B. Dimitrov, C. Greg Plaxton
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 6 months ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
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...
Leah Epstein, Rob van Stee
WAOA
2007
Springer
104views Algorithms» more  WAOA 2007»
14 years 6 months ago
On the Online Unit Clustering Problem
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh
Leah Epstein, Rob van Stee