Approximating the longest increasing subsequence in a stream
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.