SODA
2008
ACM
14 years 1 months ago
2008
ACM
SODA
2008
ACM
14 years 1 months ago
2008
ACM
SODA
2008
ACM
14 years 1 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
SODA
2008
ACM
14 years 1 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
SODA
2008
ACM
14 years 1 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
SODA
2008
ACM
14 years 1 months ago
2008
ACM
SODA
2008
ACM
14 years 1 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
SODA
2008
ACM
14 years 1 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
SODA
2008
ACM
14 years 1 months ago
2008
ACM
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
SODA
2008
ACM
14 years 1 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...