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

Bundit Laekhanukit Shayan Oveis Gharan Mohit Singh

Published in: CoRR (2012)

Keyphrases

small size
neural network
linear programming
monte carlo
approximation algorithms
maximum clique
constant factor
sampling algorithm
random sampling
sample size
maximum number
upper bound
np hard
sampling methods
sampled data
data structure
data mining