121 search results - page 15 / 25 » Optimal Group Manipulation in Facility Location Problems |
TCS
2010
14 years 10 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
109
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
97
Voted
FSR
2003
Springer
15 years 4 months ago
2003
Springer
We describe a mobile robot system, designed to assist residents of an retirement facility. This system is being developed to respond to an aging population and a predicted shortage...