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 …

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 …

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 …

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 …

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 …

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 …

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 …

We derive fast approximation schemes for LP relaxations of several well-studied geometric
optimization problems that include packing, covering, and mixed packing and covering …

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 …

We describe and analyze a simple randomized multiplicative weight update (MWU) based
algorithm for approximately solving positive linear programming problems, in particular …