Sciweavers

Share
JCO
2008
66views more  JCO 2008»
9 years 3 months ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
Orion Chassid, Leah Epstein
IANDC
2008
92views more  IANDC 2008»
9 years 3 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
ATAL
2010
Springer
9 years 4 months ago
Strategy-proof allocation of multiple items between two agents without payments or priors
We investigate the problem of allocating items (private goods) among competing agents in a setting that is both prior-free and paymentfree. Specifically, we focus on allocating mu...
Mingyu Guo, Vincent Conitzer
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
9 years 5 months ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
9 years 5 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
9 years 5 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
9 years 5 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
SIROCCO
2007
9 years 5 months ago
Why Robots Need Maps
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
Miroslaw Dynia, Jakub Lopuszanski, Christian Schin...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
9 years 5 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
FSTTCS
2000
Springer
9 years 7 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
books