Proportionally dense subgraph of maximum size: complexity and approximation.
Janka ChlebíkováCristina BazganClément DallardThomas PontoizeauPublished in: CoRR (2019)
Keyphrases
- space complexity
- approximation error
- maximum number
- computational complexity
- network size
- memory requirements
- worst case time complexity
- error tolerance
- approximation algorithms
- worst case
- increase in computational complexity
- small size
- space requirements
- closed form
- approximation methods
- decision problems
- stereo matching
- exponential size
- video sequences
- learning algorithm