Sciweavers

5153 search results - page 472 / 1031
» Introduction to Randomized Algorithms
Sort
View
248
Voted
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
16 years 17 days ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
ICALP
2005
Springer
15 years 12 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
PARLE
1991
15 years 10 months ago
FORK: A High-Level Language for PRAMs
We present a new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM). The language attempts to satisfy two p...
Torben Hagerup, Arno Schmitt, Helmut Seidl
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase