scientific article; zbMATH DE number 7561512
From MaRDI portal
Publication:5091168
DOI10.4230/LIPIcs.ICALP.2019.19MaRDI QIDQ5091168
Christos Tzamos, Kyriakos Axiotis
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.06440
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Unnamed Item ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ More on change-making and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The union-closed sets conjecture almost holds for almost all random bipartite graphs
- Geometric applications of a matrix-searching algorithm
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- The concave least-weight subsequence problem revisited
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
- A Faster Pseudopolynomial Time Algorithm for Subset Sum
- A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
- Better Approximations for Tree Sparsity in Nearly-Linear Time
- On the Configuration-LP of the Restricted Assignment Problem
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- On Problems Equivalent to (min,+)-Convolution
- Fast algorithms for knapsack via convolution and prediction
- Faster all-pairs shortest paths via circuit complexity
This page was built for publication:
