Approximate min-sum subset convolution

Cites work

scientific article; zbMATH DE number 5899282 (Why is no real title available?)
A subquadratic approximation scheme for partition
All pairs shortest paths using bridging sets and rectangular matrix multiplication
All-pairs bottleneck paths in vertex weighted graphs
An application of simultaneous diophantine approximation in combinatorial optimization
Approximate monotone local search for weighted problems
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
Better approximations for tree sparsity in nearly-linear time
Deterministic APSP, orthogonal vectors, and more: quickly derandomizing Razborov-Smolensky
Exact exponential algorithms.
Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
Faster all-pairs shortest paths via circuit complexity
Faster exponential-time approximation algorithms using approximate monotone local search
Faster scaling algorithms for general graph matching problems
Fourier meets M\"{o}bius: fast subset convolution
Lossy kernelization
Necklaces, Convolutions, and X + Y
New scaling algorithms for the assignment and minimum mean cycle problems
New tools and connections for exponential-time approximation
On Steiner trees and minimum spanning trees in hypergraphs
On problems equivalent to \((\min,+)\)-convolution
Optimally repurposing existing algorithms to obtain exponential-time approximations
Parameterized algorithms
Scaling Algorithms for the Shortest Paths Problem
Scaling algorithms for network problems
Scaling algorithms for weighted matching in general graphs
Set partitioning via inclusion-exclusion
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
Super-polynomial approximation branching algorithms
The steiner problem in graphs
Zero knowledge and the chromatic number

This page was built for publication: Approximate min-sum subset convolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974407)