119 search results - page 9 / 24 » stoc 2010 |
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
117
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...