The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...