Hooni's Playground

A Common C.S. Researcher

[카테고리:] Drink

작성중.너무 맛있는거 아닌가

Drink Leave a comment

Sparsifying generalized linear models. (arXiv:2311.18145v1 [cs.DS])
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$-$t$ Shortest Path, and Minimum-Cost Flow. (arXiv:2311.18295v1 [cs.DS])
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. (arXiv:2208.04180v3 [cs.LO] UPDATED)
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching. (arXiv:2302.05633v2 [cs.DS] UPDATED)
4/3-Approximation of Graphic TSP. (arXiv:2305.05411v5 [cs.DS] UPDATED)
Sparsifying sums of norms. (arXiv:2305.09049v2 [cs.DS] UPDATED)
An Alternate Proof of Near-Optimal Light Spanners. (arXiv:2305.18647v4 [cs.DS] UPDATED)
A simpler and parallelizable $O(\sqrt{\log n})$-approximation algorithm for Sparsest Cut. (arXiv:2307.00115v3 [cs.DS] UPDATED)
Fast and Practical Quantum-Inspired Classical Algorithms for Solving Linear Systems. (arXiv:2307.06627v2 [cs.DS] UPDATED)
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover. (arXiv:2307.08149v2 [cs.CC] UPDATED)

Go to top