SODA
2003
ACM
13 years 6 months ago
2003
ACM
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We propose an algorithm to compute a conforming Delaunay mesh of a polyhedral domain in three dimensions. Arbitrarily small input angles are allowed. The output mesh is graded and...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 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 6 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 6 months ago
2003
ACM
SODA
2003
ACM
13 years 6 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...