@InProceedings{adil_et_al:LIPIcs.ICALP.2021.9, author = {Adil, Deeksha and Bullins, Brian and Kyng, Rasmus and Sachdeva, Sushant}, title = {{Almost-Linear-Time Weighted 𝓁\underlinep-Norm Solvers in Slightly Dense Graphs via Sparsification}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.9}, URN = {urn:nbn:de:0030-drops-140782}, doi = {10.4230/LIPIcs.ICALP.2021.9}, annote = {Keywords: Weighted 𝓁\underlinep-norm, Sparsification, Spanners, Iterative Refinement} }