activity
20142026
most citedAlgorithms for Lipschitz Learning on Graphs

24 citations · 59 across the 29 of their papers we have counts for

collaborators
Showing 2022Show all

7 papers · 1 filter

cs.DS2022

Fast Algorithms for -Regression

Deeksha Adil, Rasmus Kyng, Richard Peng +1

The -norm regression problem is a classic problem in optimization with wide ranging applications in machine learning and theoretical computer science. The goal is to comput…

cs.DS2022

A Simple Framework for Finding Balanced Sparse Cuts via APSP

Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg +1

We present a very simple and intuitive algorithm to find balanced sparse cuts in a graph via shortest-paths. Our algorithm combines a new multiplicative-weights framework for solvi…

cs.DS2022

Derandomizing Directed Random Walks in Almost-Linear Time

Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg

In this article, we present the first deterministic directed Laplacian L systems solver that runs in time almost-linear in the number of non-zero entries of L. Previous reductions…

cs.DS2022★ 12 cited

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

Li Chen, Rasmus Kyng, Yang P. Liu +3

We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with edges and polynomially bounded integral demands, costs, and capacities in…

cs.DS2022

Maintaining Expander Decompositions via Sparse Cuts

Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg +1

In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made effic…

cs.CC2022

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg +1

We study linear equations in combinatorial Laplacians of -dimensional simplicial complexes (-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacian…

cs.CC2022

Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions

Ming Ding, Rasmus Kyng, Peng Zhang

We give a nearly-linear time reduction that encodes any linear program as a 2-commodity flow problem with only a small blow-up in size. Under mild assumptions similar to those empl…