Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems

Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems (1998)

by Stavros G. Kolliopoulos

Citations:

5 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems	user correction - Legacy Corrections
AUTHOR NAME	Stavros G. Kolliopoulos	user correction
AUTHOR AFFIL	DARTMOUTH COLLEGE	user correction
AUTHOR ADDR	Hanover, New Hampshire	user correction
ABSTRACT	Network flow problems form a core area of Combinatorial Optimization. Their significance arises both from their very large number of applications and their theoretical importance. This thesis focuses on efficient exact algorithms for network flow problems in P and on approximation algorithms for NP -hard variants such as disjoint paths and unsplittable flow. Given an n-vertex	user correction
YEAR	1998	SVM HeaderParse 0.1
CITATIONS	102 found	ParsCit 1.0