10 citations · 20 across the 15 of their papers we have counts for
7 papers · 1 filter
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu
We give an time algorithm for minimum cost flow with capacities bounded by and costs bounded by . For sparse graphs with genera…
Decomposable Submodular Function Minimization via Maximum Flow
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee +2
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide impro…
Fast and Simple Modular Subset Sum
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann +4
We revisit the Subset Sum problem over the finite cyclic group for some given integer . A series of recent works has provided near-optimal algorithms for this pro…
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu
We present an -time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where is the maximum absolute value of any edge weight…
Fast Modular Subset Sum using Linear Sketching
Kyriakos Axiotis, Arturs Backurs, Christos Tzamos
Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum…
Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms
Kyriakos Axiotis, Christos Tzamos
One of the most fundamental problems in Computer Science is the Knapsack problem. Given a set of n items with different weights and values, it asks to pick the most valuable subset…
On the Size and the Approximability of Minimum Temporally Connected Subgraphs
Kyriakos Axiotis, Dimitris Fotakis
We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of mi…