[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Multicommodity flow, well-linked terminals, and routing problems
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 …
graphs. The input to each problem is a capacitated graph G=(V, E) and a set Τ of node pairs …
Improved bounds for the unsplittable flow problem
P Kolman, C Scheideler - Journal of Algorithms, 2006 - Elsevier
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected
network G=(V, E) with edge capacities and a set of terminal pairs (or requests) with …
network G=(V, E) with edge capacities and a set of terminal pairs (or requests) with …
The all-or-nothing multicommodity flow problem
We consider the all-or-nothing multicommodity flow problem in general graphs. We are
given a capacitated undirected graph G=(V, E, u) and set of k pairs s 1 t 1, s 2 t 2,…, sktk …
given a capacitated undirected graph G=(V, E, u) and set of k pairs s 1 t 1, s 2 t 2,…, sktk …
Edge-disjoint paths revisited
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 …
was seemingly settled by an Ω (m 1/2-ϵ)-hardness result of Guruswami et al.[2003], and an …
Unsplittable flow in paths and trees and column-restricted packing integer programs
We consider the unsplittable flow problem (UFP) and the closely related column-restricted
packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G=(V, E) …
packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G=(V, E) …
Combinatorial algorithms for the unsplittable flow problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either
match or improve the previously best results. In the UFP we are given a (possibly directed) …
match or improve the previously best results. In the UFP we are given a (possibly directed) …
Randomized rounding algorithms for large scale unsplittable flow problems
Unsplittable flow problems cover a wide range of telecommunication and transportation
problems and their efficient resolution is key to a number of applications. In this work, we …
problems and their efficient resolution is key to a number of applications. In this work, we …
The all-or-nothing multicommodity flow problem
We consider the all-or-nothing multicommodity flow problem in general graphs. We are
given a capacitated undirected graph G=(V,E,u) and a set of k node pairs s_1t_1,s_2t_2 …
given a capacitated undirected graph G=(V,E,u) and a set of k node pairs s_1t_1,s_2t_2 …
[PDF][PDF] Edge-Disjoint Paths and Unsplittable Flow.
SG Kolliopoulos - 2007 - cgi.di.uoa.gr
Finding disjoint paths in graphs is a problem that has attracted considerable attention from at
least three perspectives: graph theory, VLSI design and network routing/flow. The …
least three perspectives: graph theory, VLSI design and network routing/flow. The …