We consider the problem of maximizing a non-negative submodular set function f: 2N-> RR+
over a ground set N subject to a variety of packing type constraints including (multiple) …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We give a general technique to obtain approximation mechanisms that are truthful in
expectation. We show that for packing domains, any α-approximation algorithm that also …

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We
target surface codes, which form a two-dimensional grid of logical qubits with nearest …

We consider requests for capacity in a given tree network T=(V, E) where each edge e of the
tree has some integer capacity u e. Each request f is a node pair with an integer demand df …

We present approximation algorithms for the unsplittable flow problem (UFP) in undirected
graphs. As is standard in this line of research, we assume that the maximum demand is at …

We study multicommodity routing problems in both edge and node capacitated undirected
graphs. The input to each problem is a capacitated graph G=(V, E) and a set Τ of node pairs …

In the PLANAR DISJOINT PATHS problem, one is given an undirected planar graph with a
set of k vertex pairs \left(s_i,t_i\right) and the task is to find k pairwise vertex-disjoint paths …

The approximability of the maximum edge-disjoint paths problem (EDP) in directed graphs
was seemingly settled by an Ω (m 1/2-ϵ)-hardness result of Guruswami et al.[2003], and an …

In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected n-
vertex graph G, and a collection M={(s 1, t 1),…,(sk, tk)} of pairs of its vertices, called source …