Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing
A Bernstein, MP Gutenberg… - 2020 IEEE 61st Annual …, 2020 - ieeexplore.ieee.org
Let G=(V, E, w) be a weighted, directed graph subject to a sequence of adversarial edge
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …
deletions. In the decremental single-source reachability problem (SSR), we are given a fixed …
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
R van Bevern, VA Slugina - Historia Mathematica, 2020 - Elsevier
One of the most fundamental results in combinatorial optimization is the polynomial-time 3/2-
approximation algorithm for the metric traveling salesman problem. It was presented by …
approximation algorithm for the metric traveling salesman problem. It was presented by …
Deterministic algorithms for decremental shortest paths via layered core decomposition
J Chuzhoy, T Saranurak - Proceedings of the 2021 ACM-SIAM Symposium on …, 2021 - SIAM
In the decremental single-source shortest paths (SSSP) problem, the input is an undirected
graph G=(V, E) with n vertices and m edges undergoing edge deletions, together with a fixed …
graph G=(V, E) with n vertices and m edges undergoing edge deletions, together with a fixed …
Term grouping and travelling salesperson for digital quantum simulation
Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is
the initially proposed application of quantum computing. The large number of quantum gates …
the initially proposed application of quantum computing. The large number of quantum gates …
Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multi-Agent Systems
In this article, we present a novel approach, namely distributed matching-by-clone
hungarian-based algorithm (DMCHBA), to multiagent task-allocation problems, in which the …
hungarian-based algorithm (DMCHBA), to multiagent task-allocation problems, in which the …
Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver
P Chalermsook, CC Huang, D Nanongkai… - arXiv preprint arXiv …, 2022 - arxiv.org
In the $ k $-edge-connected spanning subgraph ($ k $ ECSS) problem, our goal is to
compute a minimum-cost sub-network that is resilient against up to $ k $ link failures: Given …
compute a minimum-cost sub-network that is resilient against up to $ k $ link failures: Given …
Sublinear algorithms and lower bounds for metric tsp cost estimation
We consider the problem of designing sublinear time algorithms for estimating the cost of a
minimum metric traveling salesman (TSP) tour. Specifically, given access to a $ n\times n …
minimum metric traveling salesman (TSP) tour. Specifically, given access to a $ n\times n …
Fast LP-based approximations for geometric packing and covering problems
We derive fast approximation schemes for LP relaxations of several well-studied geometric
optimization problems that include packing, covering, and mixed packing and covering …
optimization problems that include packing, covering, and mixed packing and covering …
On approximating (sparse) covering integer programs
We consider approximation algorithms for covering integer programs of the form min〈 c, x〉
over x∊ ℤ≥ 0 n st Ax≥ b and x≤ d; where A∊ ℝ≥ 0 m× n, b∊ ℝ≥ 0 m, and c, d∊ ℝ≥ 0 n …
over x∊ ℤ≥ 0 n st Ax≥ b and x≤ d; where A∊ ℝ≥ 0 m× n, b∊ ℝ≥ 0 m, and c, d∊ ℝ≥ 0 n …
Randomized MWU for positive LPs
We describe and analyze a simple randomized multiplicative weight update (MWU) based
algorithm for approximately solving positive linear programming problems, in particular …
algorithm for approximately solving positive linear programming problems, in particular …