612 search results - page 102 / 123 » Hardness assumptions in the foundations of theoretical compu... |
GIS
2010
ACM
13 years 2 months ago
2010
ACM
With the prevalence of car navigation systems, indoor navigation systems are increasingly attracting attention in the indoor research area. However, the available models for indoo...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
FOCS
2002
IEEE
14 years 20 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...