Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme.
Danupon NanongkaiThatchaphol SaranurakSorrachai YingchareonthawornchaiPublished in: CoRR (2019)
Keyphrases
- polynomial time approximation
- error bounds
- approximation schemes
- closed form
- pairwise
- connected components
- randomized approximation
- polynomial approximation
- detection scheme
- objective function
- small number
- computational complexity
- representation scheme
- routing protocol
- approximation error
- lower bound
- search algorithm