A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem.

Bundit Laekhanukit Shayan Oveis Gharan Mohit Singh

Published in: ICALP (1) (2012)

Keyphrases

computational complexity
small size
frequent subgraph mining
data sets
search space
np hard
sample size
monte carlo
neural network
approximation algorithms
random sampling
sampling algorithm
sampling strategy
random sample
constant factor
minimum length