[图书][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 …
Approximation algorithms for the unsplittable flow problem
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 …
graphs. As is standard in this line of research, we assume that the maximum demand is at …
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 …
Approximation algorithms for the unsplittable flow problem
We present approximation algorithms for the unsplittable flow problem (UFP) on undirected
graphs. As is standard in this line of research, we assume that the maximum demand is at …
graphs. As is standard in this line of research, we assume that the maximum demand is at …
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) …
An approximation algorithm for the disjoint paths problem in even-degree planar graphs
J Kleinberg - 46th Annual IEEE Symposium on Foundations of …, 2005 - ieeexplore.ieee.org
In joint work with Eva Tardos in 1995, we asked whether it was possible to obtain a
polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in …
polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in …
Edge disjoint paths in moderately connected graphs
We study the edge disjoint paths (EDP) problem in undirected graphs: Given a graph G with
n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using …
n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using …
Approximation algorithms for edge-disjoint paths and unsplittable flow
T Erlebach - Efficient Approximation and Online Algorithms: Recent …, 2006 - Springer
In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set
of requests (pairs of vertices), and the goal is to connect as many requests as possible along …
of requests (pairs of vertices), and the goal is to connect as many requests as possible along …
LS (Graph): a constraint-based local search for constraint optimization on trees and paths
Constrained optimum tree (COT) and constrained optimum path (COP) problems arise in
many real-life applications and are ubiquitous in communication networks. They have been …
many real-life applications and are ubiquitous in communication networks. They have been …
Finding edge-disjoint paths in networks: An ant colony optimization algorithm
One of the basic operations in communication networks consists in establishing routes for
connection requests between physically separated network nodes. In many situations, either …
connection requests between physically separated network nodes. In many situations, either …