SODA
2003
ACM
13 years 11 months ago
2003
ACM
SODA
2003
ACM
13 years 11 months ago
2003
ACM
SODA
2003
ACM
13 years 11 months ago
2003
ACM
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
SODA
2003
ACM
13 years 11 months ago
2003
ACM
SODA
2003
ACM
13 years 11 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...