StringologyTimes

Data Structures and Algorithms: 2021/4/29-31

1: Verified Approximation Algorithms
2: Faster 3-coloring of small-diameter graphs
3: A 0.502$\cdot$MaxCut Approximation using Quadratic Programming
4: Deterministic Algorithms for the Hidden Subgroup Problem
5: Reverse Shortest Path Problem for Unit-Disk Graphs
6: Improved Kernels for Edge Modification Problems
7: Algorithms for the Line-Constrained Disk Coverage and Related Problems
8: Traceability Technology Adoption in Supply Chain Networks
9: PSEUDo: Interactive Pattern Search in Multivariate Time Series with Locality-Sensitive Hashing and Relevance Feedback
10: Memory Bounds for Concurrent Bounded Queues