Sciweavers

16596 search results - page 53 / 3320
» Generalized Assignment Problems
Sort
View
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 7 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
AAAI
2000
15 years 3 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
EOR
2007
77views more  EOR 2007»
15 years 2 months ago
A review of congestion models in the location of facilities with immobile servers
Capacity effects are investigated, particularly as regards congestion of facilities with immobile (or fixed) servers. A review is given of research to date in this area, togethe...
Brian Boffey, Roberto D. Galvão, Luis Gonza...
FOCS
2008
IEEE
15 years 3 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 4 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar