Sciweavers

374 search results - page 2 / 75
» Lower-bounded facility location
Sort
View
79
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 9 months ago
On Pure and (approximate) Strong Equilibria of Facility Location Games
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
Thomas Dueholm Hansen, Orestis Telelis
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
COCOON
2004
Springer
15 years 1 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
100
Voted
COMGEO
2008
ACM
14 years 9 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
78
Voted
TPDS
1998
92views more  TPDS 1998»
14 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu