The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs

First Author: Chekuri C
Attributed to:  The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-319-07557-0_19

Publication URI: http://dx.doi.org/10.1007/978-3-319-07557-0_19

Type: Book Chapter

Book Title: Integer Programming and Combinatorial Optimization (2014)

Page Reference: 222-233

ISBN: 978-3-319-07556-3

ISSN: 2731-0469