SUBMODULAR FUNCTIONS AN D 0PTIMlZATl0N
ANNALS OF DISCRETE MATHEMATICS
47
General Editor: Peter L. HAMMER Rutgers Un...
28 downloads
1249 Views
11MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
SUBMODULAR FUNCTIONS AN D 0PTIMlZATl0N
ANNALS OF DISCRETE MATHEMATICS
47
General Editor: Peter L. HAMMER Rutgers University, New Brunswick, NJ, U.S.A.
Advisory Editors: C. BERGE, Universite de Paris, France R.L. GRAHAM, AT&T Bell Laboratories, NJ, U.S.A. M.A. HARRISON, University of California, Berkeley, CA, U.S.A. V. KLEE, University of Washington, Seattle, WA, U.S.A. J.H. VAN LINT California Institute of Technology, Pasadena, CA, U.S.A. G.C. ROTA, Massachusetts Institute of Technology, Cambridge, M.A., U.S.A. 7: TROTTER, Arizona State University, Tempe, AZ, U.S.A.
SUBMODULAR FUNCTIONS AND OPTIMIZATION
Satoru FUJlSHlGE Institute of Socio-Economic Planning University of Tsukuba Tsukuba, lbaraki 305 Japan
1991
NORTH-HOLLAND -AMSTERDAM
NEW YORK
OXFORD TOKYO
ELSEVIER SCIENCE PUBLISHERS B.V. Sara Burgerhartstraat 25 P.O. Box 211, 1000 AE Amsterdam, The Netherlands Distributors for the U.S.A. and Canada:
ELSEVIER SCIENCE PUBLISHING COMPANY, INC. 655 Avenue of the Americas New York, N.Y. 10010, U.S.A.
L i b r a r y of C o n g r e s s Cataloging-in-Publication
Data
Fujlshige, Satoru. S u b m o d u l a r f u n c t i o n s and o p t i m i z a t i o n I S a t o r u Fujlshige. p. cn. -- ( A n n a l s of d i s c r e t e m a t h e m a t i c s ; 47) I n c l u d e s bibliographical r e f e r e n c e s and index. ISBN 0-444-88656-0 1. S u b m o d u l a r functions. 2. C o m b l n a t o r l a l optimization. I. Title. 11. S e r i e s . PA166.6.FB5 1991 511'.6--dc20 90-21566 CIP
ISBN: 0 444 88556 0
0 ELSEVIER SCIENCE PUBLISHERS B.V., 1991 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior written permission of the publisher, Elsevier Science Publishers B.V. / Physical Sciences and Engineering Division, PO. Box 103, 7000 AC Amsterdam, The Netherlands. Special regulations for readers in the U.S.A. - This publication has been registered with the Copyright Clearance Center Inc. (CCCI, Salem, Massachusetts. Information can be obtained from the CCC about conditions under which photocopies of parts of this publication may be made in the U.S.A. All other copyright questions, including photocopying outside of the U.S.A., should be referred to the publisher. No responsibility is assumed by the publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein.
PRINTED IN THE NETHERLANDS
Preface Submodular functions frequently appear in the analysis of combinatorial systems such as graphs, networks, and algebraic systems, and reveal combinatorially nice and deep structures of the systems. The importance of submodular functions has widely been recognized in recent years in combinatorial optimization and other fields of combinatorial analysis. The present book provides the readers with an exposition of the theory of submodular functions from an elementary technical level to an advanced one. The theory of submodular functions was developed in the earliest stage till 1950’s by H. Whitney and W. T. Tutte for matroids, by G. Choquet for the capacity theory and by 0. Ore for graphs. A flourishing stage of the theory came with J. Edmonds’ work on matroids and polymatroids in 1960’s. Related studies were also made in the theory of characteristic function games by L. S. Shapley and others. Since 1970, applications of (poly-)matroids to practical engineering problems have been extensively made by M. h i , A. Recski and others, and also further theoretical developments in submodular functions by a lot of great scholars in discrete mathematics and combinatorial optimization. The theory of submodular functions is now becoming mature, but a large number of fundamental and useful results on submodular functions are scattered in the literature. The main purpose of the present book is to put these materials together and to show the author’s unifying view of the theory of submodular functions by means of base polyhedra and duality for submodular and supermodular systems. Special emphasis is placed on the constructive aspects of the theory, which will lead us to practical efficient algorithms. No comprehensive survey of submodular functions is aimed at here. I had to omit important results on submodular functions such as a strongly polynomial time algorithm for minimizing submodular functions due to M. Grotschel, L. Lovdsz and A. Schrijver. This is mainly because the precise description and validation of the results would require further technical developments outside the mainstream of this book. A sketch of the author’s view of submodular functions was given in a survey paper [Fuji84c],which was written while I was visiting Professor Bernhard Korte’s Institute in Bonn as an Alexander von Humboldt fellow in 1982-83, and laid a basis of the project of writing this book, which I gratefully acknowledge. I also acknowledge that part of my work, upon which the present book is primarily based, has been supported by grants-in-aid of the Ministry of Education, Science and Culture of Japan. I would like to express my deep sincere thanks to Professor Masao Iri of the University of Tokyo who first drew my attention to the theory of matroids, a promising and enjoyable research field of combinatorics, in 1975 and has since then been keeping giving me invaluable advice and stimulating discussions on V
submodular functions and other related discrete systems. Without his advice most of my work would not have been accomplished. Thanks are also due to Professor Nobuaki Tomizawa, now at Niigata University, with whom I enjoyed inspiring discussions and joint work. I am also very much grateful to Professor Peter L. Hammer for his encouragement to write this book. I used a preliminary version of this book for a lecture of the Doctoral Program in Socio-Economic Planning at the University of Tsukuba and I thank the students who attended the lecture for their useful comments. I have also benefited from comments and communications received from Bill Cunningham, Tetsuo Ichimori, Naoki Katoh, Kazuo Murota, Masataka Nakamura, Hans Rock and Uwe Zimmermann, to name a few, in the course of my research on submodular functions and writing this book.
S.F.
July 1990
vi
Contents
Preface
..................................................................
v
Chapter I. Introduction
............................................... 1 1 . Introduction ......................................................... 1 1.1. Introduction .................................................... 1 1.2. Mathematical Preliminaries ..................................... 2 (a) Sets ......................................................... 2 (b) Algebraic structures ......................................... 3 (c) Graphs ...................................................... 6 (d) Network flows .............................................. 10 (e) Elements of convex analysis and linear inequalities .......... 12
.
C h a p t e r I1 S u b m o d u l a r S y s t e m s a n d Base P o l y h e d r a
...........
2 . From Matroids to Submodular Systems ............................. 2.1. Matroids ....................................................... 2.2. Polymatroids ................................................... 2.3. Submodular Systems ...........................................
17 17 17 20 26
3 . Submodular Systems and Base polyhedra ........................... 36 3.1. Fundamental Operations on Submodular Systems ............... 36 (a) Reductions and contractions by sets ........................ 36 (b) Reductions and contractions by vectors ..................... 37 (c) Translations and sums ...................................... 41 (d) Other operations ........................................... 43 44 3.2. Greedy Algorithm .............................................. (a) Distributive lattices and posets ............................. 44 (b) Greedy algorithm .......................................... 48 3.3. Structures of Base Polyhedra ................................... 55 (a) Extreme points and rays .................................... 55 (b) Elementary transformations of bases ........................ 58 (c) Tangent cones .............................................. 60 (d) Faces, dimensions and connected components ............... 63 3.4. Intersecting- and Crossing-Submodular Functions ............... 73 (a) Tree representations of cross-free families ................... 73 (b) Crossing-submodular functions ............................. 77 (c) Intersecting-submodular functions ........................... 86 3.5. Related Polyhedra ............................................. 87 (a) Generalized polymatroids ................................... 88 vii
(b) Polypseudomatroids ........................................ (c) Ternary semimodular polyhedra ............................ 3.6. Submodular Systems of Network Type ........................
.
Chapter I11 Neoflows ...............................................
91 96 105 109
4 . The Intersection Problem .......................................... 109 4.1. The Intersection Theorem ..................................... 109 (a) Preliminaries .............................................. 110 (b) An algorithm and the intersection theorem ................ 112 (c) A refinement of the algorithm ............................. 118 4.2. The Discrete Separation Theorem ............................. 121 4.3. The Common Base Problem ................................... 123
5. Neoflows .......................................................... 125 126 5.1. Neoflows ...................................................... (a) Submodular flows ......................................... 126 126 (b) Independent flows ......................................... (c) Polymatroidal flows ....................................... 127 5.2. The Equivalence of the Neoflow Problems ..................... 128 (a) From submodular flows to independent flows ............... 128 (b) From independent flows to polymatroidal flows ............ 129 (c) From polymatroidal flows to submodular flows ............. 131 133 5.3. Feasibility for Submodular Flows .............................. 136 5.4. Optimality for Submodular Flows ............................. 5.5. Algorithms for Neoflows ....................................... 146 (a) Maximum independent flows ............................... 146 (b) Maximum submodular flows ............................... 151 (c) Minimum-cost submodular flows ........................... 153 5.6. Matroid Optimization ......................................... 164 (a) Maximum independent matchings ......................... 164 (b) Optimal independent assignments ......................... 170
.
Chapter IV Submodular Analysis
.................................
6. Submodular Functions and Convexity .............................. 6.1. Conjugate Functions and a Fenchel-Type Min-Max Theorem for Submodular and Supermodular Functions .................. (a) Conjugate functions ....................................... (b) A Fenchel-type min-max theorem .......................... 6.2. Subgradients of Submodular Functions ........................ (a) Subgradients and subdifferentials .......................... (b) Structures of subdifferentials .............................. 6.3. The Lovdsz Extensions of Submodular Functions .............. viii
175 175 175 175 177 179 179 184 186
7 . Submodular Programs ............................................. 191 7.1. Submodular Programs - Unconstrained Optimization ......... 191 (a) Minimizing submodular functions .......................... 191 (b) Minimizing modular functions ............................. 197 7.2. Submodular Programs - Constrained Optimization ........... 202 (a) Lagrangian functions and optimality conditions ............ 202 (b) Related problems .......................................... 207 (b.1) The principal partition ............................... 207 (b.2) The principal structures of submodular systems ....... 217 (b.3) The minimum-ratio problem ......................... 219
Chapter V . Nonlinear Optimization with Submodular Constraints
.................... 8 . Separable Convex Optimization .................................... 8.1. Optimality Conditions ........................................
223
8.2. A Decomposition Algorithm ................................... 8.3. Discrete Optimization .........................................
223 223 227 229
9 . The Lexicographically Optimal Base Problem ...................... 9.1. Nonlinear Weight Functions ................................... 9.2. Linear Weight Functions ......................................
231 231 233
10. The Weighted Max-Min and Min-Max Problems ................... 238 238 10.1, Continuous Variables ........................................ 10.2. Discrete Variables ............................................ 240 11 . The Fair Resource Allocation Problem ............................. 11.1. Continuous Variables ........................................ 11.2. Discrete Variables ............................................ 12. The Neoflow Problem with a Separable Convex Cost Function
. . . . . . 248
............................................................. Index .................................................................. References
ix
241 241 243
251 265
This Page Intentionally Left Blank
Chapter I.
Introduction
In this chapter we give a short introduction of the structure of this book and briefly review elements of algebra, graphs, networks and linear inequalities for readers’ convenience.
1. Introduction
1.1. Introduction In 1935 H. Whitney [Whit351 introduced the concept of matroid as an abstraction of the linear dependence structure of a set of vectors. Several systems of axioms for defining a matroid are now known, each of which is simple but substantial enough to yield a deep theory in Combinatorial Optimization and to have a lot of applications in practical engineering problems (see [Iri83], [Iri+Fuji8l], [Murota87], [Recski]). Matroidal structures are closely related to a class of efficiently solvable combinatoria! optimization problems; a careful examination of an efficiently solvable problem often reveals a matroidal structure which underlies the problem. In 1970 J. Edmonds [Edm70] combined the matroid theory with polyhedral combinatorics and lead us to the concept of polymatroid. A polymatroid polyhedron, called an independence polyhedron, is expressed by a system of linear inequalities with (0,l)-coefficients and the right-hand sides given by a submodular function which is the rank function of the polymatroid. The relation between matroids and polymatroids is similar to that between matchings in bipartite graphs and flows in networks. The rank function of any polymatroid is a monotone nondecreasing submodular function on a Boolean lattice 2 E for a finite set E . The monotonicity of the rank function does not play any essential r61e in characterizing the combinatorial structure of the polymatroid polyhedron since the monotonicity is not invariant with respect to translations of the polyhedron. The concepts of submodular and supermodular systems [Fuji78b,84c] naturally come up with this observation. The rank function of a submodular (or supermodular) system is a submodular (or supermodular) function on a distributive lattice, a sublattice of a Boolean lattice. The duality is defined between a submodular system and a supermodular system, which dissolves the clumsy definition of polymatroid duality [McDiarmid75]. Submodular systems are not only theoretical generalizations of matroids and polymatroids but also significantly extend the applicability in practical problems. 1
I. INTRODUCTION In Chapter I1 we first introduce the concepts of submodular and supermodular systems and their associated base polyhedra by following the historical generalization sequence of matroids, polymatroids and submodular systems. We then examine algorithmic aspects of submodular systems and basic structures of base polyhedra. In Chapter I11 we consider a class of network flow problems with submodular boundary constraints, which we call the neoflow problem. It includes the (poly-)matroid intersection problem of J. Edmonds [Edrn’lO],the submodular flow problem of J. Edmonds and R. Giles (Edm+Giles77], the independent flow problem of the author [Fuji78a] and the polymatroidal flow problem of R. Hassin [Hassin78,82] and E. L. Lawler and C. U. Martel [Lawler+Martel82b]. Submodular functions are discrete analogues of convex functions. In Chapter IV we develop a theory of submodular functions from the point of view of convex analysis [Rockafellar70], which we call the submodular analysis. We will make clear the close relationship between the submodular analysis and the results obtained in Chapter 111. Finally we consider nonlinear optimization problems with submodular constraints in Chapter V. A decomposition algorithm is shown for a separable convex optimization problem over a base polyhedron and it lays a basis for the algorithms of the other problems such as the lexicographically optimal base problem, the weighted max-min (min-max) problem and the fair resource allocation problem. We also consider a neoflow problem (the submodular flow problem) with a separable convex cost function.
1.2. Mathematical Preliminaries
(a) Sets We denote the set of reals by R, the set of rationals by Q and the set of integers by Z. We also denote the set of nonnegative elements of R (Q, Z) by R+ ( Q + , Z+)* For any finite set X we denote its cardinality by When X is a subset of a set Y ,we write X 5 Y , and when X is a proper subset of Y (i.e., X C Y and X # Y), we write X c Y . It should be noted that this is different from the conventional notation. For subsets X and Y of a set E , when X n Y = 0, we say X and Y are disjoint, and when X U Y = E (or ( E - X)n ( E - Y)= 0), we say X and Y are codisjoint. A set of disjoint nonempty subsets Bi (i E I) of a set E is called a partition of E if UiGrBi = E . If {Bi I i E I } is a partition of E , we call { E - B, I i E I } a copartition of E . For sets A and B we call ( ( 1 , ~I )a E A } u {(2,6) I 6 E B }
1x1.
2
1.2. MATHEMATICAL PRELIMINARIES
I
the direct sum of A and B and denote it by A @ B. Also, we call { ( a ,b) a E A , b E B } the direct product of A and B and denote it by A x B . For a mapping f : A -+ B we often express f as ( f ( a ) I a E A ) . For example, a family 3 of sets Xi (i E I ) is written & 3 = (XiI i E I ) and a matrix M with a row index set I , a column index set J and an (i,j)-element Mij (i E I,j E J ) is expressed as M = (Mij I i E I , j E J ) . The set of all the mappings from A to B is denoted by B A . The characteristic vector of a subset A of an underlying set E is the mapping X A : E -+ (0,l} such that XA(e) = 1 for e E A and x ~ ( e=) 0 for e E E - A .
(b) Algebraic structures For a set A we call a binary relation, denoted by simply an order on A if it satisfies
<, on A a partial
order or
< a, (ii) (antisymmetry) a 5 b, b < a --r' a = b, (iii) (transitivity) a < b, b 5 c ==+ a 5 c . (i) (reflexivity) V a E A: a
We call the pair ( A , < ) a partially ordered set or a poset for short, Also, we is implicitly often say that A is a poset, when the underlying partial order assumed. If a 5 b and a # b, we write a < b. Moreover, if we have a 5 b or b 5 a for every a , b E A , we call the partial order 5 a total order or a linear order. The ordinary orders on R , Q and Z are total orders. A total order is usually denoted by 5. For a poset P = ( A , 5 ) define a poset P* = ( A ,<*) by
<
for any a , b E A . We call
P* = ( A ,<*)
the dual poset of
P. We often use
for
5*. For a poset P = ( A , 5 ) a subset B of A is called an ideal (or a lower ideal) of P if z y E B implies x E B . Also, B C A is called a dual ideal (or an upper ideal) of P if x 2 y E B implies x E B. For two elements z, y of a poset P = ( A ,i),if z < y and there exists no element z such that x < z < y , we say that y covers x. Let P = ( A , < ) be a poset. An element a E A is an upper bound of a subset B C A if for each b E B we have 6 a. Similarly, an element a E A is a lower bound of B C A if for each b E B a b. If a is an upper bound (lower bound) of B and a belongs to B , then a is called the maximum element (minimum element) of B . Note that the maximum (or minimum) element of B , if any exists, is unique. If the set of upper bounds (lower bounds) of B has the minimum element 6, (the maximum element b * ) , we call b, ( V )the
<
<
3
I. INTRODUCTION supremum (infimum) of B and denote it by sup B (inf B ) . If for each x,y E A there exist sup{x,y} and inf{z, y}, then we call poset P = ( A ,5 ) a lattice, and we write x V y = sup{z, y} and z A y = inf{z, y}. These two binary operations, V and A, are called the join and the m e e t , respectively, and satisfy
(i) (idempotency) V x E A : x V z = 5, z A x = z,
(ii) (commutativity) vx,y E A : z V y = y V z, x A y = y A x,
(iii) (associativity) Vx, y,z E A : x V (y V z ) = (z V y) V z , z A (y A Z ) = (z A y) A Z , (iv) (absorption) Vz,y E A : z A (z V y) = z, 5 V (z A y) = x. Conversely, if a set A is given two binary operations V and A which satisfy the above (i)-(iv), then, defining a binary relation 5 by “5 5 y xvy =y (or z A y = z),” we have a lattice ( A ,5 ) whose lattice operations are the given V and A . A lattice ( A , 5 ) with lattice operations V and A is also expressed as (A, V, A). We often call A itself a lattice, assuming the underlying partial order or lattice operations. A lattice f! = (A,V,A) is called a distributive lattice if it satisfies (v) (distributivity) Vz, y,z E A : z A (y V z ) = (z A y) V (z A z ) , x V (y A z ) = (x V y) A (z V z ) . Let D be the set of (lower) ideals of a finite poset P = ( E ,5 ) . Then D is a distributive lattice with set union u and intersection n as the lattice operations v and A . Conversely, any finite distributive lattice is isomorphic with the one represented by a collection of sets as above (see [Birkhoff37,67]). Any sublattice of a distributive lattice is a distributive lattice. For posets P; = ( A ; , < ; ) (i E I ) , define a binary relation 5 on the direct product XicrA; of A; (i E I) as follows: for a = (ai I i E I ) and b = (6i I i E I ) we have a 5 b if and only if V i E I : ai
<
z
Y e E E : z ( e ) 5 y(e).
(1.4
Since (RE,5 ) is the direct product of [El copies of (R, 5 ) and a direct product of distributive lattices is a distributive lattice, (RE,5 ) is a distributive lattice. Also, note that for any z,y,z E RE (i) x < y = = = + . + z i y + z , (ii) z 5 y,X E R + ==+ A s 5 Xy.
Therefore, RE is a vector lattice. Following the convention, we also use 5 for the partial order 5 on R E . 4
1.2. MATHEMATICAL PRELIMINARIES Consider a lattice f! = ( L , v , A ) with the minimum element 0 and the maximum element I. If z, y E L satisfy x V y = I and x A y = 0 , x (or y) is a complement of y (or z). Lattice f! is said to be complemented if each x E L has its complement. A Boolean lattice is a lattice which is distributive and complemented. A set G with an element e E G, a binary operation : G x G -+G and a unary operation ( )-I: G + G is a group if it satisfies
-
(1) VX,Y,ZEG: X-(Y.Z) = (x-y)'z, (2) Vx E G: e . x = x - e = z, (3) Vx E G: z-' . x = x . x-' = e . Here, the element e E G satisfying (2) uniquely exists and is called the unit element (or the neutral element). Also, z-l is called the inverse element of x. When G satisfies (1) but not necessarily (2) and (3), G is called a semi-group. When a group G is commutative, i.e., Vx,y E G: x .y = y x, G is called a commutative group or an Abelian group. For a commutative group G we often use instead of for the binary operation, and denote the inverse of x by -x and the unit (or neutral) element by 0. A commutative group G expressed in this way is called an additive group. G is called a totally ordered additive group if G is an additive group with a total order 5 defined on it and if the following (1) and (2) hold:
+
-
(1) x 5 Y ===+ -x L -Y, (2) 2 1 5 Y1, 5 2 F Y2 ==+XI + % F Yl +Y2.
The set R of reals, Q of rationals and Z of integers are typical examples of a totally ordered additive group. A ring A is an algebraic system with two operations (addition) and (multiplication) such that
+
(i) A is an additive group with operation
+,
(ii) A - ( 0 ) is a semi-group with operation . , (iii) Vx,y,z E A : (x+ y) - z = z . z y ' z , 3:. (y+ z ) = z . y
+
+ z az.
The set Z of integers is an example of a ring. For a ring A with a unit element 1,an additive group G, and an operation *: A x G + G, we call G an A-additive group or an A-module if for each a,,B E A and 5,y E G we have
a * .( + y) =
* z + a * y,
( a+ P I
a*(p*x)=(a.p)*x, 2 is a Z-additive group.
*
=
a*
+ p * z,
l*z=x.
(1.3a)
(1.3b)
I. INTRODUCTION A ring A is commutative if A - ( 0 ) is a commutative semi-group with respect to operation . A commutative ring K is called a field if K - ( 0 ) is a commutative group with respect to operation . . The set Q of rationals and R of reals are fields with ordinary operations of the addition and the multiplication. For two fields H and K such that H 2 K we say H is a subfield of K and K is an extension of H .
-
(c) Graphs
Let V and A be finite sets, where V is called a vertex set and A an arc set. Each v E V is called a vertex and each a E A an arc. We are also given two functions d + , d - : A -+ V. For each arc a E A d+a is the initial end-vertex (or the tail) of a and d-a is the terminal end-vertex (or the head) of a . We call G = ( V , A ; d + , d - )a graph. When there is no possibility of confusion, we also denote the graph by G = ( V , A ) . We often express an arc a by the ordered pair ( d + a , d - a ) of the end-vertices when such a pair uniquely determines the arc. A graph G = ( V , A )with arc set A = { ( u , v ) I u , v E V , u # v } is sometimes called a complete directed graph. See Fig. 1.1 for a geometric representation of a graph. For graphs see, e.g., [Berge73] and [HararyGg].
d+ a
U
d- a
Figure 1.1. An arc a such that d + a = d - a is called a selfloop and arcs a1,a2 such that { d + a l , d - a l } = { d + a z , d - a 2 } is called a parallel arcs. We call a graph H = (W,B ; a&,a;) a subgraph of a graph G = (V,A ; d + , and d j j are, respectively, the restrictions of d+ d - ) if W C: V , B C A and and 6’- to B . We often use the original d+ and d- for a& and 8,. Moreover, if B is the set of all the arcs a E A such that { d + a , d - a } W , then we call 6
1.2. MATHEMATICAL PRELIMINARIES
H = (W,B)a subgraph induced by the vertex subset W ;and if W is the set of all the end-vertices of arcs in B ,then we call H = (W,B ) a subgraph induced by the arc subset B and denote it by G . B . For any B A let V ( B )be the set of end-vertices of arcs of B. Consider a graph H = (W,A - B ;a&, aE) such that W = (V - V ( B ) )u {VB} (vg:a new vertex), aj!ja = a*a (if a*a $ V ( B ) ) and a$a = ~g (if a*a E V ( B ) ) .We denote this graph H by G / B and call it a contraction of G by B . Informally, contraction G / B is obtained by shrinking B together with the end-vertices into a single vertex V B . When we do not distinguish d+a from a-a for each a in A or we are not concerned with the orientations of the arcs, we call the graph G = ( V , A ) an undirected graph and call each a E A an edge instead of an arc. When we emphasize the fact that a graph is not an undirected one, we call it a directed graph. A graph is called simple if it does not contain any selfloops or parallel arcs. We define for each vertex v E V
6-v = { a I a E A , a-a = u } .
(1.5)
An arc a in 6+v u 6-v is said to be incident to v. For any B A and U C V we define d*B = {@:a I a E B } and 6*U = Uv,,6*v. A vertex u in (a-6+v) u (a+6-v) is said to be adjacent to v. Also define for each subset U of v A + U = { a I a E A , a+a E u, E v - u}, (1.6)
A-u
= {a
I a E A,
E
u, asa E v - u>.
(1.7)
If A + U U A-U # 0, we call the set A + U U A-U of arcs a cutset. A single-element cutset is called a bridge. For a graph G = ( V , A ) define a matrix D = (D," I v E V,a E A ) with a row index set V and a column index set A by 1
if v = P a and u if v = d - a and u
# %a, # d+a,
otherwise. We call D the incidence matrix of G. A path in G is an alternating sequence ( v ~ , a ~ , v l , a ~ ; ~ ~ , v ~ - l , aofk , ~ k ) vertices vi ( z = 0,1,. . . ,k) and arcs ai (i = 1 , 2 , * . k) such that { a + a i , 8-a;) = { v i d 1 , v i } (i = 1 , 2 , - . - , k ) . vo is the initial vertexof the path and v k is the terminal vertex. We also say that the path is from V o to V k . For an arc a; such that d+ai = vi-l and d-ai = vi we say a, is positively oriented in the path. Also, if d+ai = u i , %a; = ui-1 and u, # vi-1, we say a, is negatively oriented a
7
,
I. INTRODUCTION in the path. If all the arcs in the path are positively oriented, we call the path a directed path. A (directed) path is called a (directed) cycle if it contains at least one arc and its initial and terminal vertices coincide with each other. A path or cycle is called elementary if no vertices in it are repeated (except for the initial and terminal vertices when we consider a cycle). A graph G = (V,A ) is called connected if for every two vertices u , v E V there exists a path from u to v . Connectedness is a property of G as an undirected graph. A maximal connected subgraph of G is called a connected component of G. G is decomposed into its connected components Hi = (K, A i ) (i E I ) , where {& I i E I } is a partition of V and { A i I i E I } is a partition of A . The rank of a graph G = ( V , A ) is the number of its vertices minus the number of its connected components, which is equal to the matrix rank of the incidence matrix D of G. The nullity of G is equal to [ A ]minus the rank of G. A graph G = ( V , A ) is called strongly connected if for every two vertices u , v E V there exists a directed path from u to v . A maximal strongly-connected subgraph of G is called a strongly connected component of G. G is decomposed into its strongly connected components = (fi, (i E f), where {fi I i E i} is a partition of V but { & I i E f} is not a partition of A though ( i E i) are disjoint. For two strongly connected components l?il and H i 2 we write kil 5 Hi3 if and only if there exists a directed path from a vertex of H i , to a vertex of kil. Note that if 5 H i 2 , there exists a directed path from any vertex of Hi2 to any vertex of H i , . We can easily see that this binary relation j on the set of strongly connected components of G is a partial order. We say that the partial order is naturally induced by the decomposition of G into strongly connected components. (See Fig. 1.2.)
A,)
,&
Figure 1.2. The decomposition into strongly connected components. 8
1.2. MATHEMATICAL PRELIMINARIES
A graph G = ( V , A ) is called a tree if it is connected and does not contain any cycle. For a graph G = ( V , A ) and a subgraph H = ( W , B ) of G, H is called a (spanning) tree of G if W = V and H is a tree. A tree T = ( V , A ) is called a directed tree if IS-vl 5 1 for each v E V . For a directed tree T = (V,A ) there uniquely exists a vertex vo E V such that 16-voI = 0. We call vo the root of T . A vertex v of T with 16+vl = 0 is called a leaf of T. For vertices u , v of T such that for some arc a of T we have d+a = u and d - a = v, we call u the parent of v and v a child of u. Children of a common parent are called siblings. A tree !I? = ( V , A ) is called a directed tree toward the root if 16+vl 5 1 for each v E V . The root of f' is a vertex vo such that 16+voI = 0. A bipartite graph G = ( V + ,V - ; A ) is a graph with two disjoint vertex sets V + and V - and with an arc set A consisting of arcs a such that d+a E V + and d - a E V - alone. We often call V + the left vertex set and V - the right wertez s e t . A matching M in the bipartite graph G is a subset of the arc set A such that for any distinct arcs a,a' in M we have d + a # d+a' and 8 - a # %a'. Also, a cover ( U + , U - ) of G is the ordered pair of U+ C V + and U - C V such that for any arc a E A we have d+a E U+ or d - a E U - .
Theorem 1.1 (Konig-Egervky): For a bipartite graph G = ( V + ,V - ; A ) we have max{ IMI
I
M : a matching of G}
=rnin{IU+I+IU-I
I
( U + , U - ) : acoverofG}.
(1.9)
For a simple graph G = (V,A ) , not necessarily a bipartite graph, a subset M of the arc set A is called a matching of G if for each distinct a,a' E M we have { d + a , d - a } n {d+a',d-a'} = 0. For a poset P = (V,5 ) on a finite set V consider a graph G( P) = (V,A ( P ) ) with the vertex set V and the arc set A defined by
A ( P ) = { ( u , v ) I u , v E V, u covers v in
P}.
(1.10)
The Hasse diagram of the poset P = (V, 5 ) is a planar drawing of the graph G ( P ) = ( V , A ( P ) )in such a way that for each arc ( u , v ) of G ( P ) u is located vertically higher than v . Since the orientation of each arc of the Hasse diagram is uniquely determined by the planar drawing, the Hasse diagrams are usually drawn as if they were undirected graphs (see Fig. 1.3). For a finite set E and a family 3 of subsets of E we call H = ( E ,3) a hypergraph, where each element of E is called a vertex of H and each element of 3 an edge of H . A hypergraph H = ( E , 3 ) is said to be connected if for each distinct e , e' E E there exists a sequence F I , F2, . . ., Fk of edges of H 9
I. INTRODUCTION
Figure 1.3. The Hasse diagram for the decomposition structure in Fig. 1.2. such that e E F I , e' E Fk and Fi n F,+l # 0 ( i = l , - . . , k - 1 ) . A hypergraph H' = ( E f , 3 ' )is a subhypergraph of H = ( E , 3 ) i f E' C E and 3' 5 7. A connected component of H = ( E , 3) is a maximal connected subhypergraph of H.
(d) Network flows Consider a network with an underlying graph G = (V,A)having two distinguished vertices s+, s- E V and with a nonnegative capacity function c: A + R+ on the arc set A. Vertices s+ and s- are, respectively, the entrance and the exit of the network. We call this network a two-terminal network and denote it by N = (G = (V,A),s+,s-,c).A function p: A + R is a feasible flow in if p satisfies the network N = (G = (V,A),s+,s-,c) b'u E A : 0 5 p(a) 5 c ( u ) ,
vv E
v
-
{s+,s-}:
ap(v) f
c ll.Ed+
The value of a feasible flow p is given by
10
TI
p(a) -
c oE6-v
(1.11) p(u) = 0.
(1.12)
1.2. MATHEMATICAL PRELIMINARIES The function dp: V -+ R is called the boundary of p. Note that regarding p and d p as column vectors, we have d p = Dp for the incidence matrix D of G. A feasible flow of maximum value is called a maximum flow in N. We call a vertex subset U with 5+ E U and 5- $ U a cut of N. The capacity of a cut U is defined by .C(W
=
c
(1.14)
C(.).
aEA+U
Theorem 1.2 (Ford-Fulkerson): For a two-terminal network (V,A ) , s+ ,s-, c) max{dp(5+) I p: a feasible flow in = min{nc(U) I U : a cut of A}.
N
= (G =
N} (1.15)
Moreover, if the capacity function c is integer-valued, there exists an integral maximum flow in N. Suppose that we are given a graph G = (V,A ) and lower and upper capacity functions c, Z: A -+ R with c 5 3. Denote this network by NO = (G = ( V , A ) , c , F ) .A feasible circulation in network NO is a function p: A --f R such that (1.16) Ya E A: c(a) 5 p(a) 5 Z ( a ) ,
vv E
v : dp(v) = 0 .
Theorem 1.3 (Hoffman): There exists a feasible circulation in network and only if for each U C V we have
(1.17)
NO if (1.18)
Moreover, if the lower and upper capacity functions c and C are integer-valued and there exists a feasible circulation in NO,then there exists an integral feasible circulation in No. From Theorem 1.3 we can show
Theorem 1.4 (Gale): Consider a bipartite graph G = ( V + , V - ; A ) and s u p pose we are given nonnegative (supply and demand) vectors s € RY+ and d E Ry- . Then, there exists a nonnegative flow p: A -+ R+ in the bipartite network such that ( 1.19a) v v E v+:dp(v) 5 5 ( v ) , 11
I. INTRODUCTION
( 1.19b)
if and only if for each U -
CV-
we have (1.20)
Ea+
s - IT-
VEW-
(e) Elements of convex analysis and linear inequalities
+
For more details of the subjects of this subsection see [Rockafellar70], [Stoer Witzgall701, [Bachem Grotsche182] and [Schrijver86]. Let E be a finite set. For any x , y E RE and nonnegative X,p E R such that X p = 1 we call Ax p y a conuex Combination of x and y . A set A C RE is said to be conuex if all the convex combinations of arbitrary two points in A belong to A . A typical example of a convex set is a solution set of a system of linear equations and linear inequalities:
+
+
+
af ( e ) x ( e ) = bf
(i E I ) ,
(1.2la)
CEE
where a r ( e ) , u ; ( e ) , bf, 63” (i E I , j E J , e E E ) are real constants. Such a convex set is called a polyhedral conuex set or a conuex polyhedron or simply a polyhedron. We are mainly concerned with polyhedral convex sets. Note that different systems of linear equations and linear inequalities may give the same polyhedron. A set C C: RE is called a conuex cone if all the nonnegative combinations, Xz p y (A 2 0 , p 2 0 ; x,y E C ) , of points in C belong to C. If C is the set of all the nonnegative combinations of points a< E R E (i E I ) , we say the set of points ai (i E I ) generates the cone C . An a f i n e set or (linear variety) in RE is a translation of a subspace of vector space RE. The dimension of an affine set A is the dimension of the subspace obtained by a translation of A . The dimension of a (polyhedral) convex set A in RE is the dimension of the unique minimal affine set containing A . If the dimension of A is equal to [ E l ,A is said to be full-dimensional. A line is a onedimensional affine set. A halfline (or ray) is a translation of a set given by {Ax I X 2 0 ) for some nonzero vector 2: E RE.We usually represent a halfline (or ray) from the origin by a nonzero vector contained in it. A (polyhedral) convex set A is bounded if and only if it does not contain any halfline. A point of a (polyhedral) convex set A is called an extreme point of A if it can not be expressed as a convex combination of the other two points
+
12
1.2. MATHEMATICAL PRELIMINARIES
in A. A convex polyhedron (polyhedral convex set) is said to be pointed if it has at least one extreme point. For a convex polyhedron A described by (1.21) the characteristic c o n e (or recession c o n e ) of A is the solution set of
Denote the characteristic cone of A by C(A). The characteristic cone C(A) does not depend on the choice of a representation (1.21) of A , as the following lemma shows.
Lemma 1.5: For a convex polyhedron A, z E C ( A ) if and only if for each y t? A and nonnegative X E R we have y Ax A. Moreover, A is bounded if and only if C(A) = (0).
+
Lemma 1.6: A convex polyhedron A described by (1.21) is pointed if and only if A does not contain any line, or equivalently, the system of (1.22a) and
has the unique solution x = 0.
For any JO & J denote by A ( J 0 ) the convex polyhedron described by (1.21a) and (1.24) a;(e)x(e)
I b;
( j E J - Jo).
(1.25)
eEl3
Define 3 ( A ) = {A(Jo)
I Jo C J } .
(1.26)
Here, it should be noted that A ( J ) may be empty. Each F E 3 ( A ) is called a f a c e of A. A face which is a proper subset of A is called a proper f a c e . Faces of A are determined by A and are independent of the choice of a representation (1.21) of A . For a nonzero vector a E RE and a scalar b 6 R , the set of points 5 6 RE satisfying (a,s)E a ( e ) s ( e )= b (1.27) I!€
E
13
I. INTRODUCTION is called a hyperplane, and the set of points x E RE satisfying
is a halfspace. A convex polyhedron is the intersection of a finite number of halfspaces. We denote by H ( a , b ) the hyperplane described by (1.27), and by H+(a,b) the halfspace (1.28). Note that H + ( a , b ) nH+(-a,-b) = H ( a , b ) . A hyperplane H(a, b) is called a supporting hyperplane of A if H(a, b) n A # 0 and if A H+(a,b) or A C H+(-a,-b).
Lemma 1.7: Suppose A is a full-dimensional convex polyhedron. A subset F of A is a nonempty proper face of A if and only if F is the intersection of A and a supporting hyperplane of A . A zero-dimensional face is called a vertex and a vector in a vertex is an extreme point. A one-dimensional face is called an edge. An edge of a convex cone is called an extreme ray. An extreme ray of a polyhedron is an extreme ray of the characteristic cone. An extreme ray is represented by a nonzero vector contained in it, which is called an extreme vector.
Lemma 1.8: The set 3 ( A ) of faces of A is a lattice with respect to set inclusion as the partial order. For each F1, F2 E ? ( A )
F1 A F2 = Fi I- F2.
(1.30)
Lattice 3 ( A ) is called the face lattice of A . A maximal proper face of A is called a facet of A . For a convex cone C RE define C" = {x
I z E R E ,'dy E C : (s,y) 5 0 } ,
(1.31)
which is called the dual cone of C . If C is represented by the system of inequalities (Ci,Z) 5 0 (i € I), (1.32) then the dual cone C" is exactly the cone generated by the vectors c; E R E (i E I ) . A function f: RE --+ R U {+m} is called a convex function if for each z,y E R E with f(x),f ( y ) < +oo and for each X,p 2 0 with X p = 1 we have
+
14
1.2. MATHEMATICAL PRELIMINARIES
A vector
a E
RE is called a subgradient of f at a point x E RE if for every
yER"
f (Y) - f ( 4 1 (a, Y - 4.
(1.34)
The set of all the subgradients of f at x is the subdifferential of f at x and is denoted by af (z). Note that x E RE is a minimizer of f if and only if 0 E af (z). We use symbol a for subdifferentials and for boundaries of flows as in (1.13), since there seems to be no possibility of confusion. For a convex function f: RE -+ R U {+m} the convex conjugate function f*: R E -+ R U {+m} is defined by f * b )= SUP{(X,Y) - f ( Y ) I Y E RE}. (1.35) Let us consider a linear programming problem: n
(P)
Maximize x c j x j
(1.36a)
j=l n
subject to c a i j x j j= 1
5 b; (i = 1 , 2 , . - - , m ) ,
(1.36b)
where aij, b i , c j E R (i = 1 , 2 , . m;j = 1,2,. . . ,n) are given constants. The dual linear programming problem of ( P ) is given by -
a
,
m
(D)
C b,X,
Minimize
(1.37a)
i=1
c m
subject to
aijXi = c j
(j= 1,2,. . * , n ) ,
(1.37b)
i= 1
> o ( i = 1 , 2 , . . . , m ). (1.37~) We say Problem Problem ( P ) is called a primal problem and is the dual of (D). Xi
( P ) (or (D))is unbounded if the problem has feasible solutions and the objective function can be made arbitrarily large (or small). Lemma 1.9 (The weak duality for linear programming): For any feasible solutions x of ( P ) and X of (D), n
m
j= 1
i=l
C c j ~ 5j C
biXi.
(1.38)
Theorem 1.10 (The duality for linear programming): If one of the dual problems ( P ) and ( D ) has an optimal solution, then its dual problem also has an optimal solution and for any optimal solutions x* of ( P ) and A * of (D) we have n
m
j=l
i=l
(1.39)
15
I. INTRODUCTION Moreover, if one of the dual problems is unbounded, then its dual problem has no feasible solutions. Concerning the feasibility of a system of linear inequalities we have the following. Lemma 1.11 (Farkas): There exists a feasible solution for the system of linear inequalities (1.36b) if and only if, for each nonnegative X i E R (i = 1,2, ,rn) such that Xia;j = 0 ( j = 1 , 2 , . . . , n ) , we have CzlXi6i 2 0.
--
Elml
The “if” part is the essential part of the above lemma. Suppose that a i j , b ; , c j (i = 1 , 2 , - . - , r n ; j= 1 , 2 , . . . , n ) aregivenrationals. The system of linear inequalities (1.36b) is called totally dual integral if for each integral vector c = (c1, c 2 , . - .,c,) such that ( P ) has an optimal solution there exists an integral optimal solution of the dual problem (D)(see [Hoffman741 and [Edm Giles771).
+
Theorem 1.12 (Hoffman and Edmonds-Giles): If the system of linear inis integral, equalities (1.36b) is totally dual integral and 6 = ( b l , 6 2 ; . . , 6 , ) then each nonempty face of the polyhedron described by (1.36b) contains at least one integral point and, in particular, each vertex of the polyhedron, if any, is integral.
A version of the separation theorem for convex sets is given as follows. Theorem 1.13: For a convex cone C 5 RE and a vector x E R E not belonging t o C there exists a weight vector w E RE such that
(1.40)
(1.41)
If C is pointed, the inequalities in (1.40) c m be made strict inequalities.
16
Chapter 11.
Submodular Systems and Base Polyhedra
In this chapter we give basic concepts on matroids, polymatroids and submodular systems and show the natural generalization sequences of these concepts from matroids to submodular systems. We also examine the fundamental combinatorial structures of submodular systems and associated polyhedra. For basic properties of matroids and polymatroids shown without proofs in this chapter, readers should be referred to [Tutte65,71], [Crapo Rota’lO], [Lawler’lG],[ Welsh761. The knowledge about matroids and polymatroids is not prerequisite to understanding submodular systems, though it certainly helps. For general information on submodular and supermodular functions see, e.g., [Choquet55], [Edm’lO],[Faigle87], [Frank+Tardos88], [Fuji84c], [Lov&z83], (Tomi Fuji821 and [Welsh76].
+
+
2. From Matroids to Submodular Systems 2.1. Matroids
The concept of matroid was introduced in 1935 by H. Whitney [Whit351 and independently by B. L. van der Waerden [WaerdenS’I]. The term, matroid, is due to Whitney. As the term indicates, a matroid is an abstraction of linear independence and dependence structure of the set of columns of a matrix. Let E be a finite set. Suppose that a family I of subsets of E satisfies the following (10)-(12): (10) 0 E I . (11) I1 12 E I =+- 11 E I. (12) 11, Iz E I, [Ill < 1121 ==+ 3e E 12 - 11:11u { e } E
c
I.
We call the pair ( E ,I ) a matroid. Each I E I is called an independent set of matroid ( E ,I ) and I the family of independent sets of matroid ( E ,I ) . An independent set which is maximal in I with respect to set inclusion is called a base. The family B of bases satisfies the following [BO)and (Bl): (BO) 8 # 0. (Bl) V B l , BZ E 8, Ve1 E B I - B Z , 3ez E B 2 - B l : ( B 1 - { e 1 . } ) U { e z } E 8 . A subset of E which is not an independent set is called a dependent set. A dependent set which is minimal with respect to set inclusion is called a circuit. The family C of circuits satisfies the following (C0)-(CZ): 17
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
(CO) c #
(01. vc1, c2 E c: c1 c c2 ===+ c1 = c2.
(Cl) (C2) VCl, C2 E C with C1 # C2, Ve E C1 n C2, 3C E C : C
G (C1 U C2) -
{elWe define the rank function p : 2E p ( x ) = max{ 1 for each X
+Z
of matroid ( E ,I ) by
I I c X, I E I }
(2.1)
c E . The rank function p satisfies the following (pO)-(p2):
(PO) VX C E : 0
1x1.
5 p(X) 5
xc
(PI) y 5 E ===+ P(X) I P(Y). (p2) V X , Y C E : p ( X ) p ( Y ) 2 p ( X U Y )
+
+p(X nY ) .
Any function p satisfying (p2) is called a submodular function on 2E. From (pO)-(p2) we see that p has the unit-increase property, i.e., for any X , Y 2 E with X Y and 1x1 1 = IYI we have p(Y) = p(X) or p(Y) = p(X) 1. Also define the closure function cl: 2“ + 2E of matroid ( E ,I ) by
c
+
+
Cl(X) = {e
I
e E E , P(X u {el) = P W ) }
(2.2)
C E . The closure function cl satisfies the following: VX C E : X 2 cl(X). VX, Y C E : X C cl(Y) ===+ cl(X) C cl(Y). VX C E , Ve E E : e’ E cl(XU{e}) -cl(X) ===+e E cl(XU{e’}) -cl(X).
for each X (c10) (cll) (c12)
For any independent set I E I and any element e E cl(I) - I, there exists a unique circuit contained in I U {e}. Such a circuit is called the fundamental circuit with respect to I and e, and is denoted by C(I1e). For any e’ E C(Ile), ( I U {e}) - {e’} is an independent set. It is well known (see [Welsh76]) that each of the family I of independent sets, the family €3 of bases, the family C of circuits, the rank function p and the closure function cl uniquely determines the matroid which defines it. Giving a system of axioms for each of the family B of bases, the family C of circuits, the rank function p and the closure function cl, we can define a matroid. We denote such a matroid by ( E , B ) , ( E , C ) , ( E , p ) and (E,cl), respectively. In fact, (BO) and (Bl), (C0)-(C2), (pO)-(p2), and (clO)-(c12), respectively, give the systems of axioms for the family B of bases, the family C of circuits, the rank function p , and the closure function cl of a matroid on E . For example, any integer-valued function p : 2E -+ Z satisfying (pO)-(p2) defines a matroid ( E , p )with the family I of independent sets given by
I
=
{II I 2 E , p ( I ) = [ I [ } . 18
(2-3)
2.1. MATROIDS
For a matroid M = ( E , B ) with a family B of bases, the family B* of the complements of bases of the matroid is also a family of bases of a matroid. The matroid M* = ( E ,8:) is called the dual matroid of M = ( E ,8). The dual of M* is equal to M, i.e., (M*)*= M. A matroidal term, say, “ X ” with respect to M* is referred to as “co-X” with respect to M. For example, bases and circuits of M* are called cobases and cocircuits of M. A self-dual system of axioms for the family of bases is given by N. Tomizawa [Tomi771as follows.
(BO’) B # 0. (Bl‘) VB1, B2
E
8, 3el E I31 - 232, 3e2 E B2 - B1: ( & - {el)) u { e 2 } E 8, (B2- (4)u {el}
E
8.
Examples of a Matroid (1) Graphs: For a graph G = (V,E ) with a vertex set V and an edge set E let I ( G ) be the set of those edge subsets each of which does not contain any cycle of G. Then M(G) = ( E ,I ( G ) ) is a matroid with I ( G ) being the family of independent sets. A matroid which can be obtained in this way is called a graphic matroid. Given an independence oracle for the membership in the family of independent sets, we can efficiently discern whether a given matroid is graphic and, if graphic, construct a graph representing it, by combining the algorithms of P. D. Seymour [Seymour811 and the author [Fuji80a] (also see [Bixby+Wagner881).
(2) Matrices: For a matrix A = [ a l , . . . , a , ] over some field with column vectors al, . ., a, let E = { 1,. . . ,n} be the column index set and I (A) be the set of those subsets of E each of which forms independent column vectors. Then M(A) = ( E ,I ( A ) ) is a matroid with I (A) being the family of independent sets. We say the matrix A represents (or is a representation of) the matroid M(A). A matroid which can be obtained in this way is called a matric matroid or a linear matroid. A graphic matroid is a matric matroid represented by the incidence matrix of the associated graph. A binary matroid is a matroid which can be represented by a matrix over the field of {O,l}. A regular matroid is a matroid which can be represented by a matrix over any field. A graphic matroid is a regular matroid. The dual of a binary (regular) matroid is also binary (regular). A characterization of regular matroids by decompositions is given in [Seymour801 which leads us to an efficient algorithm for discerning the regularity of a matroid. Extensive studies on matroid decompositions have been made by K. Truemper (Truemper].
-
(3) Bipartite matchings: For a bipartite graph G = ( V + , V - ; A )with left and right end-vertex sets V s and V - and an arc set A , define 19
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
I+
= {d+M
I M:
a matching of G},
(2.4)
where d+M is the set of left end-vertices of matching M . Then M+ = ( V + , I + ) is a matroid with I + being the family of independent sets. M+ is called a transversal matroid. Transversal matroids are matric. Consider the matrix P = ( p i j I i E V - , j E V + )with the row index set V - and the column index set V + such that (i) p i , # 0 (ii) p ; , = 0
if i E V - and j E V + are adjacent in G and otherwise.
Also, suppose that nonzero real elements p i , are algebraically independent, i.e., they do not satisfy any nontrivial multi-variable polynomial equation with rational coefficients. Then matrix P represents the transversal matroid M+. (4) General matchings: For a simple graph G = ( V , E ) a subset W of the vertex set V is said to be matchable if W is the set of the end-vertices of a matching in G. Let I be the set of subsets W of the vertex set V such that W is a subset of some matchable vertex set. Then (V,I) is a matroid, called a matching matroid.
(5) Algebraic matroids: Consider a field K and its extension H and let E be a set of a finite number of elements of H . Define I as the family of subsets X of E such that the elements of X do not satisfy any nontrivial multi-variable polynomial equation with coefficients chosen from K . Then ( E ,I ) is a matroid and is called an algebraic matroid. (6) Uniform matroids: Let E be a finite set with cardinality [El = n > 0. For any nonnegative integer k 5 n define
Then ( E , I k ) is a matroid. It is called a uniform matroid of rank k and is usually denoted by u k , n . In particular, Un,+= ( E ,2 E ) is called a free matroid and U O ,= ~ ( E ,(0)) a trivial matroid.
2.2. Polymat roids
Let E be a finite set and p be a function from 2E to R. Here, R is the set of reals but throughout this book R can be any totally ordered additive group such as the set Z of integers and the set Q of rationals unless otherwise stated. Suppose that the function p: 2 E + R satisfies
(3)P ( 0 ) = 0. 20
2.2. POLYMATROIDS
(3)
Figure 2.1.
(a)X C Y C E ==+ ~ ( xF )~ ( y ) .
(2) V X , Y C E : p ( X ) + p ( Y ) 2 p ( X U Y )+ p ( X n Y ) .
The pair ( E ,p ) is called a polymatroid and p the rank function of the polymatroid ((Edm7Ol). The rank function p is a monotone nondecreasing submodular function on 2 E with p ( 0 ) = 0 and does not necessarily have the unit-increase property as the rank function of a matroid. When p is the rank function of a matroid, polymatroid ( E ,p ) is called matroidal. Define
P(+)(P)= {x I x E R E ,x 2 0 , v.X 2 E : z ( X ) I ~ ( x ) } , (2.6) where for each X 5 E and x E RE
.(XI =
C z(e).
(2.7)
eEX
We define z(0) = 0. P(+)( p ) is called the independence polyhedron (or polymatroid polyhedron) associated with polymatroid ( E ,p ) . Also define
B b ) = {.
I x E P(+)b)l4 E ) = p(E)).
(2.8)
We call B(p) the base polyhedron associated with polymatroid ( E , p ) .The base polyhedron B(p) is always nonempty, which will be shown in Theorem 2.3. (See Fig. 2.1.) 21
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA It can be shown (see [Edm7O]) that the convex hull in RE of the characteristic vectors of the independent sets (or bases) of a matroid on E with the rank function p , where R is the set of reals, is the independence polyhedron (or the base polyhedron) associated with the matroidal polymatroid ( E ,p ) (see Corollary 3.25). Each z E P(+)(p) is called an independent vector and each z E B(p) a base of polymatroid ( E ,p ) . For an independent vector z E P(+)(p)define
D(z) = {X I
x 2 E , z(X) = p(X)}.
(2.9)
P(z) is closed with respect to set union and intersection, i.e., X, Y E P(z) ==+
X U Y, X n Y E P ( z ) , For, if X, Y E D(z), we have
o = ~(x)--s(x)+~(Y)-z(Y) 2 p(xuY)-z(XuY)+p(XnY)-z(XnY) 1 0, (2.10)
wherep(XUY)-z(XUY) 2 O a n d p ( X n Y ) - z ( X n Y ) 2 O s i n c e z E P(+)(p). It follows that X u Y, X n Y E D(z). So, D(z) is a distributive lattice with set union and intersection as the lattice operations, join and meet. Denote the unique maximal element of P(z) by sat(z), i.e., sat(z) =
U{X I x G E , Z(X)= p(x)}.
(2.11)
The function, sat: P(+)(p)+ 2E, is called the saturution function ([Fuji78a]). Informally, sat(z) is the set of the saturated components of x. More precisely,
I
sat(z) = { e e E E , VCX> 0:2
+ a x e $! P(+)( p ) } ,
(2.12)
where x e is the unit vector with x e ( e ) = 1 and x,(e’) = 0 (e’ E E - { e } ) . The saturation function is a generalization of the closure function of a matroid. For an independent vector z E P(+)(p)and an element e E sat(%)define
I
P(z,e) = {X e E X
c E , z(X) = p(X)}.
(2.13)
We have P ( z , e ) C P ( z ) and P ( z , e ) is a sublattice of D(z). Denote the unique minimal element of P ( z , e ) by dep(z, e ) , i.e., dep(z,e) = n { X
1 e E X C E,
z ( X )= p(X)}.
(2.14)
For each e E E - sat(z) we define dep(z, e) = 0. The function, dep: P(+)( p ) x E -+2E, is called the dependence function (see [Fuji78a]). For z E P ( + ) ( p ) and e E sat(z), dep(z, e ) = {e’
1 e’ E E ,
3n > O:Z 22
+
Q(Xe -
x e ~E) P ( + ) ( p ) } ,
(2.15)
2.2. P 0LY MATROID S
Figure 2.2. where note that for e' E dep(x,e) - {e} we have x(e') > 0. We call an ordered pair (e,e') such that e' E dep(x,e) - {e} an exchangeable pair associated with x. The dependence function is a generalization of a fundamental circuit of a matroid. For x E P(+)(p)and e E E - sat(x) define i.(x,e) = max{a
1
QI
E R,
X+ axe
E P ( + ) ( p ) } (> O ) ,
(2.16)
which is called the saturation capacity associated with x and e. The saturation capacity is also expressed as t(x, e) = min{p(X) - x(X) I e E X
c E}.
(2.17)
+
For any CY such that 0 5 a 5 2(x, e) we have x axe E P(+)( p ) . For x E P(+)(p), e E sat(x) and e' E dep(x,e) - {e}, define c"(x,e,e') = max{a
I
QI
E R, x
+a(Xe -
xet)
E P(+)(p)}(> 0 ) ,
which is called the ezchange capacity associated with x, e and e'. 2.2.) The exchange capacity is also expressed as c"(x,e, e') = min{p(X) - x(X) 1 e E X C E , e' $ X}, where note that x(e') 2 t(x, e,e'). For any have 2 + a ( X e - x e l ) E P(+)(P).
CY
such that 0 5 cr
(2.18) (See Fig. (2.19)
5 C(x,e,e') we
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA A vector v E RE such that x 5 v for any x E P(+)( p ) is called a dominating vector of ( E , p ) . Note that v E RE is a dominating vector of ( E , p ) if and only if v ( e ) 2 p ( { e } ) for all e E E . For a dominating vector v of the polymatroid P = ( E , p ) define p i u , : 2E -+ R by Pi,) ( X )= . ( X )
+ P(E - X ) - P(E)
(X
c El.
(2.20)
Then Piu = (E,pi,,))is a polymatroid and is called the dual polymatroid of P = ( E , p )with respect to v ([McDiarmid75]). (See Fig. 2.3.)
0'
O1
Figure 2.3. For most polymatroids there is no reasonable and physically meaningful way of choosing a dominating vector v and the arbitrariness of dual polymatroids remains, though the choice of v = ( p ( { e } ) I e E E ) may be reasonable. For matroidal polymatroids, the matroid duality corresponds to the polymatroid duality with respect to the vector 1 of all the components being equal to 1. Examples of a P o l y m a t r o i d (1) Multiterminal flows: Consider a capacitated flow network N = (G = (V,A ) , c , S+, S - ) with the underlying graph G = (V,A ) , a nonnegative capacity function c: A + R + , the set S+ of entrances and the set S- of exits, where 24
2 . 2 . P 0 LYMAT RO I D S S+, S- C V and S+ n S- = 0 . We assume that there is no arc entering S+ or leaving S - . A function p: A + R is a feasible flow in M if
Va E A: 0 5 p(a) 5 c(a),
(2.21)
v - (S+ u s-):dp(v) = 0,
vv E
(2.22)
where dp: V -+ R is the boundary of p defined by (2.23) aE6+v
aE6-u
It is shown (see [Megiddo74]) that the set {(dp)” I p: a feasible flow in M} is the independence polyhedron of a polymatroid on the set S+ of entrances, where ( 8 ~ ) is ~ the ’ restriction of dp on S+. Similarly, we have a polymatroid on the set S- of exits. (2) Linear polymatroids: Let A be a matrix with the column index set E . Suppose that E is partitioned into nonempty disjoint subsets Fl, F2, ..., F,, and define 6 , = { 1 , 2 , - .,n}. Also define for each X & ,6
p ( X ) = rankAX,
(2.24)
where A X is the submatrix of A formed by the columns of A with the indices in U{F, I i E X } . We see that ( , 6 , p ) is a polymatroid, which is called a linear polymatroid. (3) Entropy functions: Let 21, 2 2 , ..., z, be random variables taking on values in a finite set { 1 , 2 , . - ,N } . For the set E = {XI,- . ,z}, of the random variables, define for each subset X of E
-
3
the entropy of X in the Shannon sense 0 if X = 0.
h(X)=
-
For example, if X = {z1,22,
h(X)= -
N
N
il=l
ik=l
C C
p(z1
9
,z k }
(1
if X #
0,
(2.25)
5 k 5 n) ,
= i1,***,zk = ik) log,p(zl = i 1 , . * - , z k = ik),
(2.26)
where p ( z 1 = 21,. ,z k = ik) is the probability of the event that x1 = il, . .-, xk = ik. The function h : 2 E -+ R+ is called an entropy function. Entropy function h is a monotone nondecreasing submodular function with h(0) = 0, 25
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA i.e., ( E , h ) is a polymatroid. See [Fuji78c] for polymatroidal problems in the Shannon information theory. (4) Convex games: Consider a characteristic-function game (see, e.g., [Shubik821). Let E = {1,2, n} be a set of n persons, called players. A characteristic function v is a nonnegative function defined on the set of coalitions which are subsets of E , where we assume v ( 0 ) = 0. A characteristic-function game ( E ,v ) is called a convez game ([Shapley’ll]) if the characteristic function v is supermodular, i.e., e . ,
VX,Y
C E : v ( X ) + v ( Y ) 5 v ( X u Y )+ v ( X n Y ) .
(2.27)
The core of the game ( E , v ) is the set of payoff vectors defined by {z
I z E RE,V X C E : z ( X ) 2 v ( X ) , z ( E )= v ( E ) } .
Define the function v # : 2E
-+
(2.28)
R by
v # ( E - X ) = v ( E )- v ( X ) ( X
CE).
(2.29)
Then we can show that v # is a polymatroid rank function and that the core given by (2.28) coincides with the base polyhedron B(v#) of the polymatroid (see Lemma 2.4).
2.3. Submodular Systems
Let E be a nonempty finite set and D be a collection of subsets of E which forms a distributive lattice with set union and intersection as the lattice operations, join and meet, i.e., for each X , Y E D we have X U Y , X n Y E D . Let f : D --+ R be a submodular function on the distributive lattice D, i.e.,
We have the following fundamental lemma concerning submodular functions.
Lemma 2.1 ([Ore56]): Let f : D a distributive lattice D
C 2E.
--+ R be an arbitrarysubmodular function on Then the set of all the minimizers o f f given by
(2.31) forms a sublattice of D , i.e., for any X , Y E 26
DO we have X U
Y, X n Y E
Do.
2.3. SUBMODULAR SYSTEMS
Figure 2.4. (Proof) For any X, Y E PO,
u Y),f ( X n Y ) }2 f(X) = f(Y).Hence we must have f(xU Y ) = f ( X n Y )= f(X)(= f ( y ) ) i.e., , X UY , X n Y E PO. Q.E.D.
where min{f(X
For a submodular function f on a distributive lattice D 5 2E with 8, E E D and f(0) = 0, we call the pair (P, f ) a submodular system on E, and f the rank function of the submodular system (see [Fuji78b, 84~1).We call f(E) the rank of ( D l f ) . Define a polyhedron in RE by
P(f) = {Z I x E RE,VX E
D: z(X) 5 f(X)}.
(2.33)
We call P(f) the submodular polyhedron associated with submodular system ( D , f ). Also define
B(f) = {.
I Z E P(f), 4 E ) = f ( E b
(2.34)
We call B(f) the base polyhedron associated with submodular system (P, f ) . (See Fig. 2.4.) 27
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA A vector in the base polyhedron B(f) is called a base of (D,f ) and a vector in the submodular polyhedron P ( f ) is called a subbase of (D,f ). The saturation function, the dependence function, the saturation capacity and the exchange capacity introduced for polymatroids can easily be extended for submodular systems.
Lemma 2.2: For any subbase x E P(f) define D(x) = {X I X E D, x(X) = f(x)}. Then D(x) is a sublattice of
(2.35)
D.
(Proof) This follows from Lemma 2.1 since D(x) is the set of minimizers of the nonnegative submodular function f - x: D + R . Q.E.D. The unique maximal element of D ( x ) is denoted by sat(x). sat: P(f) + 2E is the saturation function. For any subbase x E P(f) and e E sat(x), define D(x,e) = {X I e E X E
D, x ( X ) = f(X)}.
(2.36)
Then D ( x , e ) is a sublattice of D. (Note that D(x,e) is the set of minimizers of the nonnegative submodular function f - x on the distributive lattice D(e) { X I e E X E D}.) The unique minimal element of D(x,e) is denoted by 2E dep(z,e). For any e E E -sat(s) we define dep(x,e) = 8. dep: P(f) x E is the dependence function. For any x E P(f) and e E E - sat(x) the saturation capacity Z(x,e) is defined by (2.37) cI(x,e) = min{f(X) - x(X) I e E X E D}. --f
+
For a nonnegative a,we have x axe E P(f) if and only if 0 5 a 5 Z(x, e ) . Moreover, for any x E P(f), e E sat(x) and e' E dep(z,e) - {e} the exchange capacity Z(x, e, e') is defined by Z(x, e, e') = min{f(X)
-
x(X) I e E X E
D, e' $ X } .
(2.38)
For a nonnegative a , we have z + a(xe- x e # )E P(f) if and only if 0 5 a 5 C"(x,e,e'). (Note that if 2: E B ( f ) , then 3: a(xe- xet) E P(f) implies + a ( x e - E B(f)*)
+
x e l )
Theorem 2.3: The base polyhedron B(f) is the set of all the maximal subbases of (D,f).In particular, B ( f ) # 0. Here, the partial order 5 among vectors in RE is the one defined for vector lattice RE (i.e., for x, y E RE we have x 5 y i f and only i f x ( e ) 5 y(e) for all e E E ) . 28
2.3. SUBMODULAR SYSTEMS
(Proof) Denote by B'(f) the set of all the maximal subbases of (D,f). Any x E B(f) is maximal in P(f) since z ( E ) = f ( E ) ,so that we have B(f) E B'(f). Conversely, for any x E B'(f) we have sat(z) = E due to the maximality of 5. It follows that z ( E ) = s(sat(z)) = f(sat(z)) = f ( E ) ,i.e., x E B(f). Therefore, B'(f) C B(f), and hence we have B'(f) = B(f). Q.E.D. From Theorem 2.3 we see that for any subbase z of (D, f ) there exists a base y of ( 0 ,f ) such that x 5 y. A function g: D 4 R on the distributive lattice D is called a supermodular function if -g is a submodular function, i.e.,
If 0, E E
D
and g(0) = 0, the pair (D,g) is called a supermodular system on E .
Define P(g) = {x I x E
B(g) = {x
R E ,VX E D: x(X) 2 g(X)},
I 2 E P(g),
x ( E ) = g(E)}.
(2.40) (2.41)
P(g) is called the supermodular polyhedron and B(g) the base polyhedron associated with the supermodular system (D,g). A vector in P(g) is called a superbase and a vector in B(g) a base of (D,g).
A function which is submodular and at the same time supermodular is called a modular function. For a modular function x: D -+ R, P(z) should be considered as either a submodular polyhedron or a supermodular polyhedron according as we consider x as a submodular function or a supermodular function. There will be no confusion by the use of this notation. If we consider the dual order I* of the ordinary order I among R (where the dual order I* is the one such that a I* /3 if and only if p 5 a, for each a,@ E R ) , then a supermodular function g: D 3 R with respect to (R, 5 ) is a submodular function with respect to (R, I*). In the same way the supermodular polyhedron P(g) and a superbase x E P(g) with respect to (R, 5 ) is a submodular polyhedron and a subbase with respect to (R, <*). -+ R as For a submodular system (D,f)on E define a function f # : follows.
-
D ={E-
f#(E- X)
x I x E D},
(2.42)
f ( E )- f ( X ) (X E D).
a
(2.43)
of D. We call the pair ( D , f # ) the dual supermodular system of ( D , f ) . (See Fig. 2.5.) Similarly, we
f_# is a supermodular function on the dual lattice
29
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA 2
0
Figure 2.5. define the dual submodular system (D,g#) of a supermodular system ( D 7 g ) , where is defined by (2.42) and g# by (2.43) with f replaced by g .
D
Lemma 2.4: We have B(f) = B ( f # ) and ( f # ) # = f . (Proof) Consider the system of inequalities and a n equation for base polyhedron
B(f):
.(X)
I f ( X ) (XE 017
(2.44a)
4E)= f(E).
(2.44b)
This is equivalent to the following:
which defines B ( f # ) . Furthermore, for X E
7= D
(2.46) 30
2.3. SUBMODULAR SYSTEMS Q.E.D.
It follows that (f#)# = f.
It should be noted that in the above proof we do not use the submodularity o f f and the lattice properties of D. That is, Lemma 2.4 holds for any function f on any family D without the submodularity of f , where we define and f # by (2.42) and (2.43). The submodular/supermodular polyhedron and the base polyhedron of a submodular system also arise from more general functions. A family 3 2E is called an intersecting family if for each intersecting X , Y E 3 (i.e., X , Y E 3 and X n Y # 0) we have X u Y , X n Y E 3. A function f: 3 + R on the intersecting family 3 is called intersecting-submodular if for each intersecting X , Y E 3 we have the submodularity inequality
f ( X I + f ( Y )2 f ( X u Y ) + f ( X n Y ) .
(2.47)
Moreover, a family 3 C 2E is called a crossing family if for each crossing X , Y E 3 (i.e., X , Y E 3, X n Y # 0, X - Y # 0, Y - X # 0, and X u Y # E ) we have X u Y, X n Y E 3. A function f: 3 -+ R on the crossing family 3 is called crossing-submodular if for each crossing X , Y E 3 we have the submodularity inequality (2.47) (see [Edm+Giles77]). Note that the term, submodular, without any prefix is used for such a function f: D + R on a distributive lattice D that satisfies (2.47) for all X , Y E D. The following theorems, Theorems 2.5 and 2.6, concerning intersectingand crossing-submodular functions on intersecting and crossing families, play a very important r81e in the combinatorial optimization problems described by intersecting- or crossing-submodular functions on intersecting or crossing families, and reveal the essential combinatorial structures of the problems (which will also be seen in Chapter 111). The proofs of Theorems 2.5 and 2.6 will be given in Section 3.4.
Theorem 2.5 [Fuji84b]: (i) Let f be an intersecting-submodular function on an intersecting family 3 5 2E with 0, E E 3 and f(0) = 0. Define
P(f) = {z I z E R E , V X E 7 : x ( X ) I f(X)}.
(2.48)
Then there exists a unique submodular system (PI, f1) on E such that
P ( f ) = P(f1).
(2.49)
Moreover, i f f is integer-valued, then fi is also integer-valued. (ii) Let f be a crossing-submodular function on a crossing family ? & 2E with 0, E E 3 and f(0) = 0. Define
B(f) = { X
I x E RE,V X E ?:
x ( X )5 f ( X ) ,x ( E ) = f ( E ) } 31
(2.50)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA and suppose B ( f ) on E such that
# 0. Then there exists a
unique submodular system
(P2,fz)
B ( f ) = B(f2). Moreover, i f f is integer-valued, so is
(2.51)
f2.
Theorem 2.6 [Fuji84b]: (i) Let f be an intersecting-submodular function on an intersecting family 3 2 2E with 0, E E 3 and f(0) = 0. The rank function f~ of the submodular system ( P I ,f l ) in (i) of Theorem 2.5 is given as follows. For each Y C E define
I {xi I i E I } : a partition of Y,
fP(y) = m i n { C f(xi) iEI
Vi E I :
xi E 7 } ,
(2.52)
where fp(Y) = +oo if the minimum in (2.52) is taken over the empty set. Then, fl is the restriction of fp on D1 = {Y I Y E , f , ( Y ) < +m}. (ii) Let f be a crossing-submodular function on a crossing family 3 2E with 0, E E 3 and f(0) = 0. Define f p ( ~ )= min{
C f(xi)I
{Xi I i E I } : a partition of E ,
i€I
ViE I:
(f#)p(E)= m a x { x f#(Xi)
I
xi E 3 } ,
(2.53)
{Xi I i E I } : a partition of E ,
iEI
Vi E
I: E
- Xi E
3},
(2.54)
where
f#(X) = f ( E ) - f ( E - X) ( E - X E 3).
(2.55)
Then B(f) defined by (2.50) is nonempty if and only if
or equivalently
Cf # ( ~I ) f ( ~I)C f(xi) j € .I
(2.57)
iEI
for any partitions {Xi I i E I} and {Yj I j E J } of E with Xi E 3 (i E I) and E - Yj E 3 ( j E J ) . 32
2.3. SUBMODULAR SYSTEMS Moreover, if B(f) # 0, the rank function f 2 of ( D z , fz) in (ii) of Theorem 2.5 is given its follows. For each Y C E define fz in terms of its dual by
where
fP(y) =min{C
f(x;)I {x;I i E I>:a partition of Y,
;€I
'di E I : 3p
= {X I
x s E, f,(X)
X;E 3) (Y E ) ,
(2.59)
< +m>,
(2.60)
(fP)#(X) = f ( E ) - fP(E - X) (E - x E 7P)
(2.61)
and the minimum (or maximum) taken over the empty set is equal to +m (or -m). The rank function f2 is the restriction of fz on DZ = {X I X 2 E, fZ(X) < +4. Function fp in (2.52) is called the Dilworth truncation of the intersectingsubmodular function f : 3 --f R (see [Dilworth44], [Edm7O], [Lov&sz77]). We also call f, in (2.59) the Dilworth truncation of the crossing-submodular function f : 3 -+ R. Note that f2# in (2.58) is the Dilworth truncation of the -+ R. f 2 is also called the biintersecting-supermodular function ( f p ) # : truncation o f f in [Frank Tardos881. Since B ( f ) = B(f#), we can also obtain a dual formula for f 2 , beginning with f # instead of f . It should be noted that for a crossing-submodular function f on a crossing family 3 the polyhedron P(f) defined by (2.48) may not be a submodular polyhedron but that the intersection of P ( f ) with any hyperplane s ( E ) = k (const.), if not empty, is a base polyhedron (see Fig. 2.6).
+
Examples of a Submodular S y s t e m Matroids and polymatroids are examples of a submodular system. We show some non-polymatroidal submodular systems. (1) C u t functions: A typical non-polymatroidal submodular system arises from network flows. Let N = (G = (V,A),g,E) be a capacitated network with the underlying graph G = (V,A) and the lower and upper capacity functionsc:A -+ RU{-m}
33
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA 43)
A
/
0
0
I I
I I
41)
I I
Figure 2.6. P ( f ) for a crossing-submodular function f .
5
and i?A + R U {+m} such that c ( a ) - 2' -+ R U {+m} by function n,,~:
%,a(U) =
c
qa) -
Z(a) for each arc a E A . Define a
c
C(4
(U
c V),
(2.62)
a€ A - U
aEA+ U
where A + U is the set of arcs leaving U in G and A-U is the set of arcs entering U in G. For each U,W E 2' such that K ~ , ~ (
+ .c,a(W) -
- &,F(U
u W )- 'C.,a(U n W )
I
= c { ' Z ( a )- ~ ( a )a E A , a s a E U - W , d - a E W
+ x { Z ( a )- c ( a ) I a E A , 8 - a
-
U}
E U - W , d'a E W - U }
2 0.
(2.63)
Therefore, P ( c , C ) 2 2E defined by
P(,.)
= {U
I u c v, Kc,,(U) < +m}
(2.64)
is a distributive lattice with 0, V E P ( c , C ) . Denoting the restriction of tccc3z to P(c,'Z) by K,,T - again, we have a submodular function 'cg.zon the distributive 34
2.3. SUBMODULAR SYSTEMS the cut function lattice P(c,Z), where s,,C(@)= s:,?(V) = 0. We call s c , ~ associated with network N = (G = (V,A),c,Z). The cut function sc,?is not monotone nondecreasing for nontrivial networks. A feasible $ow p in = (G = (V,A),c,Z) is a function p: A -+ R such that c ( a ) 5 p(a) 5 Z(a) for any a E A,’ The set of the boundaries dp of feasible flows p in .A( = (G = (V,A),c,Z) is given by
which is the base polyhedron associated with the submodular system ( D ( c , Z ) , n,,?). (See (2.23) for the definition of the boundary dp.) The fact that each base in B(n,,z) is expressed as the boundary d p of a feasible flow p in N can be shown by the use of the feasible circulation theorem (Theorem 1.3) of A. J. Hoffman [Hoffman601as follows. For any x E B(sc,?), - consider a new vertex s 4 V and new arcs ( s , ~ ) (v E V ) ,and definec(s, v) = E(s,v) = z(v) (v E V ) . Denote the augmented network by 1’= (G’ = (V U { s } , A U { ( s , v ) I v E V}),c,E). There exists a feasible circulation (a feasible flow with the zero boundary) in .A(’ if (and only if) for every U C V U {s} we have (2.66) where As and A- are with respect to GI. (2.66) is equivalent to z E B(sG,z). Therefore, there exists a feasible circulation p in N’. Restricting p to A , we obtain a required feasible flow in U whose boundary is equal to x . The converse, d @ B(sC,z), is immediate. (2) Cross-free families: For a finite set E let 3 2E be a cross-free family, i.e., for each X , Y E 3 X and Y do not cross, where we assume 0, E E 3. Then for any function f : 3 R with f ( 0 ) = 0, if B(f) = { x I x E RE,VX E 3 : 5 ( X ) 5 f ( X ) , z ( E ) = f(E)} # 0, B(f) is a base polyhedron due to Theorem 2.5, since 3 is a crossing family and f is a crossing-submodular function on 3. Moreover, if 3 is laminar, i.e., for each X , Y E 3 X n Y # 0 implies X Y or X 2 Y , then for any function f on 3 P(f) = { z 1 x E R E ,V X E 3 : x ( X ) 5 f ( X ) } is a submodular polyhedron due to Theorem 2.5. Note that laminar 3 is an intersecting family and that f is an intersecting-submodular function on 3. Also, if all the members of 3 form a chain Xo c XIc . . c X,,3 is called nested. A nested family is laminar and any function f on a nested family 3 with 0, E E 7 and f(0) = 0 gives the submodular polyhedron P ( f ) . It should --f
35
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA also be noted that a nested family trivially forms a distributive lattice. See [Tamir80] for an application to a production-sales planning model.
3. Submodular Systems
In this section we show basic properties of submodular systems. 3.1. Fundamental Operations on Submodular Systems
We introduce several fundamental operations on a submodular system on E .
(D,f )
(a) Reductions and contractions by sets For any A 6 D define
DA
={X
1A2X
E
D},
f A ( X )= f ( X ) ( X E P A ) .
(3.1) (34
Then ( P A ,f A ) is a submodular system on A and is called the reduction or the restrictionof ( D , f ) to A . Wedenote(DA,fA)by ( D , f ) . A o r( D , f ) - ( E - A ) . Also define for A E D
DA
I A C X C D},
={X -A
fA(x)=
f(xu A )
-
!(A)
(xE PA).
(3.3)
(3.4)
Then we have a submodular system ( D A , ~ A )on E - A , which is called the contraction of ( D , f ) b y A and is denoted by ( D , f ) / Aor ( D , f ) x ( E - A ) . We call a submodular system obtained by repeated reductions and/or contractions of (D,f ) by sets a set minor of (D,f).
Lemma 3.1: For any A E D let x A be a base of the reduction (D,f ) A of submodular system ( D , f ) to A and X A be a base of the contraction ( D , f ) / A of (D,f ) by A . Then the direct sum P = xA @ X A of x A and X A defined by
is a base of (D, f ). Conversely, for any base P of (D, f ) satisfying 2(A ) = f ( A ) , restricting P on A (or on E - A ) yields a base of (D,f) A (or (D,f)/ A ) . 36
3.1. FUNDAMENTAL OPERATIONS ON SUBMODULAR SYSTEMS
(Proof) If x A is a base of any X E D
(D,f ) - A and X A
is a base of
(D,f ) / A ,we have for
Since P(E) = f ( E ) , it follows that P is a base of ( D , f ) . Conversely, if P is a base of ( D , f ) and satisfies ? ( A ) = f ( A ) ,then for any X E D A and Y E DA
."(X)
=
W) 5 f(W,
(3.7)
zA(Y)= P(Y U A) - ?(A)I f ( Y U A ) - f ( A ) .
(3.8)
Q.E.D. Lemma 3.2: For any X E D there exists a subbase x E P(f) such that x ( X ) = f ( X ) . Furthermore, for any X 2 E - D and any K > 0 there exists a subbase x E P(f) such that z ( X ) 2. K . (Proof) The first half follows from Lemma 3.1. The second half is shown as follows. For any X E 2 E - D there exist e E X and e' E E - X such that for each Y E D with e E Y we have el E Y . (For, if for each e E X and el E E - X there were Y E D such that e E Y and er 4 Y ,denoting one such Y by Ye,,!,we would have X = UeEX n e ' E E - X Ye,,!E P.) Hence for any y E P(f), yd y d ( x , - x e t ) belongs to P(f) for any d > 0. Therefore, the Q.E.D. value, y d ( X ) = y ( X ) d , can be made arbitrarily large.
+
+
(b) Reductions and contractions by vectors For any vector
3:
E RE define a function f": 2 E + R by
f " ( X ) = min(f(2)
+z(X-
2) I X 2 Z E
D}
(3.9)
for each X C E. Then the function f x : 2 E + R is a submodular function on the Boolean lattice 2E. For, denoting by ZX a minimizer Z of the right-hand side of (3.9), we have for each X , Y C E
+
+
f"(X) + f+(Y)= f ( Z x )+ z ( X - Z X ) f ( Z y ) x ( Y - 2,) 2 f ( Z X u Z Y ) + .((X u Y )- ( Z X u ZY)) + f ( zn~ZY)+ .((x n Y ) - (zXn zY)) (3.10) 2 f " ( X u Y ) f X (nxY ) .
+
37
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
Figure 3.1. We call the submodular system (2E,fZ) the reduction of (P,f)by vector x. A base of the reduction ( z E ,f") is called a base of x in (P, f). Define (3.11) W)"= {Y Y E P ( f ) , Y 5 4 ,
I
which is the set of subbases of
(P, f ) smaller than or equal to
z (see Fig. 3.1).
Theorem 3.3: The submodular polyhedron associated with the reduction ( 2 E , f") of ( 0 ,f) by vector z is given by
Also, if z is a superbase of (P, f), i.e. z E P ( f # ) , then
where B(fIZ = {Y
I Y E B ( f ) , Y 5 .I.
(Proof) For any y E P ( f Z ) ,we see from (3.9) with X = 2 E Z = 0 that
D
or X = {e}
2
vx E D: Y(X) I f(X),
(3.14)
b'e E E: y(e) 5 z(e).
(3.15)
38
3.1. FUNDAMENTAL OPERATIONS ON SUBMODULAR SYSTEMS Hence y E P(f).. Conversely, for any y E P(f). we have (3.14) and (3.15). For any 2, X C E with X 2 Z E D,
Hence y E P(fz). Moreover, (3.13) follows from (3.12) and Theorem 2.3 since there exists a base y E B(f) such that y 5 x. Q.E.D.
For a supermodular system ( P , g )on E we define the reduction of ( 0 , g ) by a vector 5 E RE in a dual manner. Define gr: 2E t R by
g,(X) = max{g(Z) P(gL = {Y
+ x(X - 2 ) I X 2 Z E P},
(3.17)
I Y E P(g), Y 1 4
(3.18)
.
Then ( 2 E ,gz) is the reduction of (P, g) by x and its associated supermodular polyhedron is given by P(9.) = P(dZ (3.19) due to Theorem 3.3. From Lemma 3.2,Theorem 3.3 and (3.9) we have the following min-max relation.
Corollary 3.4: min(f(2)
+x(E
-
2 ) I Z E D} = max{y(E)
I y E P ( f ) , y 5 x}.
(3.20)
(Proof) It is easy to see that
for any Z E D and any y E P ( f ) with y 5 x. On the other hand, from (3.9) with X = E and Lemma 3.2 there exists a subbase y of (2”,f“) such that y ( E ) = fz(E). Since P(fz) = P(f)= due to Theorem 3.3, this shows the existence of Z E D and y E P ( f ) with y 5 x such that (3.21) holds with equality. Q.E.D.
In particular, for x = 0 (3.20) becomes
Corollary 3.5:
39
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
Figure 3.2. Next, for any subbase x E P(f) define a function fi: 2E
fi(X) = min(f(2)
-x(2-X
) IX
ZE
--f
P}
R by (3.23)
for each X 2 E . Similarly as in (3.10), we see that fi: 2E -+ R is a submodular function on the Boolean lattice 2E. Here, it should be noted that fi(0) = 0 due to the fact that x E P ( f ) . We call the submodular system (2E,fi) the contraction of (D,f ) by vector 2 E P (1).
Theorem 3.6: For any subbase x E P ( f ) we have (3.24) (3.25)
(Proof) Since x E P ( f ) , we have fi(E) = f ( E ) . (3.24) easily follows from (3.23) and the definition of the dual function. Furthermore, from (3.20), Theorem 3.3 and the duality shown in Lemma 2.4 together with the remarks given after it, we have (3.26) B ( f J = B((fZ)#) = B((f#-)z) = B ( f # ) i = B ( f ) i
Q.E.D. The contraction of ( D , f ) by x E P ( f ) corresponds to the reduction of its f # ) by x (see Fig. 3.2). dual supermodular system
(a,
40
3.1. FUNDAMENTAL OPERATIONS ON SUBMODULAR SYSTEMS
For any subbase x E P ( f ) define [P(f)l” = {Y
I Y E R E ,x v Y E P(f)),
(3.27)
where x v y is the vector in RE defined by (xVy)(e) = max{x(e),y(e)} (e E E ) , i.e., the join of x and y in the vector lattice RE.
Lemma 3.7: For any subbase x E P ( f ) ,
(Proof) For any y E P(fz),we have from (3.23)
for any X and 2 such that X C 2 E D. This implies z V y E P ( f ) . Conversely, for any y E [P(f)lz, we have (3.29) for any X and 2 such that X C 2 E D, from which follows the fact that y E P(fz). Q.E.D. In a dual manner we define the contraction (zE,g”) of a supermodular system ( D , g ) by a superbase x E P(g), where g” = ((g#)”)#. A submodular system obtained by repeated reductions and/or contractions of submodular system (D, f ) by vectors in RE is called a vector minor of (D,f ) .
Theorem 3.8: If vectors x, y E RE satisfy (i) x 5 y , (ii) B(f)z # 0 (i.e., z is a subbase) and (iii) B ( f ) y # 0 (i.e., y is a superbase), then we have B ( f ) i (= ( B ( f W = (B(f)Y)”) # 0. (Proof) Since z E P(f), y E P(f#) and z 5 y, we have y E P ( f # ) z = P((fz)#). Q.E.D. Hence, B(f)g = B(f3C)y= B((fz)#)y # 0. For any x E RE the rank of the reduction of (D, f ) by x is denoted by r f ( x ) ( = f”(E)). The function r f : RE -+ R is called the vector rank function of ( D , f ) . From the definition, r j is a concave function (see (3.9)). (c)
Translations and sums
For any vector x E RE the translation of a submodular system ( D , f) by x is the submodular system whose rank function is given by f x: D -+ R , where x should be considered as a set function (a modular function) on 2” by x),we have x ( X ) = CeEX x(e) ( X E ) . For the translation ( D , f
+
+
(3.30) (3.31) 41
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
Figure 3.3. where x in the right-hand sides is in R E and the sums in the right-hand sides denote the vector sum (see Fig. 3.3). It should be noted that a contraction of ( 0 , f ) by x E P ( f ) followed by a translation by -x corresponds to an ordinary contraction of a (poly-)matroid (see [Fuji8Ob]). The combinatorial structure of the submodular polyhedron and the base polyhedron is invariant with respect to translations and the rank function can be made monotone nondecreasing by an appropriate translation (see Lemma 3.23 in Section 3.3.a). Therefore, the monotonicity of the rank function plays no essential r81e in the theory of submodular systems but sometimes makes it easier for us to find an initial feasible solution in algorithms. Also, any results obtained in (poly-)matroid theory which are invariant with respect to translations can easily be extended to submodular systems. For example, we will generalize the polymatroid intersection theorem of Edmonds [Edm70] to submodular systems in Section 4.1. For two submodular systems (01, f l ) and (02,f2) on E the sum of the two submodular systems is defined as the submodular system (01 fl 02, f l f2) on E . We have
+
42
3.1. FUNDAMENTAL OPERATIONS ON SUBMODULAR SYSTEMS
and (3.33) will be shown in Section 4.2.) Note that a translation is a special case of a sum.
(d) Other operations For a submodular system (D, f ) on E let r be an arbitrary nonnegative element in R.Define
Then (D,f-r) is also a submodular system on E and is called the r-truncation of ( D , f ) . Similarly, we define the r-truncation, (D,g+r), of a supermodular system (0,s)by
The dual of the r-truncation of the dual supermodular system of the submodular system (D,f ) is called the r- elongation of (D,f ) ([Tomi8la]) (see Fig. 3.4).
Figure 3.4. 43
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Denoting the r-elongation of
(D,f ) by (D,f + r ) ,
we have (3.38)
Similarly, in a dual manner we define the r-elongation of a supermodular system. For a submodular system (D,f ) on E and any a E R define (3.39) Suppose (Y 5 0. Then f ( O ) : D --t R is a crossing-submodular function on D. If B(f(")) # 0, then by Theorem 2.5 there uniquely exists a submodular system (D,f"(")) on E such that B(f(a)) = B(f(")). We call ( D , f " ( a ) ) the la[abridgment of ( D , f ) . Also, suppose (Y 0. Then (D,f'")) is a submodular system and is called the a-enlargement of ( D , f ) . (For the abridgment and enlargement also see [Tomi8lb,8lc].) The concepts of abridgment and enlarge0 and € 0);in a convex ment also appear in the game theory as €-core ( € game an €-core for E 2 0 (or 5 0) is exactly the base polyhedron of the Eabridgment (or 161-enlargement) of the associated submodular system defining the convex game (see [Shubik82]). For any partition II = { A l , A z , - . - ,ofAE ~ )a subset X of E is said to be compatible with ll if, for each Ai E II, Ai n X # 0 implies Ai g X. Define
>
>
<
(3.40) D(n)= {X I X E D, X is compatible with ll} and denote the restriction of f to D(n)by fn. The pair (D(II),fn)is a sub-
modular system on E and is called the aggregation of ( D , f ) by II. Aggregations play a fundamental r61e in a decomposition theory for submodular systems ([Fuji83], [Cunningham83b]) which generalizes the decomposition theory of graphs by Tutte [Tutte66].
3.2. Greedy Algorithm
In this section we consider a linear optimization problem over the base polyhedron and give an algorithm, called a greedy algorithm, for solving the problem. Before getting into the problem, we first examine the structure of the distributive lattice D C 2E and show the one-to-one correspondence between the set of distributive lattices D 2 E with 0, E E D and the set of partially ordered sets (posets) on partitions of E .
(a) Distributive lattices and posets 44
3.2. GREEDY ALGORITHM
For a distributive lattice D C zE the cardinality [Dlof D can be as large as 2IEI and listing all the elements of D to represent it is not practical even for medium-sized E . We shall show how to efficiently express a distributive lattice as a structured system, a poset, on E . Let D C 2E be a distributive lattice with 0, E E D. A sequence of monotone increasing elements of D
is called a chain of D and Ic is the length of the chain C. If there exists no chain which contains chain C as a proper subsequence, C is called a maximal chain of D. If C given by (3.41) is a maximal chain, we have SO= 8 and s k = E . For each e E E define
D ( e ) is the unique minimal element of and e' E D(e) we have D(e')
D containing e . Note that for any e E E
c D(e).
(3.43)
Also let G ( D ) = ( E , A ( D ) )be a (directed) graph with a vertex set E and an arc set A(D) given by
A(D)= {(e,e')
IeE
E , e' E D(e)}.
(3.44)
Decompose the graph G(D) into strongly connected components Gi = (Fi,Ai) (i E I ) . Let 5~ be the partial order on the set of the strongly connected components {Gi I i E I } naturally induced by the decomposition (i.e., G i , d ~ G i , for il, 22 E I if and only if there exists a directed path from a vertex of Gi, to a vertex of G i , ) . Note that from (3.43) G ( D ) is transitively closed (i.e., if there is a directed path from a vertex v l to a vertex v 2 , then there is an arc (v1, v2) in G ( D ) ) .Therefore, if Gi, $Gd2, there exists an arc from any vertex of G;, to any vertex of G i , . Denote the set of the vertex sets F; (i E I ) of the strongly connected components Gi (i E I ) by
n(D) = {Fi I 2 E
I}.
(3.45)
I T ( D ) is a partition of E . In the following we regard < D as a partial order on I T ( D ) by identifying Gi with Fd for each i E I . Now, we have obtained a poset P(D)= ( I I ( D ) , d o ) which , is called the poset derived from distributive lattice D. An example of a distributive lattice D and the poset P(D) derived from it is shown in Fig. 3.5. 45
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
0
Figure 3.5. For a (general) poset P = (P,d), a set J e, el E P we have
C P is called
a (lower) ideal of
P if for each
e<e'EJ=+eEJ.
(3.46)
c
Theorem 3.9 [Birkhoff37]:Let D zE be a distributive lattice with 0, E E D. Then, for the poset P(D)= (II(D),dD) derived from D the following (i) and (ii) hold. (i) For each ideal J of P (D),
U{F I F E J} E (ii) For each X E
D, there exists an ideal J X=U{F
u{
D. of P(D) such
I FE
J}.
(3.47)
that (3.48)
(Proof) (i) : Put X = F I F E J } . Since J is an ideal of P (D), it follows from the definition of P(D) that D ( e ) C X for each e E X . Then, X = U { D ( e ) I e E X } and we have X E D since D ( e ) E D from (3.42). (ii): For a given X E D, X and any F E T-I(D) do not cross, i.e., either F C X or F C E - X , due to the definition of P(D).Therefore, J = {F I F E 46
3.2.GREEDY ALGORITHM
r I ( D ) , F C X } is a partition of X . Moreover, because of the definition of P ( D ) “ F i d ~ FC z X” implies “FI c X ” . Consequently, J = { F I F E I I ( D ) , F C: X } is a desired ideal of P ( D ) . Q.E.D. From Theorem 3.9, (3.47)(or (3.48))determines a one-to-one correspondence between D and the set of all the ideals of P ( D ) . It should be noted that for any poset P = ( P , i ) on a partition P of E the set D ( P ) defined by
D(P)
= {J”
I J: an ideal of P},
(3.49) (3.50)
forms a distributive lattice with 0, E E D ( P ) . We can also see that the mapping which assigns each D to its derived posets P ( D ) is a one-to-one correspondence between the set of distributive lattices D g 2E with 0, E E D and that of posets P = ( P , d ) on partitions P of E . From Theorem 3.9 we can easily show
Corollary 3.10: Given a distributive lattice D
C 2E
with
0, E
E
D , let
be an arbitrary maximal chain of D . Then we have (3.52) In particular, the length of any maximal chain of D is independent of the choice of a maximal chain and is equal to III(D)I. We call D simple if the partition n ( D ) is composed of singletons of E alone, i.e., n ( D ) = {{e} I e E E } . For a simple distributive lattice D we regard P ( D ) as a poset on E and write P ( D ) = ( E ,$). Conversely, the set of all the (lower) ideals of a poset P = ( E , d ) on E forms a simple distributive lattice D 2E and we denote such a simple D by Z P . A submodular system ( D , f) with simple D is called simple. For a non-simple submodular system ( D , f) on E , define
c
k = {F I F E rI(D), F c X } B = {k I X E D } , f(k)= f ( X )
(X E D).
Then we have a simple submodular system simplification of ( D , f ) . 47
(X
E
P),
(3.53) (3.54) (3.55)
(B, i) on II( D ) , which we call the
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
(b) Greedy algorithm For a submodular system ( 0 ,f) on E we consider a linear optimization problem described as follows.
P,: Minimize
w(e)z(e)
(3.56a)
eE E
subject to x E B ( f ) ,
(3.56b)
where w : E + R is a given weight function. An optimal solution of P, is called a minimum-weight base of ( D , f) with respect to the weight function w . Similarly, a maximum-weight base of ( D , f) with respect to the weight function w is an optimal solution of Problem P-, with the weight function - w . Fundamental structural properties of the base polyhedron B(f) are given by the following theorems.
Theorem 3.11: The base polyhedron B ( f ) is pointed (or has at least one extreme point) if and only if D is simple, i.e., D = 2 p for some poset P = ( E ,5). (Proof) A polyhedron is pointed if and only if its characteristic cone (or re cession cone) does not contain any line ([Stoer+Witzgall70] , [Rockafellar70]). The characteristic cone of B(f) is the solution set of the following system of inequalities and an equation: (3.57) (3.58) Therefore, B ( f ) is pointed if and only if the system of equations
z ( X )= O
(XED)
(3.59)
has the unique solution x = 0 , where note that E E D . We see from Corollary 3.10 that (3.59) is equivalent to
x(F)= 0
(F E II(D)).
(3.60)
System (3.60) has the unique solution x = 0 if and only if IF( = 1 for each Q.E.D. F E I I ( D ) , i.e., D is simple. It should be noted that the rank of the coefficient matrix of the left-hand side of (3.59) is equal to the height of D , the length of a maximal chain of D .
Theorem 3.12: The base polyhedron B(f) is bounded if and only if D is the Boolean lattice 2 E , i.e., D is simple and complemented. 48
3.2. GREEDY ALGORITHM (Proof) If of
D
= 2E, then
B(f) is included in the following bounded solution set
On the other hand, if D # 2E, there exist distinct elements e , e’ E E such that for each X E D e E X implies e‘ E X . Then for any base z E B(f) the ray or halfline
is contained in B(f). Hence, B(f) is not bounded.
Q.E.D.
When (D,f ) is not simple, Problem P, is unbounded if w ( e ) # w(e‘) for any e, e‘ E F E II(0). Therefore, if P, has an optimal solution, w : E + R is constant on each F E r I ( D ) , and hence it suffices to consider the simplification of ( D , f ) . We suppose without loss of generality that in the minimum-weight base problem P, described by (3.56) B(f) is pointed, i.e., D = 2 p with P = ( E ,5 ) .
Theorem 3.13 ([Fuji+Tomi83]): Problem P, in (3.56) has a finite optimal solution if and only if w : E --t R is a monotone nondecreasing function from P = ( E , < ) to ( R , i ) , i.e., V e , e ’ E E : e 5 e‘==+ w ( e ) 5 w ( e ‘ ) . (Proof) The “if” part: Suppose that w is a monotone nondecreasing function from P = ( E ,5 ) to (R,2 ) and that the distinct values of weights w ( e ) ( e E E ) are given by w1
< w2 <
< wp.
(3.63)
Define
A; = {e
I e E E,
w(e) 5 w;}
(i = 1 , 2 , . . . , p ) ,
( 3.64)
where note that A , = E. The sets A; (i = 1 , 2 , - . ., p ) form a chain A1 c A2 C A,, of D. From Lemma 3.1 there exists a base z E B ( f ) such that
49
c
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Then for any base y E B(f) we have from (3.63)-(3.65)
i=l e E A , - A , - 1 P
= C { w i ( y ( ~ i )- z ( ~ i )-) Wi(Y(Ai-1) - z ( ~ i - 1 ) ) ) i=l P- 1
4%)) + Wp(Y(Ap) - Z(Ap))
= C ( W i - Wi+l)(Y(Ai) i= 1 P- 1
=C(wi+l-
~ i ) ( f ( ~-iY) ( A ~ ) )
i= 1
2 0,
(3.66)
where we define A0 = 0, and recall A, = E . This shows the optimality of x. The "only if" part: Suppose that w is not a monotone nondecreasing function from P = ( E ,5 ) to (R, I),i.e., for some k (1 I k < p) A k defined by (3.64) does not belong to D. Then there exist elements e E A k and e' E E - Ak such that for any X E D with e E X we have e' E X . Hence, for any base z E B(f) we have c"(z,e,e') = +oo and x a ( X e - x e l ) E B(f) for any a > 0. Since w (e) < w (e') , Problem P, is unbounded. Q.E.D.
+
Corollary 3.14: Let P,' be the problem given by Pw where B(f) is replaced by P(f ) . Problem P,' has a finite optimal solution if and only if w: E + R is a nonpositive monotone nondecreasing function from P = ( E ,5 ) to (R, 5 ) . (Proof) The nonpositiveness is imposed on w since for any z E P(f) and e E E we have z - axe E P(f) for an arbitrary CY E R. For any nonpositive w , P,' has a finite optimal solution if and only if P, has a finite optimal solution., Therefore, the present corollary follows from Theorem 3.13. Q.E.D. Furthermore, we have the following
Theorem 3.15: Suppose that w is a monotone nondecreasing function from P = ( E ,5 ) to (R, I),i.e., the sets A; (i = 1,2, - - - , p ) defined by (3.64) form , p let fi be the rank function of the set a chain of D. For each a = 1, 2, minor (D,f ) 'AiIAi-1, where A0 = 0. Then the set of all the optimal solutions of Problem P, is given by B(f1) @ "2) = {xi @ 5 2 @
@
.
* *
@W P )
@
z p
1 xi
E B(f;)
50
(i = 1 , 2 , . . * , ~ ) } ,
(3.67)
3.2. GREEDY ALGORITHM where the direct sum @ is defined by (3.5). That is, x E B(f) is an optimal solution ofP,,, ifandonlyifxrestrictedon Ai-Ai-1 i s a baseof (D,f).Ai/A;-1 foreachi = 1, 2, p. - . a ,
(Proof) It follows from the proof of the “if” part of Theorem 3.13 that x E B(fl) @ . . - @ B(fp) is an optimal solution of Problem P,,,. On the other hand, if z is an optimal solution, then we must have dep(s, e) = 1, 2, p and e E Ai. This implies z(Ai) = f(A;) (i = 1 , 2 , . - . , p ) since A; = U{dep(z,e) I e E A;} (use Lemma 2.2). Therefore, we have z E B(fl) $ - . . @ B ( f p ) due to Lemma 3.1. Q.E.D.
A; for each i
Theorem 3.16: A base x E B(f) is an optimal solution of Problem P,,, if and only if for each e, e’ E E such that e’ E dep(x,e) we have w(e) 2 w(e‘).
(3.68)
(Proof) The “only if” part is trivial. The “if” part follows from Theorem 3.15. For, if (3.68) holds for each e, e’ E E such that e’ E dep(s,e), then we have (3.65) for Ai (i = 1 , 2 , . - . , p ) defined by (3.64). (Note that Ai = , p , and use Lemma 2.2.) Q.E.D. U{dep(x,e) e E A;} for i = 1, 2,
I
Theorem 3.16 says that the local optimality with respect to (elementary) transformations fromx to z + a ( x e - x e t ) (e E E , e’ E dep(x,e), a 2 0) implies the global optimality. The proof of Theorem 3.13 provides us with an algorithm, called a greedy algorithm, for solving Problem P,,, (see [Fuji+Tomi83]). The greedy algorithm was given by Edmonds [Edm7O]for polymatroids and by Lovbsz [Lovbsz83]for submodular systems with D = 2E. A sequence ( e l , e2,. . ,en) of all the elements of E (a linear or total ordering of E ) is called a linear eztension of P = ( E ,<) if ei 5 e j implies i 5 j (i, j = 1, 2, ..., p ) . Furthermore, a linear extension ( e l , e 2 , - . . , e , ) of P = ( E ,5 ) is called monotone nondecreasing with respect to w: E + R if w(e1) 5 w(e2) 5 . 5 w(e,). Such a monotone nondecreasing linear extension of P = ( E ,5 ) exists if and only if w is a monotone nondecreasing function from P = ( E , i ) to ( R , S ) . Suppose we are given a monotone nondecreasing weight function w from P = ( E , 5 ) to (R,I).
.
-
Greedy algorithm I Step 1: Find a monotone nondecreasing linear extension ( e l , e 2 , . * ., e n ) of P = ( E , 5 ) with respect to w. 51
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Step 2: Compute a vector
E R E by
where for each i = 1, 2, . . . , n S; is the set of the first i elements of (el, e2, . ,en) and SO = 0. Then z is a minimum-weight base of (D, f ) with respect to weight w . (End)
...
It should be noted that 0 = SO c S1 c c S, = E is a maximal chain of D containing Ai (i = 1,2, ... , p ) defined by (3.64)and that conversely such a maximal chain of D gives a monotone nondecreasing linear extension (e1,e2,--.,en) of P by { e i } = S; - Si-1 (i = 1 , 2 , . - - , n ) . Also note that due to Theorem 3.15 every extreme minimum-weight base can be obtained by the greedy algorithm by appropriately choosing a monotone nondecreasing linear extension ( e 1 , e 2 , - . . , e n ) of D in Step 1. Corollary 3.17: Problem P, has a unique optimal solution if and only if w : E + R is a one-to-one monotone increasing function from P = ( E ,5 ) to
(R,I ) . Theorem 3.18: Let f : D + R be a function on a simple distributive lattice D 2E such that 0, E E D and f(0) = 0. Define B ( f ) = {z I z E R E ,V X E
D: z ( X ) 5 f ( X ) , z ( E ) = f ( E ) } .
(3.70)
Then, the greedy algorithm described above works for B(f) defined by (3.70) if and only i f f is a submodular function on D.
(Proof) It suffices to show the “only if” part. Suppose that the greedy algorithm works for B(f). Then, for each maximal chain
C : 0 = So of
c S1 c
* * .
c S,
=E
(3.71)
D the vector z E R E defined by (3.69) belongs to B(f). For any incomparable D choose a maximal chain C of (3.71) containing X n Y and X U Y
X, Y E
and define z by (3.69). Since z E B ( f ) , by the definition of x we have
52
3.2. GREEDY ALGORITHM
It follows that f is a submodular function on D.
Q.E.D.
The greediness of the algorithm may not be seen from the above description of the algorithm. We can also get the same optimal solution x as follows. Let xo be a vector in R“ with sufficiently small (possibly negative) components x o ( e ) ( e E E ) such that f - 5 0 :D + R is monotone nondecreasing. (This is satisfied if and only if xo 5 s,where g will be defined by (3.95).)
Greedy algorithm I1
Step 1: Find a monotone nondecreasing linear extension ( e l , e 2 , . P = ( E , d ) with respect to w . Put x t 50. Step 2: For each i = 1,2, - ,n put x
t
x
+ 2(x,ei)xe,.
- ,en) of (3.74)
Then x is a minimum-weight base of (D, f ) with respect to weight w . (End) This algorithm is a coordinate-wise “steepest descent” method, which shows the greediness of the algorithm. The following theorem shows the validity of the algorithm.
Theorem 3.19: Suppose that the same linear extension is chosen in Step 1 of greedy algorithms I and 11. Then, starting from xo such that f - 5 0 : D -+ R is monotone nondecreasing, greedy algorithm I1 finds the same minimum-weight base of ( D , f ) with respect to w that is obtained by greedy algorithm I. (Proof) It suffices to show that the finally obtained x satisfies (3.69). We show this by induction. Since f - xo is monotone nondecreasing, the minimum of min{f(X) - x o ( X ) I el E X E
D}(=
(3.75)
2(xo,el))
is attained by { e l } (E D). It follows that (3.69) is satisfied for i = 1. Suppose that we have just finished the ioth cycle in Step 2 of greedy algorithm I1 for some io with 1 5 io 5 n - 1 and that (3.69) holds for i = 1 , 2 , - . ,io. Let I be the current x . Since f(Si,) = I ( S i o ) ,we have for any X E D
-
I ( X ) - I(X) = f(X) - .(X) + f(Si0)- I(Si0) 2. f ( x u si,) - i(xu si,) + f(xn sio) - I ( X n Si,) 2 f ( X u Sill) - q x u Si,). 53
(3.76)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Therefore, the minimum of min{f(X) - Z(X) I ei0+1 E X E
D}(=
2(Z,eio+1))
(3.77)
is attained by some X E D such that Si, 2 X. For X E D such that Si, C X,
f(X) - Z(X) = f(X) - ZO(X) + ZO(Sio)- f ( S i 0 ) .
(3.78)
Because of the monotonicity of f - 20, the minimum of (3.78) for X E D such that Si, G X and eio+l E X is attained by X = Si, u {eio+l} = Sio+l. Consequently, (3.69) also holds for i = io 1. Q.E.D.
+
The linear programming dual of Problem P,,, in (3.56) is given by
PW*:Maximize
c
X(X)f(X)
(3.79a)
XED
subject to Ve E E : c { X ( X ) I
VX E D
- {E}:
X E D, e E X} 2 w(e),
X(X) 5 0.
(3.79b) (3.79c)
For an optimal solution x obtained by the greedy algorithm we have
where w;, Ai (i = 1,2,. Define
- - , p ) are defined by
(3.63) and (3.64) and A0 =
(i = 1 , 2 , - * * , p -l),
X(Ai) = wi - wi+l
X(E) = wP
8.
(3.81) (3.82)
and X(X) = 0 for other X E D. Then X is a dual feasible solution and it follows from (3.80) that the values of the objective functions of the dual problems coincide with each other. Hence X given above is an optimal solution of the dual problem Pu,*. From (3.81) and (3.82), for any integral w such that the primal problem P, has an optimal solution there exists an integral optimal solution of the dual problem P,*. That is, we have proved the following. 54
3.3. STRUCTURES OF BASE POLYHEDRA
Theorem 3.20: The system of inequalities and an equation given by
is totally dual integral for any submodular system ( D , f ) on E Since the system of (3.83) and (3.84) is totally dual integral, if the rank function f is integer-valued, each face of B(f) contains at least one integral vector and in particular, each vertex is integral ([Hoffman74],[Edm+Giles77]), which can also be seen from the greedy algorithm (cf. Theorem 3.22 below).
Corollary 3.21: The system of inequalities
is totally dual integral for any submodular system (D, f ) . (Proof) The proof is similar to that of Theorem 3.20. Use Corollary 3.14. Q.E.D.
3.3. Structures of Base Polyhedra Suppose that
(D,f ) is a simple submodular system on E .
(a) Extreme points and rays From the greedy algorithm and Corollary 3.17 we have
Theorem 3.22 (The extreme point theorem) [Fuji+Tomi83]: A base z E B(f) is an extreme point of the base polyhedron B(f) if and only if for a maximal chain c: 0 = s, c s1 c * * . c s, = E (3.86) of D we have
z ( e i ) = f(Si) - f ( S i - 1 )
(i = 1 , 2 , . . - , n ) ,
(3.87)
where { e i } = S, Theorem 3.22, when D = 2 E , has been shown in [Edm7O],[Shapley71] and [LovBsz83]. Define a vector iZ E R E by
D(e) = n { x I e E 55
x E P},
(3.88)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
for any e E E and X E D such that e E X and X - {e} E D. Hence, from Theorem 3.22, for any e E E E(e) is the maximum value of the eth component of bases of (D,f ) , i.e., E is the least upper bound (or the join) of all the extreme points of B(f) in the vector lattice RE.In particular, for each X E D,
f ( X ) I V),
(3.91)
since there is an extreme base z E B ( f ) such that z(X) = f ( X ) . Because of (3.91), i5 can be used for estimating an upper bound of f, i.e., max{f(x)
I X E D} I:max{i5(X) I X E D} 5 I e E E , z ( e ) > 0).
z{~(e)
(3.92)
Also note that, given any base z E B(f), a lower bound of f is computed as
I x E D} 2 min{z(x) I x E P I 2 C { z ( e ) I e E E ,
s(e) < 0 ) . (3.93) Moreover, denote by cy the greatest lower bound (or the meet) of all the extreme points of B(f) in the vector lattice R E .g is given similarly as (3.88) and (3.89) in a dual form: min{f(x)
Lemma 3.23: The rank function f of a simple submodular system (0, f) is monotone nondecreasing if and only if q 2 0. In other words, f is monotone nondecreasing if and only if every extreme point of the base polyhedron B(f ) belongs to the nonnegative orthant RT. (Proof) If f is monotone nondecreasing, then we have g 2 0 by definition (3.95). Conversely, if g 2 0, we have for any e E E and X E D with e f X and X u {e} E D,
f ( X u {e})
-
f ( X ) 2 f(D*(e)u {e})
- f(D*(e))= cy(e)
2 0,
(3.96)
from which follows the monotonicity o f f . We see from (3.96) that the minimum value of the eth component of bases of (D, f ) . i s equal to cy(e). Q.E.D. 56
3.3. STRUCTURES OF BASE POLYHEDRA
Lemma 3.24: The rank function f of a simple submodular system ( D , f ) is a modular function if and only if for an extreme base x of (D, f ) we have x = E(= cy).
(Proof) Since ( D , f ) is simple, the rank function f is modular if and only if
B(f) has one and only one extreme base. The present lemma follows from this Q.E.D.
fact and the definitions of E and Q.
It follows from Theorem 3.22 (also from Theorem 3.20) that if the rank function f of (D,f ) is integer-valued, every extreme point of B(f) is integral. In particular, we have the following polyhedral characterization of matroids due to Edmonds (Edm7Ol. Corollary 3.25 [Edm’lO]: For a rnatroidal submodular system (2E,p), where p is the rank function of a matroid M on E , the base polyhedron B(f) is the convex hull of the characteristic vectors of all the bases of the matroid M. From Theorem 2.5 we can easily see that if f is a nonnegative integervalued crossing-submodular function on a crossing family 3 and if the polyhedron given by B ( f t ) = { z I x E B(f), Ve E E:O I x(e) 5 1)
(3.97)
is nonempty, then B ( f i ) is the integral base polyhedron obtained by the reduction of B(f) by vector 1 = ( l ( e ) = 1 I e E E ) and the contraction by zero vector 0 and is a base polyhedron of a matroid. Hence, from Corollary 3.25 we see that
is a family of bases of a matroid. This is a result by A. Frank and 8. Tardos [Frank+TardosSl]. If the rank function f of a simple submodular system (D,f)is integervalued and has the unit-increase property (i,e., for any X , Y € D with X & Y and + 1 = IYJ we have f(Y)= f ( X ) or f ( Y ) = f(X) I), then all the extreme points of B(f) are {O,l}-vectors. Therefore, we can develop a matroid-like theory for such a submodular system (D,f ) , which corresponds to Faigle’s geometry on the poset P = ( E , < ) with D = 2’ [Faigle79,80]. In fact, Theorem 3.22 gives a polyhedral characterization of the family of bases of Faigle’s geometry. Next, denote the characteristic cone of the base polyhedron B(f) by C ( f ) , which is given by
+
1x1
C(f) = {z
I 2 E R E ,VX E D: z ( X ) 5 0, 57
x(E) = O}.
( 3.99)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Let G = ( E , A )be the graph with vertex set E and arc set A which represents the Hasse diagram of the poset P = ( E , < ) , i.e., ( e y e ' ) E A if and only if e covers e' (or e' 4 e and there is no element e'' E E such that e' 4 e'' < e ) . Also define a capacity function c on A by ~ ( a= ) +co
(a E
(3.100)
A).
Then we easily see that C ( f ) in (3.99) coincides with the set of the boundaries M = (G = ( E , A ) , c ) . (Note that the cut function IC, associated with network M = (G = ( E , A ) , c )satisfies (i) tcC(X)= 0 if X is an ideal of P and (ii) I C ~ ( X = )+oo otherwise. Hence, C(f) in (3.99) is the set of the boundaries ap of feasible flows (i.e., nonnegative flows) p in N.) Consequently, we have
dp of nonnegative flows p in the network
T h e o r e m 3.26 (The extreme ray theorem) [Tomi83]: The extreme rays of the characteristic cone C(f) of the base polyhedron B(f) are exactly those represented by the vectors
(3.101)
X e - Xe'
for all e, e' E E such that e covers e' in P = ( E , < ) .
(Proof) Since the characteristic cone C(f) is the set of the boundaries of nonnegative flows in N = ( G = ( E , A ) , c ) defined above, C(f) is generated by vectors xe - Xer such that (eye') E A . Moreover, vector xe - Xer for an arc (eye') E A can not be expressed as a nonnegative linear combination of the other vectors xel - x,; with ( e l , e:) E A - { (e, el)}. Q.E.D. Theorem 3.13 characterizes the dual cone C*(f) of C(f), where C * ( f ) = {Y
I Y E R E , Vx E C(f):
x(e)y(e)
5 0).
(3.102)
eEE
Theorem 3.13 says that -C* ( f ) consists of monotone nondecreasing functions from P = ( E ,4)to (R, 5 ) or that C*(f) consists of monotone nonincreasing functions from P = ( E , < ) to (R,<). Therefore, C*(f) is generated by the characteristic vectors of the (lower) ideals of P.
(b) Elementary transformations of bases For any base z of submodular system e' E dep(z,e) - {e} we have z+a(~c-Xer)
(P,f ) on E
EB(f) 58
and for e, e' E E such that
(05aLc"(z,e,e')).
(3.103)
3.3. STRUCTURES OF BASE POLYHEDRA
+
The transformation of base x E B(f) into such a base x a ( x e- x , ~ E ) B(f) is called an elementary transformation of base x E B(f). The following theorem is important from an algorithmic point of view. For any real number a, La] denotes the maximum integer less than or equal to a.
Theorem 3.27: For any two bases x, y E B(f) base x can be transformed into base y by at most 11El2/4J repeated elementary transformations such that each component z(e) with x(e) < y(e) monotonically increases and each component x(e) with x(e) > y(e) monotonically decreases. (Proof) Consider the following algorithm. 1' If x = y, then stop.
2' Choose any element e E E such that x(e)
< y(e).
3' Choose any element e' E dep(x,e) such that %(el) > y(e'). Put a min{y(e) - x(e), x(e') - y(e'), E(x,e,e')} and x t x Q(x, - x,r) .
+
t
a! < y(e) - x(e), then go to Step 3'. Otherwise (a= y(e) - x(e)) go to Step 1'.
4' If
Note that if x # y, there is an element e such that x(e) < y(e) and that if x(e) < y(e), there is an element e' E dep(x,e) such that x(e') > y(e'), since otherwise, putting X = dep(x,e), we would have f(X) = x(X) < y(X), a contradiction. Also note that if a < y(e) - x(e) in Step 4 O , we have a = min{x(e') - y(e'), E(x,e,e')} and the number of elements in {e'' I e" E dep(x,e), x(e") > y(e")} decreases by at least one after the elementary transformation x t x a(xe- x , ~ ) Therefore, . the case where a < y(e) - x(e) is repeated at most IS-1 times, where S- = { e I e E E , x(e) > y(e)} for the initial base x. Defining S+ = {e 1 e E E , x(e) < y(e)} for the initial x, the total number of the elementary transformations is at most IS+ I x IS- 1, which is bounded by [IEl2/4J. Q.E.D.
+
Consider a capacitated network N = (G = (V,A),c,Z)with an underlying graph G and lower and upper capacity functions c, C: A + R with -c 5 t. Let 'c.,~: 2v + R be the cut function associated with the network N = (G = ( V , A ) , c , Z )(see (2.62) in Section 2.3). The set of the boundaries of feasible flows in 4 is the base polyhedron associated with the submodular system (2V,nc,c). Note that there exists a feasible circulation (a feasible flow 'p such that 8'p = 0 ) in N if and only if 0 E B('cc,z). Since dc E B('cC,?), there exists a feasible circulation in N if and only-if the base dc E B(t&) is transformed into 0 by repeated elementary transformations as in Theorem 3.27. A standard algorithm for finding a feasible circulation by the use of a max-flow algorithm consists of such repeated elementary transformations (cf. [HoffmanGO], [Ford+Fulkerson62]). 59
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA For a (directed) graph G = (V,A) and a {O,l}-valued function p: A + {0,1} define the graph G, as the one obtained from G by reorienting arcs a E A such that p(a) = 1. We say 'p defines the reorientation G,. A graph G = (V,A ) is strongly k-connected (k: a positive integer) if for each nonempty proper subset U of vertex set V there exist at least k arcs from U to V - U. We call p: A + {0,1} a strongly k-connected reorientation of G if G, is strongly k-connected. Define a capacity function c : A + R by C(U)
( a E A),
=1
(3.104)
and let K : 2E + R be the associated cut function, i.e., K ( U ) = c ( A + U ) = IA+UI for U C V . Also define
Then ~ ( ' 1 : 2v + R is a crossing-submodular function on 2v and defines a base polyhedron B(rc(')), if B(K(')) # 0 , due to Theorem 2.5. B(K(')) is called the k-abridgment of B(K) in [Tomi8lb, 81~1.It can easily be seen that B(K(')) = {dp I p defines a strongly k-connected reorientation of G}. (3.106) Here, we assume that the underlying totally ordered additive group R is the set Z of integers. Also note that the strong k-connectedness of a reorientation of G depends only on the boundary d p of p which defines-the reorientation. Because of this fact and Theorem 3.27 we obtain a theorem of F'rank [F'rank82a]: 'Let GI and G" be strongly k-connected reorientations of G. Then there exists a sequence of strongly k-connected reorientations GI = Go, GI, * * -, G, = G" of G such that for each i = 1 , 2 , - - - , mGi is obtained by reorienting arcs in a directed path or a directed cycle in Gi-1." Note that an elementary transformation of a base (or a boundary dp) in
B(K(')) corresponds to a transformation of the reorientation of G (defined by by reversing the arcs in a directed path and possibly directed cycles and that reversing arcs in a directed cycle does not change the boundary d'p.
'p)
(c) Tangent cones
For any base z E B(f) associated with submodular system (0,f) on E the tangent cone of B(f) at z,denoted by TC(B(f),z), is defined by
60
3.3. STRUCTURES OF BASE POLYHEDRA
Here, the underlying totally ordered additive group R is assumed to be the set of reals (or rationals). Given a base z E B(f), we call an ordered pair (e, e l ) of elements of E an ezchungeubie pair associated with z if e' E dep(z,e) - {e}.
Theorem 3.28: The tangent coneTC(B(f),z)ofB(f) at a basexisgenerated by the set of the following vectors:
In other words, for any vector y E TC(B(f),z) there exist some nonnegative coefficients A(e, e l ) for exchangeable pairs ( e , e l ) such that Y=
C{A(e,e')(xe - x e , ) I ( e ,
el):
an exchangeable pair associated with z}. (3.109)
(Proof) Let C be the cone generated by the vectors in (3.108). It follows from the definition of dependence function that
Suppose that there exists avector y E TC(B(f),z)-C. Then, by the separation theorem (Theorem 1.13) there exists a vector w E RE such that (3.111)
C w(e)y(e)
< 0.
(3.112)
eEE
From Theorem 3.16 and (3.111) the base z is a minimum-weight base with respect to the weight function w but (3.112) implies that for a sufficiently small a > 0 2 cwy is a base and the weight of the base z ay is smaller than that of z. This is a contradiction, so that we must have C = TC(B(f),z). Q.E.D.
+
+
A constructive proof of this theorem for polymatroids was given in [Fuji 78a, Lemma 91. It should also be noted that Theorems 3.26 and 3.28 are closely related. We can show Theorem 3.28 by using Theorem 3.26 and vice versa. Suppose that (D, f ) is a simple submodular system on E and that z is an extreme point of B(f). Then,
D(z) = { X I X E
D, z ( X )= f ( X ) }
61
(3.113)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA is also a simple distributive lattice since the length of a maximal chain of D(z) is equal to [El due to Theorem 3.22. This fact is crucial in the following argument. Let P ( z ) = ( E , - Q be the poset representing D(z). An efficient method for finding dep(z,e) for all e E E is shown in [Bixby+Cunningham+Topkis85] (for polymatroids). Their algorithm also discerns whether a given vector is an extreme base. The algorithm adapted for submodular systems is given as follows. Let z be any vector in R E .
Algorithm Step 1: Put S t 0. Step 2: F o r e a c h i = 1 , 2 , . - . , I E I dothefollowing(2-1) and(2-2). (2-1) If there exists no element e E E - S such that S U {e} E D and z( S U { e}) = f (S U { e}) , then stop (zis not an extreme base). Otherwise find one such element e E E - S and put S t S u {e} and ei t e.
(2-2) Put T t S. For each j = 1,2,
- - - ,i - 1 do the following (*) .
(*) If z(T - { e i - j } ) = f ( T - { e i - j } ) , Put dep(z,ei) t T .
then put T
t
T
- {ei-j}.
(End) If z is an extreme base, then D(z) = 2p(5)with P(z) = ( E ,-&). Repeating C S, (n = IEI) of D(z), Step (2-1), we have a makimal chain SO c S, c where Si = {el,e2,.-.,e;}. Note that a maximal chain of D(z) is obtained by augmenting elements of an ideal S of P(z)one by one in Step (2-1). Conversely, if we find a chain 0 = So c S1 c c S, = E such that z(S;) = f(Si) (i = 1,2, ,n),then z is an extreme base due to Theorem 3.22. This validates Step (2-1). We now show the validity of Step (2-2). Because of the above argument we can assume that the given z is an extreme base. For the current i at the beginning of an execution of Step (2-2) we have a chain So C SI C ... C Si. Note that (3.114) deP(z,ei) si,
-
c
dep(z,e;)USi-j ED(^)
(j=O,l,.+.,i).
(3.115)
Since distinct members of (3.115) forms a maximal chain from dep(z,ei) to Si, the final T obtained in the current Step (2-2) is dep(z,ei). The Hasse diagram G ( s ) = ( E , A ( z ) )of P ( z ) = (E,<=) can be constructed by the use of dep(z,ei) (i = 1 , 2 , . . . , n ) . We can also modify the above algorithm so as to construct the Hasse diagram of P ( z ) = (E,5z)while 62
3.3. STRUCTURES OF BASE POLYHEDRA executing the algorithm. In Step 1 we put G(z) = (E,0). Modify Step (2-2) as follows. (2-2') Put T t S and W t 0. F o r e a c h j = 1 , 2 , . - . , i - l do thefollowing (*1)and(*2). (*1)If ei-j $ Wl and z(T - {ei-j}) = f(T- {ei-j}), then put T t T - {ei-j}. (*2) If ei-j W and x(T - {ei-j}) < f(T- { e i - j } ) , then add to G(z) an arc from ei to e i - j and put W t W u dep(z, ei-j). Put dep(s, ei) t T.
4
It should be noted that ei is adjacent to ei-j in the Hasse diagram if and only if e i - j E dep(s,ei) and ei-j is a maximal element of dep(z,ei) - { e i } in P ( x ) . Set W in Step (2-2') is introduced due to the fact that ei-j E dep(z,ei) implies dep(z,ei-j) 5 dep(s,ei). Set W can also be incorporated into Step (2-2), which may reduce the number of evaluations of f .
(d) Faces, dimensions and connected components [Fuji84d] Consider a simple submodular system set of reals (or rationals). For any 3 G D define
(D,f) on E.
In the following, R is the
F(?) = {z I x E R E ,VX E
3: x ( X ) = f ( X ) , vx E D - 3: .(X) 5 f ( X ) } ,
(3.116)
F"(?) = {x I x 6 R E ,V X E
7:x ( X ) = f ( X ) , vx E D - 3: .(X) < f(X)}.
(3.117)
Also, define
D = {Do
I Do
is a sublattice of D with O,E E Do, F"(Do) # 8).
(3.118)
Lemma 3.29: The collection D of sublattices of D defined by (3.118) is given bY D= I 5 E B(f)}, (3.119) where for each
2: E
B(f) D(z) is defined by (3.113).
(Proof) If DO E D, then for any z E F"(Do) we must have Do = D ( x ) by definition (3.117). Conversely, for any z E B(f) D ( x ) is a sublattice of D with O,E E P(z) and 2 E F"(D(2:)). Hence we have D ( 2 : ) E D. Q.E.D. 63
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA It should be noted that for each DO E D F(D0) is a face of B(f) and F"(D0) is the relative interior of the face F(D0). We see from Lemma 3.29 that D is the collection of equality sets, each given by D (z),for B( f ) expressed by
z ( E )= f ( E ) .
(3.121)
.
From Lemma 1.8 we can easily show
Theorem 3.30: The collection F of all the nonempty faces of B(f) is given by {F(Do) I Do E D}. Also, (i) If PI,& E D and DI # Dz,then F(D1) # F(D2). (ii) For any DI,D2 E D, D 1 DZ if and only if F(D2) C F(D1). In other words, F in (3.116) determines an anti-isomorphism from D onto F, where D and F are considered as posets relative to set inclusion.
c
F (or Fu{0} when F does not have a unique minimal element) is the face lattice of B(f). For two posets Pi = (Ei,Si) (i = 1,2) we say PZ is a homomorphic image of PI if there exists a mapping $ from El onto EZ such that e 51 e' implies $(e) d2 $ ( e l ) for all e, e' E E l . Also, a partition Pz = { y j I j E J} of E is a refinement of a partition PI = {X;I i E I} of E if for each y j E PZ there exists an Xi E PI such that Yj X;. Lemma 3.31: For any distributive lattices Di (i = 1,2) with 0, E E D;,we have D1 C Dz if and only ifII(D2) is a refinement of I I ( D 1 ) and P(&) = (.TI(&), is a homomorphic image of P(&) = (II(Dz),5 D 2 ) under the natural mapping (i.e., Tz E ll(Dz) is made correspond to TI if TZ C T I ) . (Proof) For each i = 1,2, distinct elements e and e' of E belong to different components of II(Di) if and only if there exists an X E Di such that I{e,e'} n XI = 1. Therefore, since D1 02, n(&)is a refinement of I l ( D 1 ) . Also, since we have Tz-(D,T{if and only if Ti X E D2 implies TZ X and since D1 C D2, Ti X E D1 implies TZ C X if T z d ~ , T i .Consequently, for T I , Ti E I I ( D 1 ) Q.E.D. such that Tz TI and Ti E T i , we have T ~ ~ D ~ T : .
c
c
c
c
c
Theorem 3.32: For
DO E D
we have
where dimF ( DO) is the dimension of the face F ( DO).
64
3.3. STRUCTURES OF BASE POLYHEDRA
(Proof) The dimension of the face F(D0) is equal to that of the affine set
M(D0) = {Z I z E RE,V X E
Do: .(X)
= f(X)}.
(3.123)
Since the rank of the coefficient matrix in the right-hand side of (3.123) is equal Q.E.D. to IIl(Do)l, we have (3.122). It may be noted that the extreme point theorem (Theorem 3.22) and the extreme ray theorem (Theorem 3.26) easily follow from Theorems 3.30 and 3.32 and Lemma 3.31.
Lemma 3.33: Suppose Do E D and let
CO: 8 = SO C S1 C
C sk =E
(3.124)
be a maximal chain of DO. Then,
(3.125)
F(C0) = F(D0).
(Proof) Since lI(C0) = Il(Do), we have z E F(C0) if and only if z E F(D0). Q.E.D.
Theorem 3.34: Suppose DO E D. Then a base z E B(f) is an extreme point of the face F(D0) if and only if, for a maximal chain
C: 0 = So C S1 C of
c S,
=E
(3.126)
D which contains a maximal chain of Do as a subchain, x is given by z(Si-si-1) = f ( S J --f(S+l)
( i = 1,2,-,n).
(3.127)
(Proof) The “if” part: Let CO be a maximal chain of DO contained in chain C of (3.126). Then, from (3.127) z E F(C0). Hence, from Lemma 3.33, x E F(D0). Since x is an extreme point of B(f) due to Theorem 3.22, z must be an extreme point of F(DO). The “only if” part: For any extreme point z of F(D0) we have DO C D(z) E D. Since z is also an extreme point of B ( f ) , i.e., {z} is a zero-dimentional face F(D(z)) of B ( f ) , a maximal chain of D(z) is a maximal chain of D due to Theorem 3.32. It follows that a maximal chain of D(z) which contains a maximal chain of Do as a subchain is a desired maximal chain of D. Q.E.D. Also, extreme rays of a face of B(f) are characterized by the following. 65
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Theorem 3.35: Suppose DO E D and I I ( D 0 ) = (Ti I i E I } . Then the set of all the extreme rays of the characteristic cone of the face F ( D o ) is given by
(xe -
xel
I e = dsa,
e’ = d-a, a E A*(D),3i E I : {e,e‘}
Ti},
(3.128)
where A*(D)is the arc set of the Hasse diagram H(P(D)) = ( E , A * ( D ) )repre senting the poset P ( D ) = ( E , ~ D ) . (Proof) The characteristic cone C(D0) of the face F ( D 0 ) is given by C(D0) = (Z
I x E RE,VX E Do:
z ( X ) = 0, VX E D - Do: z ( X ) 5 0).
(3.129)
It follows from (3.129) and the extreme ray theorem (Theorem 3.26) that the set of the extreme rays of C ( f ) ( = C ( D ) )which belong to C(D0) is exactly given by (3.128). Q.E.D. We say that a submodular system ( D , f ) on E is connected if there is no nonempty proper subset X of E such that X , E - X E D and f ( X ) + f ( E - X ) =
f (El. Theorem 3.36: A submodular system ( D , f ) on E is connected if and only if (0, E } E D, i.e., there exists a base x E B(f) such that
4x1 < f ( X ) for any X E
(3.130)
D with 0 # X # E .
(Proof) The “if” part: If there exists a base x E B(f) satisfying (3.130) for each X E D with 0 # X # E , then
for each X E D with E - X E D and 0 # X # E . The “only if” part: Suppose that (P,f) is connected. We have B(f) = F ( D 0 ) for some DO E D. We show PO = (0,E } . Note that we have ( 0 , E ) E Do. Suppose that there exists some Y E DO such that 0 # Y # E . Then, for any base x we must have Ve E E - Y : dep(x,e) 5 E - Y
(3.132)
since otherwise there would exist a base x’ such that x‘(Y) < f ( Y ) ,which would contradict the fact that Y E Po. It follows from (3.132) that
E -Y E 0,
z(E - Y ) 66
=f
( E- Y ) .
(3.133)
3.3. STRUCTURES OF BASE POLYHEDRA
Since z ( Y ) = f ( Y ) ,we have from (3.133)
+
+
f ( Y ) f ( E - Y ) = z ( Y ) z ( E - Y )= z ( E ) = f(E).
(3.134)
This implies that (D,f) is not connected, which contradicts the assumption. Q.E.D. Therefore, we must have (8,E } = DO. The proof of the "only if" part shows the following.
Lemma 3.37: Suppose that B(f) = F(Do) for some Boolean sublattice of D.
DO
E D. Then
DO is a
Theorem 3.38: For a submodular system (D,f ) on E there uniquely exists a partition P* = {TI,7'2, - - .,Tk} (k 2 1) of E such that (i) Ti E D ( i = 1,2,...,k), ( D , f ) .Ti (i = 1 , 2 , . . . , k ) is connected, and (ii) each reduction ( D T i 7 f T i ) (iii) f(x)= f T l ( ~ l n ~ ) + . . . + f T k ( ~ k n ~ ) ( X E D). (3.135) (Proof) Suppose that Do E D satisfies F(D0) = B(f). From Lemma 3.37, DO is a Boolean lattice. Let Tl,. . . ,Tk be all the minimal nonempty elements (as subsets of E) of Do, i.e., II(D0) = {Tl,--.,Tk}. Then,
T;E D
(i=1,2,--*,k).
(3.136)
Since
we have
For any X E
I ( E ) = f(T1) + . - . +f(T&).
D
we have from (3.138)
It follows from (3.139) that
(3.138)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Also,foreachT; ( i ~ { 1 , 2 , . - - , k } ) a n d X C T ; s u c h t h a t X EDandT;-XE D, we have from (3.140) with X replaced by E - X
where (3.141) holds with equality if and only if
If (3.141) holds with equality or (3.142) holds, X must be a member of DO and hence either X = 0 or X = T; by the definition of Ti. Therefore, (D, f ) T; is connected. It follows that the partition {Ti I i = 1 , 2 , . . . , k } derived from Do satisfies (i)-(iii) of the present theorem. Moreover, if a partition {Wj I j E J} satisfies (i)-(iii) with Ti's replaced by Wj's,then from (iii) we have Wj E DO for each j E J. If {Wj I j E J } # {T;I i E I},there exists Wj such that Wj = T;, Us. .UTiPfor some il, ,.ip E I with p 2 2. Then, we have
-
---
(3.143)
-
from which follows that (D, f ) Wj is not connected. Consequently, we have {Wj I j E J } = {Ti I i E I},which shows the uniqueness of the partition. Q.E.D.
Theorem 3.39: I'I(Do) is the partition of E given by the decomposition of (D,f ) into connected components. In particular, the number of connected components is equal to IrI(D0)l. (Proof) The present theorem follows from the proof of Theorem 3.38. Q.E.D. From Theorems 3.32 and 3.39 we have
Corollary 3.40: Let n* be the number of the connected components of (D,f ) . Then, (3.144) dimB(f) = IEl - n*.
+
The dimension of B(f) was also given in [Shapley71], [Giles75], [Bkby Cunningham + Topkis851 and [Tomi831 (when D = 2E). The following lemma is useful for finding the partition rI(P0) (see [Bixby + Cunningham Topkis851).
+
68
3.3. STRUCTURES OF BASE POLYHEDRA
Lemma 3.41: For any base x E B(f) let G(z) = ( E , A ( x ) )be the graph with vertexset E and arc set A ( z ) = {(e,e') I e' E dep(z,e)}. Then, II(D0) is the set of the vertex sets of the connected components of G(z). (Proof) Let {Wj I j E J} be the set of the vertex sets of the connected components of G ( x ) . Since DO 2 D(z) = { X I X E D , x ( X ) = f ( X ) } ,partition {Wj I j E J } is a refinement of I I ( D 0 ) . However, for any j E J we have W j , E - Wj E D(z) by the definition of G(z) and Wj, and
f(E)= x ( E ) = .(Wj)
+ x(E - Wj) = f (Wj) + f(E- Wj).
(3.145)
I
Hence, W j E Do for any j E J. Therefore, II( DO)is a refinement of {Wj j E J}. Q.E.D. I I ( D 0 ) = {Wj I j E J}.
It follows that
Since, in particular, Lemma 3.41 holds for an extreme base x E B(f), the connected components of ( D , f ) can efficiently be found by the use of the algorithm shown in Section 3.3.c [Bixby Cunningham Topkis851.
+
+
Theorem 3.42: For any D1, DZ E D we have D1 n D2 E D and F ( D 1 n D2) is the unique minimal face which contains both F ( D 1 ) and F ( D 2 ) . Moreover, if F ( D 1 U 4) f 0, then F ( D 1 U D2) is the unique maximal face which is contained in both F ( D 1 ) and F ( D z ) . D3 E D satisfying F ( D 3 ) = F ( D 1 U Dz) is the unique minimal sublattice of D in D which contains both D1 and Dz. (Proof) The present theorem follows from the general theory of convex polyhedra (see Lemma 1.8). Q.E.D. It should be noted here that the unique minimal sublattice of D which contains both D1 and D2 does not necessarily belong to D. The following theorem gives a necessary and sufficient condition for a sublattice DO of D to be a member of D.
Theorem 3.43: Let DO be a sublattice of D with O,E E DO and fo be the restriction off to Do. Then Do E D if and only if the following three statements hold: (i) fo is a modular function. (ii) For any maximal chain co:
0 = so c s1 c * * - c S& = E
(3.146)
.
of Do each minor (P,f ) . Si/Si-, (i = 1,2, ,k) is connected. (iii) Let Co be any maximal chain of DO as in (3.146) and P be any base of (PO,fo) such that
qsi) = f O ( S i ) 69
(i= 1,2,*.*,k)
(3.147)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA (i.e., CO C DO(?)). Then for any X E D such that (a) X is compatible with and (b) 2 ( X ) = f ( X ) , we have X E DO.
Il(D0)
(Proof) The “if” part: Suppose (i)-(iii) hold. For each i = 1 , 2 , . - . ,k let xT be (P, f).Si/Si-, such that for any X E D with Si-1 C X C Si a base of (Di,fi) we have xT(X - si-1) < f(X) - f(Si-1) = f i ( X - si-1). (3.148)
=
Such a base xr exists due to Theorem 3.36. Let x* xT (i = 1,2,. ,k),i.e., x*(e) = x;(e)
-.
R E be the direct sum of (3.149)
foreache€ E w i t h e E Si-Si-1 a n d i E { 1 , 2 , . . - , k } . Thenwehavex* E B(f) due to Lemma 3.1. We show x* E F”(Do),which will complete the proof of the “if” part. Let X be any member of Do. Since f is modular on Do and x* satisfies
.*pi)= f(Si)
( i = 1,2,-,k)
DO given by
(3.146), we have
on the maximal chain of
.*(X)= f(X)
(XE Do),
(3.150)
(3.151)
where recall that a simple submodular system with a modular rank function has a unique base. Now, suppose X E D - DO.If X is compatible with I I ( D o ) , then from (iii) we have .*(XI < f(X). (3.152) On the other hand, if X is not compatible with II(Do), i.e., for some io E {1,2,...,k} X - S, # 0 and Sio+l - X # 0, then defining Ti = Si - Si-1 ( i = 1 , 2 , . . - , k ) , we have
(3.153) 70
3.3. STRUCTURES OF BASE POLYHEDRA
due to (3.148) and (3.149). Therefore,
vx E D - Do: .*(X)< f(X).
(3.154)
From (3.151) and (3.154) we have x* E F O ( D 0 ) . The "only if" part: Suppose Do E D. Then there exists a vector x' E F o ( D o ) , from which follows (i). Also (ii) follows from Theorem 3.36. We show (iii). Let i be any base of (Do, fo) such that (3.147) holds. Suppose that Xo E D is compatible with I I ( D 0 ) and that
Since x' E F"(D0) also satisfies
.'pi) = f&)
(i=l,2,*..,k),
(3.156)
we have from (3.147) and (3.156)
?(T)= ~ ' ( 2 ' ) (7' E II(D0)).
(3.357)
Since Xo is compatible with II(Do), it follows from (3.155) and (3.157) that Z'(X0)
=
qxo) = f(X0).
Since x' E F" (DO),we must have X O E
(3.158)
DO.
Q.E.D.
From Theorems 3.32 and 3.43 we have the following.
Corollary 3.44: Suppose that B(f) is full-dimensional, i.e., dimB(f) = [El-1, and let Do be a sublattice of D with 0 , E E DO. Then, F(D0) is a facet of B(f) if and only if Do forms a chain 0 = SO C S1 C Sz' = E of D (oflength 2) and ( D , f ) Si/S,-l (i = 1,2) are connected. We also have
Theorem 3.45: Let
D1
be a sublattice of D with 0, E E
D1.
Suppose that f is
modular on D1. Also, let C1:
~ = S ~ C S ~ C * . * C S ~ = E
(3.159)
be any maximal chain of D1 and for each i = 1 , 2 , . . . , k let Pi = { T ) , T f , . * . , T:i} be the partition ofS; -S,-1 given by the decomposition of ( D , f).Si/Si-1 into connected components. Define P* = Pi and let 2 be a base of (D, f )
&
such that +a)
= f(Si)
(i = 1,2, * * * , k). 71
(3.160)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Then Dz given by
Dz
= {X
I X E D, ?(X)= f(X), X is compatible with P*}
(3.161)
(3.162) (Proof) We can easily see that D2 given by (3.161) satisfies (i)-(iii) of Theorem 3.43, where note that the set of minors ( D , f ) . S i / S i - , (i = 1 , 2 , - - . , k ) does not depend on the choice of a maximal chain since f is modular on D1 (see Theorem 7.17). Hence we have D2 E D due to Theorem 3.43. Moreover, for any x ' E F ( D 1 ) we have
qT;)= X'(Tj) It follows that for any
( j =-1,2,
* *
,ri;
i = 1,2,
- ,k).
(3.163)
X E DZ x'(X)= &(X)= f(X),
(3.164)
' E F ( D 2 ) . We thus have F ( D 1 ) 2 F ( D 2 ) . On the other hand, since f is i.e., x modular on D1, from (3.160) and (3.161) we have D1 G 0 2 and F ( D 2 ) C F ( D 1 ) . Q.E.D. Hence F ( Dz) = F ( D 1 ) . Note that the operation of getting Dz from D1 in Theorem 3.45 is a closure operation on sublattices of D , containing 0 and E , on which f is modular and that D is the collection of closed sublattices of D . Theorem 3.45 is closely related to the concept of f -skeleton introduced in [Nakamura Irisl]. An f-skeleton is a sublattice of D on which f is modular. A sublattice D1 of D in Theorem 3.45 is an f-skeleton and there exists a unique maximal f-skeleton D; (maximal with respect to set inclusion) such that II(D;) = I I ( D l ) , which is called the mazirnal f-skeleton corresponding to D1 ([Nakamura Irigl]). We can easily see that D; may not be closed and that D; C Dz, where Dz is the closure of D1 given by (3.161). In fact, D; is the aggregation of DZ by II( D1). Therefore, DZ is a finer structure than the maximal f-skeleton 0;. Theorem 3.45 gives a polyhedral interpretation of skeletons.
+
+
Theorem 3.46: Let x be an extreme point of B(f) and K be an edge of B(f). Suppose {x} = F ( D o ) and K = F ( D 1 ) for Do, D1 E D. Then, we have x E K (i.e., 2 is an end point of K) if and onlyif for { e y e ' } E I I ( D 1 ) (i) vertices e and e' in the Hasse diagram H ( P ( D 0 ) ) = (E,A*(Do))of P ( D 0 ) are adjacent and (ii) the Hasse diagram H(P(D1)) of P ( D 1 ) is obtained by identifying e with e' in H(P(D0)) (i.e., contracting the arc which connects e and e l ) . 72
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS (For the definition of
P(Di) (i = 0 , l ) see Section 3.2.a.)
(Proof) From Theorem 3.32, we have JIl(D0)J= J E Jand III(D1)I = \El - 1, so that TI(&) consists of a two-element set and singletons. From Theorem 3.43 and Lemma 3.31, we have z E K if and only if (1) D1 C 00 and (2) for T E II(D1) with IT1 = 2 and for S 1 , S 2 E I I ( P 1 ) with S1 c S 2 and T = S2 - S 1 ( P , f ) . S 2 / S 1 is connected. The present theorem follows from this fact. Q.E.D.
Theorem 3.47: Let x i (i = 1,2) be distinct extreme points of B(f) and suppose {z,} = F(D,) for D, E D (i = 1 , 2 ) . Then z1 and z 2 are adjacent in B(f) if and only if there exist vertices e and e' in E connected by an arc both in H(P(D1)) and in H ( P ( D 2 ) ) such that the Hasse diagrams obtained by identifying e with e' in H ( P ( D 1 ) ) and H ( P ( & ) ) , respectively, coincide with each other. (Proof) From Theorems 3.32 and 3.43 and Lemma 3.31 we see that extreme bases z1 and x 2 are adjacent in B(f) if and only if the following two statements hold: (i) There exists a common sublattice 4 of D1 and D2 such that O,E E D3 and (n(D3)1 = IEl - 1. (ii) For T E I l ( D 3 ) with )TI = 2 and for S l , S 2 E 03 with S 1 C S2 and T = S 2 - S1 (D,f ) * S2/S1 is connected, Q.E.D. from which follows the present theorem. It should be noted that for extreme bases x i (i = 1,2) we have P(x;) E D (i.e., D, = D ( q ) in Theorem 3.47) and that if z1 and x 2 are adjacent, we have D(z1)n D ( x 2 ) E D and F ( D ( z 1 ) n P ( x 2 ) ) is the edge of B(f) incident to z1 and 52*
3.4. Intersecting- and Crossing-Submodular Functions
In this section we prove Theorems 2.5 and 2.6 presented in Section 2.3 which relate intersecting- and crossing-submodular functions to submodular systems ([Fuji84b]).
(a) Tree representations of cross-free families We first introduce the tree representation of cross-free families due to Edmonds and Giles IEdmonds Giles77). We call a set { X ; I i E I } of subsets X i (i E I) of E a copartitionof E if { E - Xi I i E I} is a partition of E . Let T = (V,A ) be a tree with a vertex set V and an arc set A = {ui I i E I}. Also let P = (Pv,I 21 E V ) be a family of subsets of E such that the nonempty
+
73
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA P,,’s form a partition of E . Possible repeated members in P are the empty set only. Note that each vertex v E V is given a subset P,,of E. Deleting an arc ai (i E I) from tree T yields a graph with two connected components. Denote the vertex set of the connected component which contains the tail d+a, of ai by V ( a , ), and define
xi = U { PI ~v E V(ai)}.
(3.165)
3=(XaliEI)
(3.166)
We thus have a family of subsets of E . From this construction we can easily see that the family 3 is cross-free. We call the representation of 3 by the pair of the tree T = ( V , A ) and the family P = (PuI v E V ) a tree representation of 3. We show the converse that every cross-free family has one such tree representation. First, consider a laminar family 3 = ( X i I i E I) of subsets of E , i.e., for each X i , X j ( i , j E I ) we have at least one of the following three: (1) Xi n X j = 8, ( 2 ) Xi G X j and (3) X i 2 X j . For simplicity suppose that X i (i E I ) are distinct. Let io be a new index not in I , and define a vertex set V by (3.167) v = {v, i E Iu{i,}}
1
and an arc set A = {u,
I i E I}.
(3.168)
The incidence relation is defined as follows. For each i E I such that X i is a nonempty and non-maximal member of 3, let Xb be the unique minimal member of 3 which properly includes X,. (Note that the members of 3 which includes Xi form a chain due to the fact that 3 is a laminar family (without repeated members).) Then we define d+ui = v, and d-ai = vk. For each maximal member X , of 3 we define d+a, = vi and d-ai = v,,. Also, if 3 contains X i = 0, then for some nonempty minimal member Xl of 3 we define d+ai = vi and d-a, = vl. Consequently, the graph T = (V,A) is a directed tree toward the root vi,. We define X i , = E and for each i E I U {io}
We can see that the pair of tree T = (V,A = {a, 1 i E I } ) and P = (PuI v E V ) gives a tree representation of the laminar family 3 = ( X i I i E I). If we replace an arc ail by series arcs a,,! and ail#!with a vertex v,,‘ between them such that d + ~ , = , d + I~1 ., d - a , , = d - a i , ! and d + ~=~d - ~u i l#~ l , and if we define P,,il, = 0, then the pair of the augmented tree T’ = (V u {vi,#},(A- {ail}) U { U ; ~ ! ~ U ~ ~and ! ! } P’ ) = (P,,j I i E ( I - {il}) U {i”lii’,Zi’’}) II
74
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS represents the laminar family 3' = (Xi I i 6 ( I - {il}) U {t'o,"',ii''}) with ~. members can be treated in this way. repeated members Xil, = X j L ~Repeated We thus have
Lemma 3.48: A family of subsets of a finite set E is laminar if and only if it has a tree representation such that the tree is a directed tree toward the root. Next, let 3 = (Xi I i E I ) be a cross-free family of subsets of E , i.e., for each Xi, Xj ( i , j E I) we have a t least one of the following four: (1) XinXj = 0, (2) Xi C Xj, (3) Xi 2 Xj and (4) Xi u Xj = E. Choose an arbitrary element eo E E and define (3.170) where, putting I0 = {i
I i E I, eo E Xi}, xt =
{ Ext
-
Xi
if i E Io, ifiE1-1"
(3.171)
for each i E I . We can easily see that ? is a laminar family, since ~?is cross-free and 2,U 2 j E - {eo} for any z,j E 1. Therefore, ? can be represented by a pair of a tree 2'= ( V , i )and afamily P = (PI,I v E V ) ,where 2 = {a, I i E I } . Construct a tree T = ( V , A ) by reorienting the arcs 6, (t' E 1 0 ) of tree T = ( V , a ) . Then, the pair of the tree T and the family P represents the original cross-free family 3. Now, we have
Lemma 3.49 [Edm+Giles77]: A family of subsets of E is cross-free if and only if it has a tree representation. The following lemma, concerning the decomposition of uniform cross-free families, is fundamental.
Lemma 3.50: Let $ = (Xi I i E I ) be a cross-free family of subsets of E which uniformly covers each element of E , i.e., 'de E E :
I{; I i E I,
e
E Xi}\ = const. > 0.
(3.172)
Then, $ is the direct sum of families each of which forms a partition or a copartition of E . (Proof) Since { E } is a partition and (0) is a copartition of E , we suppose $ and that that 0 , E # 0. From Lemma 3.49, the cross-free family
4
75
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
I
5 = (Xi i E I) can be represented by a pair of a tree T = ( V , A ) ,with a vertex set V and an arc set A = {ui I i E I},and a family P
= (P,,
12,
(3.173)
EV)
of subsets of E , where nonempty Pu’s form a partition of E . Note that by the assumption we have pu # 0 (3.174) for any leaf v of T . Now, from the assumption and (3.174) there exists at least one Xi such that Xi 4 {0,E } . Therefore, there exist distinct vertices v1 and v2 of T satisfying the conditions that pu, # 0, pu, # 0 (3.175) and that for any vertex u 4 {v1,v2} lying on the unique path from v1 to denoted by Q(v1,v2), in T we have
P,
v2,
(3.176)
= 0.
It follows from (3.172) that the number of positively oriented arcs in Q ( v l , v 2 ) is equal to the number of negatively oriented arcs in Q(v1,v2). (If this is not the case, the value of (3.172) for any el E P,,, can not be equal to that for any e2 E P,,,.) In particular, there exists at least one positively oriented arc and at least one negatively oriented arc in Q(v1,vZ). Hence, there is at least one vertex u $i!{v1,v2} on Q ( q , v 2 ) . Let 0 be the vertex on Q(v1,v2) adjacent to v1 and let ( v 2 , v3,. . - ,v k } (k 2 2) be the maximal set of vertices of T such that for each 1 = 2 , 3 , . . - ,k, (i) P,,, # 0, (ii) the vertex G lies on the unique path Q(vl,wl) from vl to vl in T and (iii) any vertex u { q , v l } lying on Q ( v l , v l ) satisfies (3.176). Moreover, let u j ( l ) E A be the arc connecting v1 with 0 and for each 1 = 2 , 3 , . - . , k let u j ( l ) E A be the arc in Q(v1,vl) such that the orientation of the arc u j ( q is opposite to the orientation of the arc uj(l)and any arc ui (# u j ( q ) between uj(l)and u j ( l ) in Q(v1,vl) has the same orientation as ajil).(Note that arcs u j ( q (1 = 2,3, ,k) are not necessarily distinct.) (See Fig. 3.6.) Let us define
---
= {Xj(l)
I Xjjl) E
$7
1
5 .i 5 k}.
(3.177)
Then, (i) if d + u j ( l ) = 211, II is a partition of E and (ii) if d - ~ j ( =~ vl, ) II is a copartition of E . Therefore, the family 5 contains a subfamily which forms a partition or copartition of E . Define
5’ = (Xi I i E I -
{ j ( l ) 11 = 1,2,...,k}) . 76
(3.178)
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS
.
L
i
Figure 3.6. If $’ is not empty, then $’ also satisfies (3.172) and is cross-free. Repeating the above-mentioned argument, we see that $ is the direct sum of families each Q.E.D. of which forms a partition or a copartition of E .
(b) Crossing-submodular functions Let 3 be a crossing family of subsets of a finite set E with 0, E E 3 and f a crossing-submodular function on 3 (see Section 2.3 for the terminology). We assume R is the set of reals (or rationals). Define (3.179) P ( f ) = { z I z E R E ,V X E 3 : z ( X ) 5 f(X)}. Note that P ( f ) is nonempty. Now, we would like to find the tightest system of inequalities with (0,l)coefficients which represents the polyhedron P(f ). Therefore, define
i ( y )= max{z(Y)
I z E P(f)}
(3.180)
for any Y E , where we put f ( Y )= $00 if the value of x(Y) can be made arbitrarily large for z E P ( f ) . Note that by definition (3.180) we have i ( 0 ) = 0. By the linear programming duality theorem (Theorem 1.10) we have
f(X)c(X)
f ( Y ) = min{ XEjF
77
I
(3.182),(3.183)},
(3.181)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA where (3.182)
c(X)2 0
( X E 7).
(3.183)
We have f ( Y )= +oo if and only if there is no such c ( X ) ( X E 7)that (3.182) and (3.183) are satisfied. We thus have a set function f: 2E -+ R u {+oo}. Since the minimum value of (3.181) can be attained by rational c ( X ) ( X E ?), (3.181)-(3.183) can be rewritten as follows. 1
f(X,)
I
(3.185) - (3.187)},
(3.184)
where
5 = (Xi 1 2 E I ) with
x; E ?, xi G Y
(3.185)
(ZE I )
(3.186)
and
I{; I i E I ,
e E
X;}l = const. = p ( $ , Y ) > 0
(e E Y).
(3.187)
Note that 5 = (Xi I i E I ) is a family of subsets Xi of E , so that we may have X ; = X j for distinct i , j E I. (3.187) means that the family 5 uniformly covers each element of Y . By the definition of the set function f: 2E -+ R U {+oo} we have
P ( f ) = { x I x E RE,V X
C E: x ( X ) 5 f ( X ) } . f ( X ) (X C E ) , (3.189) does not
(3.189)
If we decrease the value of any hold. Since we have not used the crossing-submodularity of f in the above argument, (3.179)-(3.189) are valid for any set function on any family of subsets of E . In the following, we simplify (3.184) -(3.187) by use of the crossing-submodularity off. From the crossing-submodularity of f and (3.184)-(3.187), we can restrict admissible families 5 in (3.184) -(3.187) to those which satisfy (3.190) (i) $ is a cross-free family,
(4 0 4 5,
(3.191) 78
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS
to attain the minimum of (3.184). (For, let 5 be a family which satisfies (3.185)-(3.187) and attains the minimum of (3.184). If there exists a crossing pair of Xi and X j in 5, then put
x, +. xi u x j , xj + x, n x j . this replacement 5 = (Xi 1 i E I ) remains to satisfy
(3.192)
After (3.185)-(3.187), while the sequence of the values of lX,l (i E I ) arranged in order of nonincreasing magnitude becomes lexicographically greater than the previous one. Because of the finiteness character we can repeat the replacement (3.192) for crossing pairs in $ only finitely many times and eventually we obtain a cross-free family 5 which satisfies (3.185)-(3.187) and attains the minimum of (3.184). Furthermore, if 5 contains the empty set, it is redundant and can be removed.)
Theorem 3.51: Let fp(E)and fq(E)be defined by f p ( ~ )= min{
C f(x,) I
{xi I i E I>:
a partition of E ,
iEI
xi
3},
( 3.193)
V j E J : X j E 3, IJI 2 3 ) .
(3.194)
ViE I:
E
(3.195)
(Proof) We can restrict admissible families 5 = ( X i I i 6 I) in (3.185)-(3.187) with Y = E to those further satisfying (3.190) and (3.191). For such a family 5,from Lemma 3.50, 5 is the direct sum of partitions and copartitions of E . Since every subfamily of 5 forming a partition or a copartition of E satisfies (3.185)-(3.187) with Y = E , (3.190) and (3.191), it follows that we can restrict admissible families 5 = (Xi I i E I) to those which form partitions and copartitions of E with X , E 7 (i E I).Note that the copartition {0} of cardinality 1 is excluded by (3.191) and that copartitions of cardinality 2 are also partitions. Q.E.D. We thus have (3.193)-(3.195). From Theorem 3.51 we can show
Theorem 3.52: The following four statements are equivalent: 79
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA (i) The polyhedron defined as the intersection of P(f) and the hyperplane x ( E ) = f(E),i.e.,
B(f) = {x I x E R”, V X E 3: .(X) 5 f ( X ) , z ( E ) = f(E)}, (3.196)
(3.197) (3.198)
(iv) For any partitions { X ; I i E I} and and E - Y, E 3 ( j E J) we have
{Y, I j
E
J} of E with X ; E 3 (i E I )
(3.200) iEI
j€J
(Proof) The equivalence between (i) and (ii) follows from the definition of f*(E).To show the equivalence between (ii) and (iii), recall (3.193)-(3.195). If f(E) = f ( E ) we , have fp(E)2 f ( E ) while , from (3.193) we have fp(E)5 f(E) since E E 7. We thus have fp(E)= f ( E ) . Moreover, since 0 E 7,we have from (3.199) (3.201) ( f # ) P P ) 2 f#(E) = f(E). If j ( E ) = f ( E ) ,we have from (3.194) and (3.195) f(E)F f q ( E ) ,i.e., (3.202)
for any copartition { X j 1 j E J} of E such that X j E 7 ( j E J) and IJI 2 3. Note that (3..202) holds for IJI = 1 and 2, due to the assumption that f(E) 5 fp(E). (3.202) is rewritten as (3.203)
for any partition {q 1 j E J } of E such that E - Yj E 7 ( j E J ) . Hence, (f#),(E)5 f ( E ) . Consequently, from (3.201) we have ( f # ) , ( E ) = f(E). 80
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS
Conversely, suppose that f ( E ) = fp(E)= (f#),(E). Then we have (3.203) and hence f ( E ) 5 fq(E).Therefore, f ( E ) = f ( E ) . Finally, we show the equivalence between (iii) and (iv). Since we always have (3.204) f,(E) 5 f(E) 5 (f#)P(E), Q.E.D. (iv) implies (iii). The converse, (iii) -*- (iv), is immediate. Theorem 2.6 follows from Theorem 3.52. For proper subsets of E the value of f is expressed as follows. Theorem 3.53: For each nonempty proper subset Y of E ,
I
j ( ~=)min{ C f(x,) {x;I i E I ) : a partition of Y , iEI
vi E I : X ,
E
3}.
(3.205)
(Proof) By the same argument as in the case of Y = E in the proofs of Lemma 3.50 and Theorem 3.51, we see that we can restrict admissible families $ in (3.185)-(3.187) to those which form partitions and copartitions of Y . Let P* = { X i I i E I } be a copartition of Y with Xi E 3 (i E I ) and 111 2 3. (Note that if 111 = 2, P* is also a partition of Y . ) Then, for any distinct X , , X j E P*,Xi and X j cross. It follows from (3.190) that we need Q.E.D. not consider copartitions of Y . Note that f is the Dilworth truncation of f when B(f) is nonempty. We also have Theorem 3.54: For any X , Y 2 E with X U Y # E , if f ( X ) ,j*(Y)< +oo, then f ( x ) f ( y )2 f(xu Y ) f ( xn Y ) . (3.206)
+
+
(Proof) If X n Y = 0, (3.206) is immediate. Therefore, suppose that X , Y C E satisfy X n Y # 0,X U Y # E and f ( X ) ,f ( Y )< +m. Then, for some partition { X i I i E I } of X and some partition {Yj I j E J } of Y such that Xi E 3 (i E I ) and YJ E 7 ( j E J ) , we have (3.207) iEI
j€ J
due to Theorem 3.53. Let $ = (Zk I k E I @ J ) be the direct sum of families ( X , I i E I ) and (Yj 1 j E J ) . Since X U Y # E , one of the following three statements holds for any Zi,Zj E $: 81
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
(i) Zi and Zj are disjoint,
(3.208)
(ii) Zi C Zj or Zj Zi, (iii) Zi and Zj cross. If 2, and Zj cross, replace 2,and Zj as
(3.209) (3.210)
zj+ zi n zj.
zi c zi u zj,
(3.211)
Repeat this replacement until the current family 5 = (Zk I k E I @J ) becomes a cross-free family and satisfies (3.208) and (3.209) for any Z,, Zj E 5. By the same argument made after (3.192), this replacement process terminates in a finite number of steps. The finally obtained 5 is the direct sum of two families which form a partition {Xi I i E i} (kjE 3 (i E i))of X U Y and a partition {$, 1 j E (?j E 7 ( j E of X n Y . Since the replacement (3.211) reduces the value of (3.207), we get
s}
s))
Q.E.D. It follows from Theorem 3.54 that the family
? defined by
(3.213) f = {X I x c E , i ( X ) < +m} is a cointersecting family (i.e., X , Y E f, x u Y # E ==+ x u Y , X n Y E f) and that f restricted to 3 is a cointersecting-submodular function on ? (i.e., f(X) + f ( Y ) 2 ? ( X u Y ) + f ( X n Y ) for any X , Y E 3 with X U Y # E ) .
Now, let us consider the polyhedron
which is the intersection of P ( f ) and the hyperplane s ( E ) = f ( E ) ,and suppose that B ( f ) is not empty (see Theorem 3.52). We examine the structure of B ( f ) . For each proper subset Y c E , define
Then, by the linear programming duality theorem,
82
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS
c
where
C ( X )= X Y ( 4
(e E
El,
(3.217)
eEXE3
c(X)2 0
( X E ?,
x # E).
(3.218)
Similarly as (3.184), (3.216) can be rewritten as
(3.220) - (3.224)),
(3.219)
where
5 = ( X ; I i E I), I{i I
eE
(3.220)
X ; E 7, X ; # E
(i E I),
X ; , i E I}[ = const.
=p(5,Y)
I{i 1 e E X ; , i E I } / = const. = p ( 5 , E - Y ) P(5,Y
) > 4 5 ,E
(e
(3.221)
Y) E E -Y), (e E
- Y).
(3.222) (3.223) (3.224)
It should be noted that (3.219) is valid for any set function f , By use of the set function f: 2E + R u {+m} defined by (3.184) (or (3.195) and (3.205)), the polyhedron B ( f ) of (3.214) can also be expressed as B ( f ) = {Z I x E RE,V X E
f : z ( X ) 5 f * ( X ) ,z ( E ) = f ( E ) ( =f(E))}, (3.225)
where 9 is defined by (3.213). Therefore, we can replace f and 7 in (3.219) and (3.221) by f and ?, respectively. For Y c E , if { E - X ; 1 i E I} is a partition of E - Y , we call {Xi I i E I} a copartition of E - Y augmented by Y .
Theorem 3.55: For each nonernpty Y C E ,
{ E - Xi I i E I } : a partition of E ViE
I: x,E f ) .
- Y,
(3.226)
(Proof) If f and ? in (3.219) and (3.221) are replaced by f and f , we can restrict admissible families 5 in (3.220) -(3.224) to those which satisfy (3.220)(3.224) (with ? replaced by ? in (3.221)) and the following (i)-(iv): 83
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA (i)
(ii) (iii) (i.1
5 is a cross-free family, for any X , , X j E 5 we have Xi n X j # 0, 5 does not contain a subfamily which forms a copartition of E , E 4 5.
(3.227) (3.228) (3.229) (3.230)
(Here, (i)-(iii) follow from Theorems 3.51, 3.53 and 3.54. (iv) follows from the form of (3.219).) From (i), the family 5 = ( X i I i E I) can be represented by a pair of a tree T = ( V ,A ) and a family
P
= (P,,
12,
(3.231)
E V),
where A = { a , I i E I} and nonempty PU’s form a partition of E as in Lemma 3.49. From (ii), T is a directed tree. (For, if there were distinct arcs ai and aj in T such that d - a , = a - a j , we would have Xi n X j = 0.) Let vo be the root of T. If P,,, = 0,then $ contains a subfamily which form a copartition of E. Therefore, P,,, # 0 due to (iii). Since for each e E E the number of i’s for which e E Xi should be taken from the fixed set of two distinct values of (3.222) and (3.223), for any leaf u of T every vertex w 6 { u , v o } lying on the unique path Q ( v 0 , u ) connecting vo with u in T gives
P, = 0, where note that P,
# 0 due to (iv). It follows from
(3.232) (3.224) that
P,,, = Y and that
{E -Xi
I Z E I,
d + ~= i VO}
(3.233)
(3.234)
is a partition of E - Y. Let 5’ be the family obtained from 5 by deleting Xi’s such that d + a , = vo. If 5’ # 0, then 5’ also satisfies (3.221)-(3.224) (with 3 replaced by f ) and (3.227)-(3.230). (The tree representation of 5’ with root vo is obtained by contracting or shortcircuiting arcs a, such that d+a, = vo in T.) It follows that 5 is a direct sum of families which form copartitions of E - Y augmented by Y.Since any family which forms a copartition of E - Y augmented by Y also satisfies the conditions required for 5, the minimum of (3.219) is attained by a family 5 which forms a copartition of E - Y augmented by Y. Q.E.D. We define
m)E(W=f(E)). =
We now have a set function
f2
from 2“ to R u {+oo}. 84
(3.235)
3.4. INTERSECTING- AND CROSSING-SUBMODULAR FUNCTIONS
Theorem 3.56: For any X , Y & E such that . f ~ ( X ) , . f 2 ( < Y )+oo, we have
(Proof) If X E { 0 , E } or Y E { 8 , E } , then (3.236) is trivial. So, suppose 4 E } , Y $! {O,E} and X , Y E 9. Then, from Theorem 3.55, for some partition { E - X i I i E I } of E - X and some partition { E - y3 I j E J}gf E - Y with X ; E 9 (i E I ) and y3 E 9 ( j E J),we have
X
{a,
5 = (Zk I k E I CB J ) be the direct sum of families ( X i I i E I ) and (y3 I j E J ) . If, for Z;,Zj E 5, we have ( E - Z i ) n ( E - z j ) # 0, z , n ( E - Z j ) # 0 and ( E - 2;)n Zj $. 0 , then replace Let
zi
zi u zj,
zj t Z, n zj.
(3.238)
Repeat such a replacement until there is no such pair of 2, and Zj in 5. This process terminates in finitely many steps. We can easily see that the finally obtained 5 is the direct sum of families 51 = (X,t I i E 1') and G2 = (YjI j E J ' ) such that { E - Xs* I i E I * } is a partition of E - ( X u Y ) and { E - Yj' I j E J ' } is a partition of E - ( X n Y ) ,where, if X n Y = 0 , the family g2 may be composed of the empty set alone. For any pair of 2, and Z j to be replaced by (3.238) we have 2, u Zj # E . It follows from Theorem 3.54 and (3.237) that
j€J *
> f 2 ( X u Y )+ f 2 ( x n Y ).
-
(3.239)
Q.E.D. From Theorem 3.56,
&
=
{X I X C E , . f 2 ( X )< +a} 85
(3.240)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA is a distributive lattice with set union and intersection as the lattice operations, join and meet. Denote by f2 the function obtained by restricting the domain 2E of f2 to D2. Then, ( D 2 , f 2 ) is a submodular system on E and the polyhedron B(f) defined by (3.225) is also expressed as
B ( f ) = {x
I
E R E ,VX E D2:
x(X) I f2(X), x ( E ) = f 2 ( E ) ( = f ( E ) ) } (3.241)
which is the base polyhedron
B(f2)
associated with the submodular system
(D2, f2).
Since different submodular systems give different nonempty base polyhedra, nonempty B ( f ) uniquely determines a submodular system (D2, f 2 ) such that B(f) = B(f2). Moreover, we see from (3.235) and Theorems 3.53 and 3.55 that if B(f) is nonempty, each f2(X) (X E P2) is expressed M a linear combination of f ( Y ) ’ s (Y E 3) with integer coefficients. Therefore, if f is integer-valued, so is f 2 . This completes the proof of (ii) of Theorem 2.5. It should be noted that (3.226) can be rewritten in a dual form as
f$(z)= m a x { C f#(yj) 1
{ y j I j E J): a partition of Z,
j€ J
V j E J: E - Y , E f )
(3.242)
for each nonempty proper subset Z c E . Here, f,f is the Dilworth truncation of the intersecting-supermodular function f# on .
f
(c) Intersecting-submodular functions
Let f : 3 + R be an intersecting-submodular function on an intersecting family 3. We assume that f(8) = 0 if 8 E 3. Consider the polyhedron
P(f) = {x I z E RE, VX E 3: x(X) 5 f(X)}.
(3.243)
Since intersecting-submodular functions are crossing-submodular, P(f) is expressed as (3.244) P ( f ) = {x I x E RE,VX E : z ( X ) 5 f(X)}, where f is defined by (3.193)-(3.195) and (3.205). Since 3 is an intersecting family and f : 3 -+ R is intersecting-submodular, we can restrict 5 in (3.184)-(3.187) to those which satisfy (3.186), (3.187), (3.190), (3.191) and the following: 86
3.5. RELATED POLYHEDRA
(iii) for any X,, X i E
5 such that Xi n X j # 0 , we have Xi C X j
or X j
C Xi, (3.245)
i.e., 9 is a laminar family. In particular, fp(E) and fq(E) defined by (3.193) and (3.194) satisfy f d E ) 5 f,(E)* (3.246) It follows from (3.246) and Theorems 3.51 and 3.53 that for any nonempty
Y C E
j ( ~=)m i n { C f(xi) I {x,I i E I}: a partition of Y, iEI
vi E I : xi E 3 } , and we have cation of f .
j(0) = 0 by
definition (3.180). Function
(3.24 7)
f is the Dilworth trun-
Theorem 3.57: Let f: 3 --+ R be an intersecting-submodular function. For a n y X , Y C E andf: 2E -+ RU{+m} defined by(3.247), i f f ( X ) , j ( Y )< +co, then i ( X ) i ( Y )2 j ( X u Y ) j ( X n Y ) . (3.248)
+
+
(Proof) Since f is an intersecting-submodular function on 3, Theorem 3.54 holds for X , Y E with X U Y = E as well. Q.E.D. Define
Di
=
{X I X
C E,
f ( X ) < +m}
(3.249)
f
and let f l be the restriction of to D 1 . Then, from Theorem 3.57, D1 is a distributive lattice and f l is a submodular function on D1. Since polyhedron P(f) in (3.243) is expressed in terms of f l as P ( f ) = {X
I z E R E ,b'X
E
Di:
~ ( xI )f i ( X ) }
(3.250)
which is the submodular polyhedron P(f1) associated with the submodular system (01, f l ) on E . Since different submodular systems give different associated submodular polyhedra, the intersecting-submodular function f : 3 + R uniquely determines the submodular system ( & , f l ) such that P ( f ) = P(f1). Moreover, from (3.247), f l is integer-valued if f is. This completes the proof of (i) of Theorem 2.5.
3.5. Related Polyhedra
87
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
We show some polyhedra which are closely related to base polyhedra and submodular/supermodular polyhedra.
(a) Generalized polymatroids A. Frank [FrankBlb] introduced the concept of generalized polymatroid. Suppose that a submodular system ( P I , f') and a supermodular system ( D 2 , g ' ) on E' satisfy
Then the polyhedron P(f',g') defined by
is called a generalized polymatroid or g-polymatroid. (The same polyhedron is E' also considered by R. Hassin [Hassin78,82] for the case where D1 = D2 = 2 .) Generalized polymatroids are characterized by the following theorem, which is implicit in [Frank8lb] (also see [Schrijver84a]) (see Fig. 3.7).
88
3.5. RELATED POLYHEDRA
Theorem 3.58 [Fuji84a]: For the base polyhedron B(f) associated with a submodular system ( D , f ) on E , the projection of B(f) along an axis e E E on the hyperplane z(e) = 0 is a generalized polymatroid P(f',g') in RE' with E' = E - {e}, where
DI D2
{ X I e $! X E D } , = {E - X I e E X E D}, =
(3.253) (3.254)
f' is the restriction off to D1 and g' is the restriction o f f # to D2. Conversely, every generalized polymatroid in RE'is obtained in this way, For each generalized polymatroid P(f', 9') with Di C 2E' (i = 1,2) such a base polyhedron B(f) in RE with E = E ' U { e } is unique u p to translation along the new axis e, and the two polyhedra P(f', 9') and B ( f ) are isomorphic with each other under the projection of the hyperplane z ( E ) = f ( E )onto the hyperplane z(e) = 0 along the axis e. (Proof) The base polyhedron B(f) is the solution set of (3.255)
z ( E ) = f(E). Choose an element
eE
(3.256)
E . From (3.256) we have s(e) =
f ( E )- z ( E - {e}).
(3.257)
Substituting (3.257) into (3.255), we have
VX E D with e $! X : z ( X ) 5 f(X), V X E D with
eE
X : z ( E - X)2 f ( E )- f(X).
(3.258) (3.259)
(3.258) and (3.259) is rewritten as
VXE
D1:
z ( X ) 5 f'(X),
(3.260)
WE
D2:
s ( Y )2 g'(Y),
(3.261)
where D1 and D2 are, respectively, defined by (3.253) and (3.254), j' is the restriction o f f to D1 and g' is the restriction of f# to D2. It follows from (3.260) and (3.261) that the projection of B ( f ) along the axis e on the hyperplane s(e) = 0 is the generalized polymatroid P(f',g') in RE'with E' = E - { e } . Note that (3.251) follows from the submodularity of j. 89
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Now, we show the converse. For an arbitrary generalized polymatroid
P( f', 9')in RE'with a submodular system ( D 1 , f') and a supermodular system ( D 2 , g ' ) on E' let e be a new element not in E' and define E D2" =
= E' U {e},
{E-X I X E
D
(3.262) (3.263)
D2},
(3.264)
= D1 U K " .
Then, D is a distributive lattice with 0,E E D due to (3.251). Also, define a function f : D -+ R by
f(X)= f'(X) (XE
(3.265)
Dl),
f(X)= f ( E )- g'(E - X) (XE f(E) = c ,
E"),
(3.266) (3.267)
where c E R is arbitrary but fixed. From (3.251), (3.265) and (3.266) we have for any X E D1 and Y E K o
Therefore, f : D t R is a submodular function on the distributive lattice D . Moreover, for some a E R, ( z , ~ E) B(f) if and only if
VX E
vxE
D1:
z(x - { e l )
KO:
.(X) 5 f ( X ) = f'(X),
+ a 5 f(x) =f
+
z(E)
Q
( ~ -) g'(E - x ) ,
(3.269)
(3.270) (3.271)
=f(E).
Eliminating a in (3.270) by using (3.271), we have
VX E KO:z ( E - X)2 g'(E - X)
(3.272)
or WE
D2:
~ ( y2)g'(Y).
(3.273)
Therefore, for the submodular system ( D , f ) defined by (3.262)-(3.267) P(f',g') = {z
I z E RE,3a E R: 90
( z , a )E B(f)}.
(3.274)
3.5. RELATED POLYHEDRA Moreover, it is clear that P(f',g') and B(f) are isomorphic with each other under the projection of the hyperplane z ( E ) = f ( E )onto the hyperplane z(e) = 0 along the axis e. Q.E.D. It follows from Theorem 3.58 that extreme points, extreme rays, faces etc. of P(f',g') are characterized by the corresponding results for B(f) (cf. Section 3.3). Moreover, since the greedy algorithm works for B(f), it also works for P(f',g') mutatis mutandis (cf. [Hassin82]). When f': 2E' + Z+ is the rank function of a matroid M1 on E', 9': 2E' --t Z+ is the dual supermodular function of the rank function of a matroid M2 on E' and the pair of f ' and g' defines a generalized polymatroid, we call the ordered pair (M1,Mz) a strong map. This definition of strong map is equivalent to the ordinary one (see, e.g., [Welsh76]). If (M1,M2) is a strong map and the rank of M1 is equal to the rank of Ma plus one, the submodular system (P, f ) on E = E' U {e} appearing in Theorem 3.58 is a matroid M3 such that M3 - {e} = M1 and M3/{e} = Ma, if we define f(E) = f ' ( E ' ) . Frank [Frank8lb] originally defined generalized polymatroids in terms of intersecting families. This corresponds to the fact that a crossing-submodular function on a crossing family determines the base polyhedron associated with a submodular system (see Theorem 2.5). Note that if P C 2E is a crossing family, then Pi (i = 1,2) defined by (3.253) and (3.254) are intersecting families. (For more details on generalized polymatroids, see [Frank Tardos881.)
+
(b) Polypseudomatroids The concept of pseudomatroid was introduced by R. Chandrasekaran and S. N. Kabadi [Chandrasekaran+Kabadi88]. The same or similar concepts were independently considered by A. Bouchet [Bouchet87] as A-matroid, A. Dress and T. F. Have1 [Dress Have1861 as metroid, M. Nakamura [Nakamura88b] as universal polymatroid and L. Qi [Qi88] as ditroid. We shall consider (poly-) pseudomatroids of Chandrasekaran and Kabadi from the point of view of submodular systems. Denote by 3E the set of all the ordered pairs (X,Y ) of disjoint subsets of E . Let f: 3E -+ R be a function with f(0,0) = 0 such that for each ( X , , K ) E 3E (i = 1,2)
+
Define a polyhedron
P,(f) = { z
I 5 E RE,V(X,Y) E 3": 91
x(X) - z ( Y ) 5 f(X,Y)}.
(3.276)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA The polyhedron P, ( f ) is called a polypseudomatroid ([Chandrasekaran+Kabadi 881, [Kabadi ChandrasekaranSO]) and f its rank function (see Fig. 3.8). Polyhedral studies are also made in [Nakamura88b] and [Qi88,89]. A pseudomatroid is a set-theoretical version of a polypseudomatroid.
+
We call a pair (S,T ) E 3E such that S U T = E an orthant of RE.For each orthant ( S , T ) denote by 2(spT) the set of all the pairs ( X , Y ) such that X C S and Y C T . Now, choose an orthant ( S , T ) . Then for each ( X ; , Y , ) E 2(S>T1(i = 1,2) we have from (3.275)
This means that for the orthant ( S , T ) the function f ‘ : 2E + R defined by
f‘(x)= f ( S n X , T n X ) is a submodular function on 2E. Define
(XcE)
(3.278)
3.5. RELATED POLYHEDRA The polyhedron P(S,T)( f ) is expressed by the submodular polyhedron P(f') associated with the submodular system (2E, f') as follows. P(S,T)(f)= {x I y E P(f'), Ve E S:z(e) = y ( e ) , V e E T : z ( e )= - y ( e ) } . (3.280) ) the same as those of Therefore, the combinatorial properties of P ( s , ~ ) ( fare P(f') and the greedy algorithm described in Section 3.2.b works for P ( s , ~ ) ( f ) mutatis rnutandis as for P(f'). Define B(S,T)(f) = {.
I x E P(S,T)(f),4 s)- 4 T ) = f ( S J ) ) .
(3.281)
the base polyhedron in the orthant ( S , T ) of the polypseuWe call B(S,T)(f) domatroid P,(f). When f ( S , T ) = 0 and B ( s , T ) ( ~C) RE+,B ( s , T ) ( ~is) the set of linked vectors of a polylinking system (or a polybimatroid); a set theoretical version of the system is called a linking system (or a bimatroid) (see [Schrijver78,79]and [Kung78]). From Theorem 3.22 we have
Corollary 3.59: A vector x E RE is an extreme point of B(s,T) ( f ) in (3.281) if and only if for a maximal chain
C: 8 = A o C A l c . * * C A , = E
(3.282)
of 2E we have
f ( S n Ai,T n A,) - f ( S n A i - l , T n A,-1) if A, - A,-1 E: S, z(A, - A,-l) - z ( A , - Ai-1) if A, - A,-1 C T . for each i = 1,2,.
(3.283)
- - ,n .
We also have
Lemma 3.60: For each orthant ( S , T ) of RE we have
Then, for any (X,Y) E 3E we have from (Proof) Suppose z E B(S,T)(f). (3.275)
4x1 - .(Y)
f(X,Y) = x(X)- .(Y) - j(X,Y) x ( S ) - s ( T ) - f(S,T) 5 5 ( S - Y )- Z(T - X)- f ( S - Y,T - X) + ~ ( s n X ) - s ( T n -j(SnX,TnY) Y) < 0. -
+
93
(3.285)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Hence z E P, ( f ).
Q.E.D.
We see from Lemma 3.60 that B(S,T)(f)for each orthant ( S , T ) is a face of P, ( f ) . Since
for any w: E
-+
R we have from Lemma 3.60
For an orthant (S,T ) such that w(e) 2 0 (e E S) and w(e) 5 0 (e E T ) ,(3.287) holds with equality. Therefore, the problem of maximizing the linear function CeEE w(e)z(e) over the polypseudomatroid P, ( f ) is solved by maximizing the same linear function over P(S,T)(f) or B ( s , ~ ) ( f )Hence . the greedy algorithm as in Corollary 3.59 works for the polypseudomatroid P,(f) and the union of all the extreme points of B(S,T)( f ) for all the orthants ( S ,T ) is exactly the set of all the extreme points of P, ( f ) . Also, we see from Lemma 3.60 (and Lemma 3.2) that for each ( X , Y ) E 3E
so that f is uniquely determined by P,(f).
The greedy algorithm is given as follows. Here, note that we consider a maximization problem rather than a minimization problem (cf. Section 3.2.b). Greedy algorithm f o r polypseudomatroids
Step 1: Find a sequence ( e l , e 2 , - . * , e n )of all the elements of E such that Iw(el)l 2 lw(e2)1 2 . .. 2 Iw(e,)I. Choose an orthant ( S ,7’)such that w(e) 2 0 (e E S) and w ( e ) 5 0 ( e E 7’). Step 2: Let Ai be the set of the first i elements of the sequence ( e l , e 2 , . . . ,en) for each i = 1 , 2 , .. - ,n and compute a vector z E R E by (3.283). (z is a maximizer of the linear function CeEE w ( e ) z ( e ) over the polypseudomatroid
P*(f)-) (End) 94
3.5. RELATED POLYHEDRA
Theorem 3.61 [Chandrasekaran+Kabadi88], [Nakamura88b]: For any function f : 3E -+ R define P,(f) = {x I x E RE,V(X,Y) E 3 E : x ( X )- ~ ( y2)f(X,y)}. (3.289) The greedy algorithm of the type described above works for P,(f) if and only i f f is the rank function of a polypseudomatroid.
(Proof) It suffices to show the “only if” part. Suppose that the greedy algorithm described above works for P,(f). Then, for any (Xi,&)E 3E (i = 1,2) choose a maximal chain C of (3.282) containing (XI n X2)U (Y1n Y2)and ((XlUX2)-(Y1UY2))U((Y1UY2)-(X1UX2)) in it and define thevector x E RE by (3.283), where (S,T) is an orthant such that (XI U X2)- (Y1U Y2)C S and (Y1U Y2)- (XI U X2)C T . From the assumption we have z E P,(f), It follows from the definition of z that
x(X1n X2)- z(Yln Y2)= f(Xl n X2,Y1 n Y2).
(3.292)
From (3.290) -(3.292),
It follows that f is the rank function of a polypseudomatroid.
Q.E.D.
Theorem 3.62 [Chandrasekaran+Kabadi88] : The system of inequalities
.(X) - .(Y) 5 f(X,Y) ((X,Y) E 3
9
(3.294)
is totally dual integral.
(Proof) The present theorem follows from Lemma 3.60 and Corollary 3.21. Q.E.D. 95
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA The concept of polypseudomatroid explained above can be generalized as follows. Let 3 be a subset of 3" such that for each ( X i ,y ) E 3 (i = 1,2) the two pairs ( ( X IU X2) - (Yl U Y2),(Yl U Y2)- ( X I U X 2 ) ) and ( X I f l X 2 , Y1 fl Y2) belong to 7.Also let f : 3 --f R be a function such that for each ( X , , K ) E 3 (i = 1,2) f satisfies (3.275). The class of polypseudomatroids in this generalized sense includes as special cases submodular and supermodular polyhedra, base polyhedra and generalized polymatroids. Further generalization was considered by Qi [Qi88,89].
(c) Ternary semimodular polyhedra In the preceding subsection 3.5.b we considered the set 3" of all the ordered pairs ( X ,Y ) of disjoint subsets X and Y of E . 3E is a distributive lattice with lattice operations V and A defined as follows. For any ( X i , y t ) E 3" (i = 1,2) define ( X 1 , Y l ) v (X2,Y2) = ( X l u X2,Yl nY2), (3.295)
Wl,Y l )A ( X 2 ,Y2) = ( X l fl x2,Yl u Y2).
(3.296)
Identifying each ( X , Y ) E 3" with a ( 0 , +l}-vector x ( X , Y ) defined by
(eEX) (eEY) (e E E - ( X U Y ) ) ,
1 -1 0
(3.297)
we see that operations V and A in (3.295) and (3.296) are ordinary ones in vector lattice R" and that 3" is a finite sublattice of R". Let 5 be the partial order on 3" associated with the distributive lattice 3E. We call a pair of ( X i , Y , ) E 3" (z = 1,2) comparable if we have ( X 1 , Y l ) 5 (X2,Y2) or ( X 2 , Y z ) 5 ( X 1 , Y l ) . We also use the partial order 5 for { O , f l } vectors under the correspondence (3.297). b 4 R be a Let b be a sublattice of the distributive lattice 3 E and submodular function on b, i.e., for each ( X i , & ) E b (i = 1 , 2 )
f:
f ( X 1 ,Y l ) + f ( X 2 3 2 ) 2 f ( X 1 u x2,Yl n Y2) + Wl flx2,Yl u Y2), (3.298) where we write f ( X ,Y ) instead of f ( ( X ,Y ) ) .Also, define a polyhedron by
$(f) = {z I z E R E , V ( X , Y )E 8: z ( X ) - z ( Y ) 5 f ( X , Y ) } .
@(f)
(3.299)
Without any additional condition the polyhedron F(f) defined by (3.299) may be empty. The following theorem shows that a trivial necessary condition for P(f) to be nonempty is also sufficient. 96
3.5. RELATED POLYHEDRA
Theorem 3.63 [Fuji84e]: e ( j )is nonempty if and only if
i ( 0 ,X ) + j ( X ,0 ) 2 0 for each
(3.300)
x g E such that ( @ , X I(x,@) , E 5.
(Proof) The “only if” part is trivial. We show the “if” part. Suppose (3.300) E such that (0,X ) , ( X ,8 ) E $. It follows from the Farkas holds for each X lemma or the linear programming duality theorem that @ ( j#) 0 if (and only if) for all positive a, E R (i E I ) and ( X , , Y , ) E b (i E I ) with a finite index set I such that (3.301) crix(Xi,K ) = 0
C iEt
we have (3.302) Here, note that x ( X , , y i ) is the coefficient vector of the inequality .(Xi) z(Y,) 5 f ( X , , Y , ) . Since the vectors x ( X , Y ) ( ( X ,Y ) E b ) are integral, we can restrict the positive real coefficients a; (i E I ) in (3.301) to positive integers. It follows that @ ( f )# 8 if (and only if) for all ( X i ,Y , ) E b (i E I ) with a finite index set I such that CX(Xa,Y,)= 0 (3.303) iEI
we have (3.304) *El
where possibly ( X , , Y , ) = ( X j , y 3 ) for distinct i , j E I . If the family of ( X , , Y , ) (i E I ) in (3.303) contains an incomparable pair of ( X l , Y l ) and ( X 2 , Y 2 ) ,then Put (XI,Yl) ( X l u x2,Yl n Y2), (3.305a) +
(X2,Y2)
+-
( X l n X2,Yl u Y2).
(3.305b)
After the replacement (3.305) relation (3.303) remains valid and the value ,of the left-hand side of (3.304) does not increase, due to the submodularity of f . Since we get a family of ( X l ,K ) (i E I ) composed of pairwise corngarable elements of b after a finite number of such replacements, it suffices to show that we have (3.304) for all (X,,Y,) E b (i E I ) such that (X,,Y,) (i E I ) are pairwise comparable and (3.303) holds. Therefore, suppose that (3.303) holds for (X,,Y,) (i E I = {1,2,...,m}) and
97
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA We see from (3.303) and (3.306) that
x1=0, Suppose 111 2 2. If X,
-
Y, = O .
(3.307)
Y1 # 0, then for any e E X,
- Yl
we have (3.308)
which contradicts (3.303). Similarly, Y1 - X, Hence, we must have
Y1=
# 0 leads to
x,.
a
contradiction. (3.309)
Putting 21 = Yl(= Xm), we have from (3.307) and (3.309)
From (3.310) and assumption (3.300),
Put I + I - { l , m } . For the new index set I (3.303) still holds. Repeat the above argument until (11 = 0 or 1. When (11= 1, suppose I = {io). Then, from (3.303), X(Xi,,r,,) = 0, (3.312)
x;, = 0,
r,, = 0.
(3.313)
Hence, from (3.300),
~ ( ~ a , , =~ f(0,0) , ) 2 0.
(3.314)
It follows from (3.311) and (3.314) that (3.315)
where I = {1,2,
. ,m } , the original index set.
Corollary 3.64: Define a sublattice
DO of b
Q.E.D.
by
Let fo be the restriction of f^ to DO, and P ( f 0 ) be the polyhedron given by (3.299) with b and replaced by bo and fo, respectively. Then, @(f)# 0 if and only ifF(j0) # 0. 98
3.5. RELATED POLYHEDRA Corollary 3.64 means that when
X # 0 and Y # 0 do not cut off
f’(f0)
# 0, the inequalities in (3.299) with
$(fa) too much to give empty f’(f).
Moreover, it should be noted that if (0,0) E each ( X ,Y ) E 8
f(X,Y) = i(X, Y)
b
and f(0,0) = 0, then for
+ f(0,0) 2 f(X,0) + f(0, Y) ,
(3.317)
so that the inequalities appearing in the right-hand side of (3.299) for (X,Y) E 8 with X # 0 and Y # 0 are redundant, i.e., f’(f) = f’(fo), where fo is defined in Corollary 3.64. Now, let us consider the following linear programming problem ( P ) with CERE.
( P ) : Maximize
(3.318a)
c(e)z(e) eEE
subject to V(X,Y) E
8: z(X) - z(Y) 5 f ( X , Y ) .
(3.318b)
In general, the system of linear inequalities (3.318b) is not totally dual integral, and even i f f is integer-valued, f’(f) may have non-integral extreme points. For example, consider E = {1,2), (3.319a)
8 = {({1,2},0),
(3.3 19b)
({1},{2))},
f(W, (2)) = 0. Then @(f ) has the only one vertex given by (i,i). i({L 2), 0) = 1,
(3.319~)
The linear programming dual of Problem ( P ) is described as follows.
( P * ) : Minimize
A(X,Y)f(X,Y) (X,Y)ED
subject to
c
A(X,Y) -
(X,Y)ED eE X
c
(3.320a) A(X,Y) = c(e)
(e E
E),
(X,Y)ED eEY
(3.320b)
~ ( X , Y2) 0 ( ( X , Y ) E P).
(3.320~)
Though the system of linear inequalities (3.318b) is not totally dual integral, we have the following.
Lemma 3.65: Let c E R E be an integral vector and suppose that Problem (P’) has an optimal solution. Then there exists a rational optimal solution A*(X,Y) ( ( X , Y ) E 8) of ( P * )such that & = {(X,Y) I A * ( X , Y ) > 0 ) 99
(3.321)
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA A
consists of pairwise comparable elements of D. (Proof) By the assumption there exists a rational optimal solution A * ( X , Y ) ( ( X , Y )E 6 ) of (P*). For some positive rational do each A * ( X , Y ) ( ( X , Y )E 6 ) is a nonnegative integral multiple of do. If & given by (3.321) contains an incomparable pair of elements ( X i , Y , ) (i = 1,2), then define CY
= min{A*(X,,Y,)
I i = 1,2} > 0
(3.322)
and change the values of A* ( X i ,Y,) (i = 1,2), A* ( X IU X2, Y1 nY2) and A* ( X In u Y2) as
X2,Yl
A*(X,,yi)
+-
A * ( X ; , y i )- CY
(i = 1,2),
(3.323)
A*(X1u X 2 , Y 1 n Y2)t A*(X1u X 2 , Y 1 nY2)+ C Y ,
(3.324)
A*(Xl n X 2 , Y 1 u Y2)t A*(X1n X 2 , Y 1 u Y2)+ C Y .
(3.325)
Then, new A* satisfies (3.320b) and (3.320~)and is an optimal solution of ( P * ) since the objective function is not made increase by the above replacement (3.323)-(3.325) due to the submodularity o f f . Repeat (3.322)-(3.325) so long as & given by (3.321) contains an incomparable pair. Only a finite number of repetitions of (3.322)-(3.325) are possible since (1) all the generated A*’s are distinct, (2) each A * ( X , Y ) ( ( X , Y ) E 6 ) is nonnegative integral multiple of do > 0 and (3) the sum of all A * ( X , Y ) ( ( X , Y )E 0)is constant. Q.E.D. The above proof is a direct adaptation of a standard proof technique developed by N. Robertson, L. Lovdsz [Lovdsz76], J. Edmonds and R. Giles [Edm+Giles77] and A. J. Hoffman [Hoffman74]. Now, consider an additional structure of 6 and f as follows.
(t) If for (xi,Y,)E 6
(i = 1,2)
x1
(3.327)
n y2 # 0,
(3.328) then ( X I
-
Y2,Y1), (X2,Y2 -
j(Xl,YJ
X I )E
0 and
+ j ( X 2 , Y 2 ) 2 j ( X 1 - Y2,Yl)+ j ( X 2 , Y 2
-
XI).
(3.329)
Note that (3.326)-(3.328) implies that for some e,e‘ E E we have x ( X 1 , Y d e ) = x(X2,Y2)(e)# 0 and x(X1,Y1)(e’) = - X ( X 2 , Y 2 ) ( 4 # 0. 100
3.5. RELATED POLYHEDRA
6 and satisfy property (t) described by (3.326) - (3.329). Then system (3.318b) of linear inequalities is totally dual integral.
f
Theorem 3.66 [Fuji84e]: Suppose
To prove Theorem 3.66 we need some lemmas. The proof of the following lemma is similar to the proof technique developed by Robertson et al.
Lemma 3.67: Suppose that c E RE is an integral vector, that Problem (P*) has an optimal solution, and that 6 and f: 6 + R satisfy the above additional property (t). Then there exists a rational optimal solution A * ( X , Y ) ( ( X , Y )E 6 ) of (P*) such that & given by (3.321) consists of pairwise comparable elements of 6 and does not contain any ( X j , x ) (i = 1,2) which satisfy (3.326) - (3.328). (Proof) By Lemma 3.65, let A * ( X , Y ) ( ( X , Y ) E 6 ) be a rational optimal solution of (P*) such that & given by (3.321) consists of pairwise comparable elements of 6. Also let do be a positive rational number such that each A * ( X ,Y ) Y )E is a nonnegative integral multiple of do. If & contains ( X , , x ) (i = 1,2) which satisfy (3.326)-(3.328), then let ( X , , y t ) (i = 1,2) be elements of & for which
((x,
6)
(t) (3.326)-(3.328)
hold and for each (X3,Y3) E & such that ( X l , Y l ) ? ( X 3 ,Y3) ? (X2,Y2) we have
x1n y2 c E - (x,u y3).
(3.330)
(Note that there always exists such a pair of ( X i ,y t ) (i = 1,2).) Define a!
= min{A*(X,,Y,)
I i = 1,2} > 0.
a!
by
(3.331)
Change thevaluesofA*(X;,yt) (i = 1,2), A*(Xl-Y2,Y1) and A*(X2,Y2-X1) as A*(X,,X) + A*(X,,yt) - a! (i = 1,2), (3.332)
A'(X1X*(X,,Y,
Y2,YI) + A*&
-
X,)
t
A'(X,,Y,
+
a!,
(3.333)
- X , ) +a!.
(3.334)
- Y2,Yl)
The new A* satisfies (3.320b) and (3.320~)and is an optimal solution of (P*) because of (3.329). It follows from (3.330) that the new A* gives & in (3.321) which consists of pairwise comparable elements of 5. Repeat (3.331)-(3.334) so long as & in (3.321) contains ( X , , Y , ) (i = 1 , 2 ) which satisfy the above (t). Then, all the generated A * % are distinct, because each changing of A * by (3.332)-(3.334) increases the total sum of 101
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA
IE - ( X U Y ) I A * ( X , Y )( ( X , Y )E 5 ) by 21x2 nY+ > 0. Also each A * ( X , Y ) ( ( X , Y ) E 6) is a nonnegative integral multiple of do > 0, and the sum of
A * ( X , Y )( ( X , Y )E 6) is constant. Therefore, after a finite number of steps we get a desired optimal solution A* of (P*). Q.E.D.
Let A = ( a ( i , j ) I i E I , j E J ) be a p x q matrix with a row index set I = { 1 , 2 , . . . , p } and a column index set J = { 1 , 2 , . . . , q }. For an integer t , we say A has the upper consecutive t ’s property (or the lower consecutive t ’s property) if a(i0,jo) = t for a pair of io E I and j o E J implies a ( i , j o ) = t for all i E I with i 5 io (or i 2 io). Also, we say A has the consecutiue t’s property if a(i1,jo) = a(i2,jo) = t for some i l , i 2 E I and j o E J with i~ < i2 implies u ( i , j ~= ) t for all i E I with il 5 i 5 i2. Denote the ith row and the j t h column of A = ( a ( i , j )I i E I , j E J) by a ( i , . ) and a ( . , j ) ,respectively. A matrix A is called totally unimodular if the determinant of every square submatrix of A is equal to 0, 1 or - 1 .
Lemma 3.68: Let I = { 1 , 2 , . . . , p } and J = { 1 , 2 , , q } . Suppose A = ( a ( i , j ) I i E I , j E J) is a (0, fl}-matrix such that (i) anypairofrowsa(i1,a) a n d a ( i a , . ) o f A ( i 1 , i a E I ) iscomparable and (ii) A does not contain, as a submatrix, any of the following 2 x 2 matrices
(; -;),
(-;
1:)
and the ones obtained from these matrices by row and column permutations. Then A is totally unimodular. (Proof) Suppose that the rows of A are indexed so that a(p,
a)
5 u(p - 1 , .) 5
. 5 u(1,-).
(3.335)
Also suppose q = p . We show that the possible values of the determinant of the (square) matrix A are 0, 1 and - 1 . Since the following argument is valid for any square submatrix of the original matrix A, this implies that A is totally unimodular. Define (3.336) I(+) = {i I i E I , 0 4 u ( i , e)},
I ( - ) = {i 1 i E I , a ( ; , . ) 5 O } ,
(3.337)
I ( + , - ) = { 1 , 2 , * * . , P-} ( I ( + )u I ( - ) ) ,
(3.338)
where 0 is the zero row vector of dimension IJI(= Ill). From (3.335), A has the upper consecutive 1’s property and the lower consecutive -1’s property. 102
3.5. RELATED POLYHEDRA If I ( + ) U I ( + , - ) = 8, then A is totally unimodular and detA = 0, 1 or -1, since A is a {O,-1} matrix and has the consecutive -1’s property[Hoffman+Kruskal56]. Therefore, suppose I(+) U I ( + , -) # 8. Let a(.,jo) be a column of A such that a ( i , j o ) = 1 for all i E I(+) U I(+, -). (Such a column exists because of (3.336), (3.338) and the upper consecutive 1’s property of A.) If a(io,jo)= -1 for some io E I ( - ) , then I ( + , -) = 8, since otherwise for an arbitrary il E I(+,-)we have a(i1,jo) = 1 and there exists a column u(.,jl) such that a ( i l , j l ) = a(io,jl) = -1, which contradicts the assumption. When I(+,-) = 0, A is totally unimodular and detA = 0, 1 or -1, since by multiplying each row a ( i , . ) (i E I(-))by -1, A becomes a matrix which has the consecutive 1’s property if the rows are appropriately reordered. Therefore, further suppose a(i,jo) = 0 for all i E I ( - ) . Now, transform the matrix A by fundamental row operations with pivot a(1,jo) = 1 in such a way that the joth column a ( . , j o )becomes a unit vector. Let A’ be the matrix obtained from the resultant matrix by further removing the first row and the joth column, and let A’, and A; be the submatrices of A’ composed, respectively, of row vectors corresponding to ( I ( + )U I(+, -)) - (1) and I(-). Then, since A has the upper consecutive 1’s property and the lower consecutive -1’s property and since by the assumption for any j E J such that u ( 1 , j ) = 1 we have u ( i , j ) = 0 or 1 for all i E I ( + ) U I ( + , - ) , both A‘, and A; have the lower consecutive -1’s property. Hence, A‘ has the consecutive -1’s property by appropriately reordering the rows (i.e., by reversing the row ordering of A;) and is totally unimodular. We thus have detA = +detA‘ = 0, 1, or -1. Q.E.D. We are now ready to prove Theorem 3.66. (Proof of Theorem 3.66) Let c E RE be an integral vector, and suppose Problem (P*)has an optimal solution. By Lemma 3.67 there exists an optimal solution A* of ( P * )such that & given by (3.321) consists of pairwise comparable elements of b and does not contain any (Xi,yi) (i = 1 , 2 ) which satisfy (3.326)-(3.328). Then it follows from Lemma 3.68 that the set of row vectors x ( X ,Y )( ( X ,Y )E &) forms a totally unimodular matrix, which implies the existence of an integral optimal solution of (P*). Q.E.D. We call the polyhedron $(f)the ternary semimodular polyhedron associated with (8,f ) satisfying property (t). A general framework for proving total dual integrality of systems of linear inequalities related to submodular functions is proposed by A. Schrijver [Schrijver84a,84b],which includes total dual integrality of the Edmonds-Giles submodular flow model [Edm Giles771 and many other models. However, it is not clear whether the total dual integrality of (3.318b) with property (t) of (4.326)-(3.329) follows from Schrijver’s framework.
+
103
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA For a submodular system ( D ! , f') and a supermodular system ( D " , 9") on
E , define b 2 3E by
and for each ( X , Y ) E
b (3.340)
Then, f: b + R is a submodular function on is expressed as
b , and e(f)defined by (3.299)
W) = P ( Y ) r-7 P ( 9 " ) ,
(3.341)
where P ( f r ) is the submodular polyhedron associated with the submodular system ( D t , f') and P(g") is the supermodular polyhedron associated with the supermodular system ( D t ' , g t 1 ) . Theorem 3.63 implies that P ( f ' ) n P ( g " ) is nonempty if and only if g"(X) 5 f ' ( X ) for each X E D' n D". Moreover, it should be noted that there exists no pair of ( X i ,y i ) in the present b which satisfies (3.326)-(3.328). Therefore, if f' and g" are integer-valued and P ( f t ) n P ( g " ) # 0, each face of P ( f r ) n P(g") contains integral points due to Theorem 3.66. This leads to the discrete separation theorem (Theorem 4.12) due to [Frank82b]. It should be noted that a submodular polyhedron, a supermodular polyhedron, a base polyhedron, and the intersection of two base polyhedra are special cases of the intersection of submodular and supermodular polyhedra and that all of these polyhedra are ternary semimodular polyhedra. Hence, in general the greedy algorithm does not work for ternary semimodular polyhedra. Let ( D ' , f') be a submodular system and (D", 9") a supermodular system, both on E , such that P ( f r , g r r )= {x 1 x E R E ,VX E p': x(X)5 f ' ( X ) , W E D": z ( Y ) 2 g " ( Y ) }
is a generalized polymatroid, i.e., for each
x-YED',
X E D' and Y
E
Dtr we have
Y-XED",
f ' ( X ) - g"(Y) 2 f'(X-- Y ) - g"(Y - X ) .
f'(0)
b
1: b
and + R by (3.339) and (3.340), respectively. Since = g"(0) = 0 by definition, we have from (3.344)
Define
f(0, X ) + f ( X ,0) 2 2j(0,0) = 0 104
(3.342)
(3.343) (3.344)
1(0,0) = (3.345)
3.6. SUBMODULAR SYSTEMS OF NETWORK T YP E for each X E D' n D". It follows from Theorem 3.63 that generalized polymatroids are always nonempty (cf. Theorems 2.3 and 3.58). Also, the total dual integrality of (3.342) follows from Theorem 3.66. Suppose that a distributive lattice 6 2 3" and a submodular function f: b -+ R satisfy the property that for any ( X , , x ) E b (i = 1,2) satisfying (3.326) and (3.327) we have ( X l -Y2, Y l ) , ( X 2 ,Yz - X I ) E D and (3.329) holds. Then, ?(f) defined by (3.299) is called a hybrid independence polyhedron by # 0 if and only if f ( 0 , 0 ) 2 0 (if Tomizawa [Tomi8la]. In this case, ( 0 , 0 ) E 6),since (3.345) holds for each X such that ( 0 , X ) , ( X , 0 ) E 5. It should be noted that the class of hybrid independence polyhedra includes the class of generalized polymatroids but not the class of intersections of submodular and supermodular polyhedra.
e(f)
Readers should be referred to a nice review [Schrijver84a] for other related polyhedra and systems such as lattice polyhedra ([Hoffman Schwartz781, Hoffman821, [Hoffman78]), Frank's kernel s y s t e m ((Frank791) and [Groflin Grishuhin's model ([Grishuhin81]).
+
+
3.6. Submodular Systems of Network Type [Tomi+Fuji8l]
Let N = (G = ( V , A ) , c )be a capacitated network with an underlying graph G = (V,A ) and a nonnegative upper capacity function c: A + R + , where the lower capacity function is regarded as the zero function. The cut function IC,: 2" + R associated with the network N is given by =
c 4.)
(U E V ) ,
(3.346)
lZEA+lJ
where A + U is the set of arcs leaving U (see Section 2.3). Without loss of generality we assume that G is a simple graph and that each arc a E A is identified with the ordered pair (d+a, % a ) of its end-vertices. (3.346) can be rewritten as
ICc(U) =
c c U E l l fJECl-[U}
c(u,v)-
cy
[I..fl)
E(
( c ( u , v )+ c ( v , u ) )
(U E V ) , (3.347)
)
('2')
where for each arc ( u , v ) E A we write c ( ( u , v ) )as c ( u , v ) , is the set of all the two-element subsets of U , and we define c(u, v) = 0 for (u,v ) $ A . For any the set of all finite set X and any integer i with 0 5 i 5 1x1 we denote by the i-element subsets of X .
(4)
105
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA For any non-zero set function f : 2v R (05 i 5 IVl) such that
-+
R there exist functions f ( i ) :
(7)
-+
(3.348)
By the Mobius inversion formula f(') (0 5 i 5 IVl) are uniquely determined from f as = (-l)~X-Y~f(Y). (3.349)
fqx)
c
YGX
+
Let k be an integer such that 0 5 k 5 IVI, f ( k ) # 0 and f ( i ) = 0 ( k 1 5 i 5 IVl). The function f is called a set function of order k (see [Tomi80b]). We see from (3.347) that any cut function is of order 2 if c # 0 (also see (3.353) and (3.354) below). A submodular system (2", f ) is said to be of network type if f is equal to the cut function IC,: 2v + R associated with a network having a nonnegative capacity function c.
Theorem 3.69 [Tomi+Fuji81]: Suppose that (2v,f ) is a submodular system f ) is of network type if and only if the following (i) - (iii) hold: (i) The order of f is less than or equal to 2. (ii) For the functions f ( i ) (0 5 i 5 IVl) in (3.348),
on V . (2',
f(0)
= 0,
f (1) > - 0,
( 3.350) (3.351)
(iii) For each X
CV ,
(Proof) The 'only if" part: If ( 2 V , f ) is of network type and f = n, for a network with a nonnegative capacity function c , then from (3.347) we have
106
3.6. SUBMODULAR SYSTEMS OF NETWORK TYPE f ( 2 ’ ( { u , v } )= - ( c ( u , v ) t c ( v , u ) ) .
(3.354)
Since the capacity function c is nonnegative, (i) - (iii) easily follow from (3.353) and (3.354). The “if” part: Suppose (i)-(iii) hold. Consider the bipartite graph G = ( W + ,W - ; with the left and right vertex sets W + and W - and with the arc set defined by
a
a)
w-= (;),
w+= v,
a = ((u,U)
I
u
EuE
(;)}.
(3.355)
(3.356)
Let fi = (2,;)be a network with the underlying graph G and a nonnegative capacity function c^ such that for each u E Z(u) is sufficiently large, where W + is the entrance vertex set and W - the exit vertex set of &. Then, it follows from the assumption that there exists a flow p: 2 -+ R in fi such that
a
a+) = fQ)({u}) ( u E W + ( =V ) ) , -ap(u) = f‘2’(u) (u E w-(=(;))I,
(3.357) (3.358)
due to the supply-demand theorem for bipartite networks (Theorem 1.4) ([Gale 571, [Ford Fulkerson621). Choose one such flow p: 2 -+ R+ . Define
+
C b ,
4 = P ( b , { u , 4))( ( u ,4 E 4.
(3.360)
Let N be the network with the underlying graph G = (V,A ) and the nonnegative capacity function c defined by (3.359) and (3.360). From (3.357)-(3.360) we have (3.353) and (3.354). Since the order of f is less than or equal to 2, f coincides with the cut function IG, associated with the network A. Q.E.D. We see from this theorem that for a submodular system ( Z V , f ) on V with the rank function of order at most 2 the problem of discerning whether the submodular system (2V, f ) is of network type or not can be solved by a max-flow computation for the network & defined in the above proof, since (ii) in Theorem 3.69 can directly be checked and (iii) together with (3.351) is a necessary and sufficient condition for the existence of a feasible flow in the bipartite network f i . Moreover, when ( 2 V , f ) is of network type, consider the minimum-cost network-realization problem defined as follows: 107
11. SUBMODULAR SYSTEMS AND BASE POLYHEDRA Find a network d = (G = (V,A ) , c ) with rc, = f such that the cost (3.361) a€ A
is as small as possible, where ~ ( ais) the realization cost per unit capacity for each arc a E A . As is seen from the above proof, this problem is reduced to a Hitchcock transdefined in the above proof (see portation problem for the bipartite network (TomiSFuji811).
k
108
Chapter 111.
Neoflows
In this chapter we consider generalizations of classical flow problems of Ford and Fulkerson to flow problems with boundary constraints described by submodular functions. The new flow problems to be treated are the submodular flow problem, the independent flow problem and the polymatroidal flow problem, and they are, in a sense, equivalent. Because of this we call the class of these flow problems and other possible equivalent ones the neoflow problem and each of them a neoflow problem (cf. [Fuji87a]). We give a theory and algorithms for the neoflow problem.
4. The Intersection Problem
In this section we consider the problem of finding a maximum common subbase of two submodular systems and some related problems. 4.1. The Intersection Theorem
Let ( D i , f i ) (i = 1,2) be two submodular systems on E and consider the following problem.
P I : Maximize z ( E ) subject to z E P(fl) n P(f2)
(4.la) (4.lb)
Equivalently, we express this problem as follows. Let E' be a copy of E and we regard ( D 2 , f i ) as a submodular system on E'. Also let G = ( E , E ' ; A )be the bipartite graph with the left and right vertex sets E and E' and with the arc set A = {(e,e') I e E E } , where e' E E' is a copy of e E E , i.e., A gives a natural bijection between E and its copy E' (see Fig. 4.1). Furthermore, we consider a capacity function c: A + R U {+m} such that ~ ( a=) +oo ( a E A ) . Then Problem PI in (4.1) is equivalent to the following problem
PI': Maximize dp(E ) ~ subject to ( ~ 3 pE) P(fI), -
(WE' E P(f21,
(4.2a) (4.2b) (4.2~)
where p: A + R is a flow, d p is the boundary of p in N and ( 8 ~and ) ( ~d ~ ) ~ ' are, respectively, the restrictions of d p to E and El. A flow p: A ---f R satisfying (4.2b) and ( 4 . 2 ~ )is called a feasible flow in A' = (G = ( E , E ' ; A ) , c , S l , S z ) , 109
111. NEOFLOWS
E
e4
el
0
. .
E'
.. Figure 4.1.
where S ; = (D,,f;) (i = 1 , 2 ) . As we will see later, Problem PI' is a special case of a neoflow problem.
(a) Preliminaries We need some preliminaries to furnish an algorithm for solving the intersection problem described by (4.1) or (4.2). Consider a submodular system (D, f) on E . In the following we give several lemmas which are obtained by a direct adaptation of the results shown in [Fuji78a] for polymatroids.
Lemma 4.1: Suppose z E P(f), u E sat(z) and v E dep(z,u) - { u } . For any a: E R such that 0 < a: 5 c"(z,u,v)define y = z a(xU- xu). Then, y E P(f) and (4.3) sat(y) = sat(z).
+
(Proof) From the definition of the exchange capacity we have y E P(f). Also, since for any X E D such that X 2 sat(s) we have y(X) = z ( X ) and sat(z) is the unique maximal tight set X such that z ( X ) = f ( X ) ,we have sat(y) = sat (x). Q.E.D. 110
4.1. THE INTERSECTION THEOREM
Lemma 4.2: Under the same assumption as in Lemma 4.1, (w E E
c^(y,w) = i3(z,w)
- sat(z)).
(4.4)
and similarly,
f(X) - .(X) 2 f ( X u XO) - z(X u XO). Hence the lemma follows from (2.37).
(4.6)
Q.E.D.
Lemma 4.3: For any z E P ( f ) let u1, u2 and 212 be three distinct elements of E such that u, E sat(z) (i = 1 , 2 ) , (4-7) 7)2
E dep(z,uz),
VZ
4 dep(z,.u1).
(4.8)
For any a E R such that 0 < CY 5 C " ( Z , U ~ , V ~ ) define Y = 2 + 4 x u , - XtJ.
(4-9)
Then we have u1 E sat(y) and deP(Y,ul) = d e p ( v 1 ) .
(4.10)
(Proof) From Lemma 4.1 we have u1 E sat(y). Also we have u2 4 dep(z,ul), since otherwise we would have dep(s,uz) dep(z,ul) by the minimality of dep(z,u2) and hence v2 E dep(z,ul). Therefore, putting XO= dep(z,ul), we have y(X0) = z ( X 0 ) = f ( X 0 ) and y ( X ) = z(X) for any X E P with X Cr XO. (4.10) follows from the definition of dependence function. Q.E.D. Lemma 4.4: For any z E P ( f ) let u1, uz, 211 and of E satisfying (4.7), (4.8) and v1 E dep(z, 4 .
be four distinct elements (4.11)
Then for the vector y defined by (4.9) for any CY E R with 0 < CY 5 C(z,uz,vz), we have C"(y,w,vd = E ( ~ , U h V l ) . (4.12) 111
111. NEOFLOWS (Proof) For any z E P(f) and
X, E D
such that z(X0) = f(X0) we have
f ( x )- Z ( X )2 f(xn X o ) - z ( X n X o ) For Xo
(XE D).
(4.13)
= dep(s, u1) we have from Lemma 4.3
and since u 2 , v2
4 dep(z,ul), we have y(X) = .(X)
(X
c xo,x E P).
(4.15)
Since (4.13) holds for z = 5, y, (4.12) follows from (4.14) and (4.15). Q.E.D. Lemma4.5: F o r a n y z c P ( f ) letui,vi ( i = 1 , 2 , - . - , q ) be2qdistinctelements of E such that
( k = 1,2,-..,q),
(4.16)
i < j 5 q). For any ( ~ (i i = 1 , 2 , - . . , q ) satisfying 0 < (Y; 5 E(z,ui,v;) (i define a vector y E RE by
(4.17)
v; E dep(z,ui)
ui E sat(z),
$! dep(s,ui)
vj
(1 5
= 1,2,..-,q)
(4.19) sat(y) = sat(z),
2(y, W ) = Z(Z, w )
(w E E
(4.20) - sat(s)).
(4.21)
(Proof) Considering the elementary transformations in the order of the pairs (ug,vq), (ug-l,vp-l), ( u l , q ) , the present lemma can be shown by repeatedly applying Lemmas 4.1-4.4. Q.E.D. .
a
*
,
It should be noted that we have (4.19)-(4.21) if (4.16) and (4.17) hold for an appropriate numbering of ui’s and v;’s. Lemma 4.5 will play a very fundamental rBle in developing algorithms for solving the intersection problem and other related problems.
(b) A n a l g o r i t h m a n d the intersection theorem 112
4.1, THE INTERSECTION THEOREM
We now consider Problem PIf described by (4.2). Given a feasible flow p in network N = (G = ( E , E ’ ; A ) , c , S 1 , S 2 )define , the auziliary network N, = (G, = ( V , A , ) , c , ) associated with p as follows. G, = ( V , A , ) is a directed graph, called the auxiliary graph associated with p, with vertex set V and arc set A , given by
v = E u E‘ u {s+,s-}, A , = s; u A; u A* u B* u A; u s;,
(4.22) (4.23)
where S: = {(s+,v)
I v E E - sat+(d+cp)},
(4.24)
A; = {(u,v) I v E s a t + ( a + p ) , u E dep+(d+p,v) - {v}}, A* = A ,
(4.25)
B’ = { ( e f , e ) 1 e E E } , A ; = {(u,v) 1 u E sat-(d-cp), v E dep-(d-p,u)
(4.27)
S; = {(v,s-)
- {u}},
I v E E - sat-(d-cp)}.
(4.26) (4.28) (4.29)
Here, d+’p = ( d ~ )d-cp ~ , = - ( d ~ ) ~and ’ , sat+ and dep+ (sat- and dep-) are, respectively, the saturation function and the dependence function defined with respect to submodular system (P,,fl) on E ( ( P 2 , f z ) on IT).Note that B* is the set of the reorientations of arcs of A . We also define the capacity function c,: A , t R U {+m} by ?+(d+cp,v) E+(d+cp,v,u) E-(d-cp,u,v)
2-(d-cp,v)
( a = (s+,v) E s;), ( a = ( u , v )E A : ) , ( a E A* U B * ) ,
(4.30)
( a = (u,v) E A ; ) , ( a = (v,s-) E s;),
where c^+ and E+ (2- and E - ) are, respectively, the saturation capacity and the exchange capacity defined with respect to submodular system (D1,f l ) on E ( ( P 2 , f z ) on E‘). Figure 4.2 shows the auxiliary network N,. Let us consider an algorithm described as follows. We call a directed path from s+ to s- of the minimum number of arcs a shortest path from s+ tq s-. We assume an oracle for exchange capacities for (Pi,fi) (i = 1 , 2 ) . Algorithm for the intersection problem I n p u t : afeasible flow p in U = (G = ( E , E f ; A ) , c , S 1 , S 2 ) . O u t p u t : a maximum flow p in 1. 113
111. NEOFLOWS
S+
S-
Figure 4.2.
Step 1: Construct the auxiliary network Alp = (G, = (V,Alp),c,,). Step 2: If there exists no directed path from s+ to s- in Alp,then the algorithm terminates and the current 'p is a maximum flow in A. Otherwise, find a shortest path P from s+ to s- in Nlp and put (Y
t
min{c,(a)
{
p(a)
I a is an arc in P } ,
+
(Y
p(a) - (Y
( a = (e,e') E A and a is in P),
( a = (e,e') E A and (e',e) is in P).
(4.31) (4.32)
Go to Step 1. (End) Theorem 4.6: The Aows 'p obtained in Step 2 of the algorithm are feasible Aows in 1.Moreover, each time we carry out (4.31) and (4.32), the Aow value of 'p increases by a! > 0 given by (4.31). (Proof) In Step 2 we find a shortest path P from s+ to s- in the auxiliary network Alp. Let ( u+l ,v1+ ), . - ., ( u z ,):v be the arcs in A: lying on P in this (u, ,v;) be the arcs in A; lying on P in this order. order and ( u : , w:), By the way of choosing path P , for each i, j such that 1 5 i < j 5 p ( q ) we have u' 4 dep+(d+(o,vf) (v; 4 dep-(d-'p,u,:)). (4.33) a
.
e ,
114
4.1. THE INTERSECTION THEOREM
Q.E.D.
Therefore, the present theorem follows from Lemma 4.5.
Theorem 4.7: If there exists no directed path from s+ to s- in the auxiliary network Nv in Step 2 of the algorithm, the current flow 'p is a maximum Aow in N. (Proof) Let U' be the set of the vertices in V which are reachable from s+ along directed paths in Nv (see Fig. 4.3).
U'
S-
Figure 4.3. Then for each v E E - U' and u E E' n U' we have dep+(a+'p,v) C E - U ' , dep-(a-'p,u) 2 E' n U * .
(4.34)
d+'p(E - U ' ) = fl(E- U * ) , a-'p(E'n U * ) = f 2 ( E ' n U ' ) .
(4.36)
(4.35)
Therefore,
Moreover, from the definition of U' and the auxiliary network
E n U'
= {e
1 e'
E E'
115
n U * } (gE ) .
(4.37)
Nv we see (4.38)
111. NEOFLOWS From (4.36)- (4.38),
+
d + ’ p ( ~= ) d + p (~ u’) d - ’ p ( ~ n ’ u*)
+
= f l ( E - U*) f2(E’ n U * ) .
(4.39)
On the other hand, for any feasible flow @ in N and for any U C E U E’ such that (1) E - U E D1,(2) E’ n U E D2 and (3) E n U = {e I e’ E E‘ n U } we have
a+@(E)= a+@(E- U ) + a-@(E’ n U )
I fi(E - u) + f2(E‘ n u).
(4.40)
It follows from (4.39) and (4.40) that the current flow y3 is a maximum flow in N. Q.E.D. Since there exists a maximum flow in N (this fact will also algorithmically be proven later), Theorems 4.6 and 4.7 together with the proof of Theorem 4.7 show the following theorem. Note that when f l and f2 are integer-valued, starting with an integral feasible flow in A, the algorithm given above terminates after a finite number of steps and then gives an integral maximum flow.
Theorem 4.8: For Problem Pl’ described by (4.2) we have max{d+’p(E) = min{fl(X)
I ’p:
N} + f 2 ( E ‘- X ‘ ) I X E D1,E’ a feasible flow in
- X‘ E
D2},
(4.41)
where X’ = {z‘ I z E X } C_ E’. Moreover, if f l and f2 are integer-valued, there exists an integral maximum flow in N. Rewriting Theorem 4.8 for Problem Pl,we also have
Theorem 4.9 (The Intersection Theorem): For Problem PI described by (4.1), max{z(E) I z E P(f1) n P(f2H = min{fl(X) f2(E- X ) I X E
+
D1,
E
-X E
Dz}.
(4.42)
Moreover, if f l and f2 are integer valued, the maximum on the left-hand side of (4.42) is attained by an integral vector E P(f1) n P(f2). Theorem 4.9 is a generalization of the intersection theorem for polymatroids due to Edmonds [Edrn’lO].The algorithm given in this section is a direct adaptation of the one given in [Fuji78a]. 116
4.1. THE INTERSECTION THEOREM
Denote by L the set of all the minimizers of the right-hand side of (4.42). L is a sublattice of D1 n &. Then, we have the following theorem. Recall that for a submodular system ( P , f ) and X , Y E D with X C Y denotes the rank function of the minor ( P , f ) - Y / X .
fz
Theorem 4.10 (cf. [Iri79], [Nakamura+Iri81]): Let
be any maximal chain of L1 and define
Then, the following two statements are equivalent:
(i) z is a maximum common subbase o f ( D ; , f ; ) (i = 1,2). (ii) For each i = 1,2,. ,k 1, zs*-’,-1 is a maximum common subbase of (Dl,fl)*S;/S;-1and ( P z , f z ) . ( E - S ; - l ) / ( E - S ; ) , where for each i = 1 , 2 , . . . , k zs*-ss-l i s a base o f ( D 1 , f l ) . S , / S ; - l a n d f o r e a c h i = 2 , 3 , . . . , k + l z s ~ - s l - l is a base of ( P 2 , fz) ( E - S ; - l ) / ( E - S;). (We disregard the case of i = 1 (or i = k 1) if S1 = 0 (or Sk = E ) . )
- +
-
+
(Proof) (i) ===+ (ii): Suppose (i). From Theorem 4.9 we have ”(S;)
+ z ( E - S;)
Since z(S;) have
= s(E)= f , ( S i )
+ f 2 ( E - S;)
(i = 1 , 2 , * * ,k). * (4.45)
I f l ( S ; )and z ( E - S;) I f 2 ( E - S;) for i = 1 , 2 , - . . , k , we must
Since z E P(f1) n P ( f 2 ) , it follows from (4.43) and (4.46) that (i = 1 , 2 , - . - , k )arebasesof ( P l , f 1 ) - S i / S ; - landthat zsi-si-l ( i = 2 , 3 , . . . , k + l ) are bases of ( P z , f2) ( E - Si- 1 ) / ( E - S;), where we disregard the case of i = 1 (or i = k 1) if S1 = 8 (or Sk = E ) . Hence, (ii) holds. (ii) ==+ (i): Suppose (ii). Then we have z E P ( f l ) n P ( f 2 ) . It follows from (ii) that
+
-
117
111. NEOFLOWS From (4.47) and Theorem 4.9 x is a maximum common subbase of ( D ; , f ; ) (i = 1 , 2 ) . Q.E.D. We can also show that the set of the minors of ( D 1 , f l ) and ( & , f 2 ) a p pearing in (ii) of Theorem 4.10 does not depend on the choice of a maximal chain C of L: ([Nakamura Iri811, [Tomi Fuji821) (see Theorem 7.17). Theorem 4.10 is a generalization of a structure theorem for bipartite graphs [Dulmage- Mendelsohn591.
+
+
+
(c) A refinement of the algorithm When fl and f2 are not integer-valued, the algorithm shown in Section 4.1.b may not terminate after finitely many steps. We shall show an algorithm due to Schonsleben [SchOnsleben80]and Lawler and Martel [Lawler+Martel82a] which modifies Step 2 of the algorithm and terminates after repeating Step 2 O( [El3) times. Let T : V ( = E U El) -+ {1,2,. .. ,2n} be a one-to-one mapping which denotes a numbering of the vertices in V , where n = (El. We also define T ( s + ) = 0 and ~ ( s - )= 2n 1. We represent any directed path P from s+ to s- in .A/,+, by the sequence (s+, v1, v2,. ,v,, s-) of vertices in P and denote by T(P)the sequence ( T ( V ~ ) , T ( V ~ ) , . . - , T (ofV the , ) ) numbering indices of the intermediate vertices. For any directed paths PI and P2 from s+ to s- in N,+,we say Pl is lexicographically smaller than Pz if 7r(P1)is lexicographically smaller than 7r(P2). We call the lexicographically smallest one in the set of all the shortest paths from s+ to s- in N,,,the lexicographically shortest path from s+ to s- in .A/,+, (with respect to n-). Now, we modify the part of finding a shortest path P in Step 2 of the algorithm as follows.
+
(*) If there exists a directed path from s+ to s- in N,+,, find the lexicographically shortest path P from s+ to s- in N,+,. Theorem 4.11 ([SchOnsleben80],[Lawler+Martel82a] for polymatroids): If we modify Step 2 of the algorithm given in Section 4.1.b for Problem PI' as above, the algorithm finds a maximum flow in .A/ after repeating Step 2 O(lE13)t imes. ' (Proof) Denote by Wk Vu{s+, s-} the set of the vertices which are reachable by a directed path from s+ having k arcs but not reachable by a directed path from s+ having less than k arcs. Suppose Wo = {s+} and s- E W,. Let P be the lexicographically shortest path in .A/,,. Also suppose that the arcs of A: lying on P appear in order as (4.48) 118
4.1. THE INTERSECTION THEOREM
from
S+
to s-. Put x = d+p and define Y =z
+4 X u ;
-
xu+
(4.49)
where Q is defined by (4.31) for the current p. Consider vertices w , z E E such that w !$ dep+(z,z), w E dep+(y,z). (4.50) Then we must have
v[ @ dep+(z,z),
u: E dep+(x,z),
(4.51) (4.52)
w E dep+(z,v[). (See Fig. 4.4.) Here we may have v;' = w or z = u t .
Figure 4.4. Now, suppose
u t E wk,
v r E wk+1
for some k (1 5 Ic 5 2n). Then we have z E with kl 5 k 1 .
+
Wk,
(4.53)
for some positive integer
(1) If vertex w is not reachable from s+ in N v , then adding arc (w,z)to does not change the set of shortest paths from s+ to s- in N v .
119
kl
N,,,
111. NEOFLOWS (2) Suppose w E Wk, for some
k2
(1
5 k2 5 272). (Note that k2 2 k.)
+
(2-1) If k2 > k or kl < k 1, then adding arc (w, z ) to the set of shortest paths from s+ to s- in 4,.
N,
does not change
(2-2) If k2 = k, kl = k+ 1 and there exists no shortest paths from s+ to swhich include vertex z, then adding arc (w,z) to N, does not change the set of shortest paths from s+ to s- in N,.
+
(2-3) If kz = k, kl = k 1 and there exists a shortest path from s+ to sin N, which includes vertex z , then we have (4.54) since P is the lexicographically shortest path. Because of Lemma 4.5 we can repeatedly apply the above argument to arcs (u:,v') (i = 2 , . - . , 1 ) in (4.48). We can also apply the argument for A: to A ; mutatis mutandis. For each vertex w E V U {s+} define
P,
(4
= min{T(v)
I v E V , (w,v)lies on a shortest path from s+
to s- in A',}. (4.55)
Also denote by p* the feasible flow obtained from 'p by transformation (4.32), Since at least one and let P* be the lexicographically shortest path in A',. arc lying on P is missing in N,., it follows from the above argument that
(i) (the length of P * ) 2 (the length of P)+1 or (ii) (the length of P*)= (the length of P) and p , 5 p,* with p,(v) < p,p.(v) for some v E V
U {s+}.
Case (ii) occurs consecutively O(lV12)times and hence Step 2 is executed Q.E.D.
o(Ivl3)(=O(lE13))times.
The above proof technique is due to R. E. Bixby (cf. [Cunningham84]). It should be noted that Theorem 4.11 together with Theorem 4.7 shows the existence of a maximum flow in 1 for any totally ordered additive group R and that the modified algorithm finds a maximum flow in N by changing feasible flows O( [ E l 3 )times. The above algorithm corresponds to the Edmonds-Karp algorithm for classical maximum flows [Edm Karp721. A complexity improvement over the above algorithm is shown in [Tardos Tovey Trick861 by generalizing the idea of layered networks due to E. A. Dinits [Dinits70].
+
+
120
+
4.2. DISCRETE SEPARATION THEOREM 4.2. Discrete Separation Theorem
A. Frank showed the following theorem. We prove this theorem by the use of the intersection theorem (Theorem 4.9). (Note that we have already shown this theorem in Section 3.5.c.)
Theorem 4.12 (Discrete Separation Theorem) [Frank82b]: Let ( D 1 , f ) be a submodular system on E and ( D 2 , g ) be a supermodular system on E . Then, g<
f ===+3xERE:g i x 5 f .
(4.56)
Moreover, i f f and g are integer-valued, there exists an integral x E RE such that g 5 x 5 f . Here, g 5 f means VX E D1 n Dz: g(X) 5 f(X) and g 5 x (x -< f ) means VX E D2: g(X) 5 x(X) (VX E D 1 : z(X) 5 f ( X ) ) . (Proof) Suppose g
< f . Then from the intersection theorem,
m={x(E) I x E P(f) n P(S#)) = min{f(X) g # ( E - X) I X E
+
= min{f(x)
+
n D2) g ( E ) - g(X) 1 X E DI n D 2 ) D1
= s(E).
(4.57)
Therefore, there exists a vector x in P ( f ) nB(g) (= P(f) nB(g#)). This vector x satisfies g 5 z 5 f . Moreover, if f and g are integer-valued, then from (4.57) and the intersection theorem there exists an integral x E P(f) n B(g), which Q.E.D. satisfies g 5 x 5 f . We can also show the intersection theorem (Theorem 4.9) by using the discrete separation theorem (Theorem 4.12) as follows. Let ( D ; , f;) (i = 1,2) be submodular systems on E . Define
k = min{fl(X) Also define f 2 :
D2
3
+
f2(E
- X) I X
D1,
E
- X E D2).
(4.58)
R by (4.59)
Note that iz: D2 3 R is a submodular function since k 5 f 2 ( E ) ; in fact, ( D 2 , f z ) is the ( f 2 ( E ) - k)-truncation of ( D 2 , f Z ) . Then we have i2#(0) = 0 = fl(0) and for each X E D1 n & - (0)
f2#(X) = f2(E) - f 2 ( E - X) = k - f 2 ( E - X)
5 fl(X). 121
(4.60)
111. NEOFLOWS It thus follows from the discrete separation theorem that there exists a vector x E RE such that f2# I x 5 f l . Since P(f1) n P(f2#) # 0, we have P(f1) fl B ( ~ J (= p(f1) n ~ ( f ~ # 0. ) )Consequently,
where the last inequality follows from the fact (the weak duality) that z ( E ) 5 f l ( X ) + f 2 ( E - X ) f o r a n y z E P ( f l ) n P ( f 2 ) andany X E D 1 w i t h E - X E Dz. This proves (4.42). Moreover, the integrality part of the intersection theorem follows from the integrality part of the discrete separation theorem and the above argument. We have thus shown the equivalence between the intersection theorem and the discrete separation theorem. Using the discrete separation theorem, we show (3.32) and (3.33) in Section 3.l.c of Chapter 11. For two submodular systems (P;,fi) (i = 1 , 2 ) on E let f be the submodular function on D1 fl Pz defined by
+
We write f as f l f2. We can easily see that the relation, P ( f l P(f1) + P(f2), holds. Conversely, for any x E P(fl f2) we have
+ f2)
2
+
which is rewritten as
VX E
D1 fl
Dz: z(X) - f2(X) L fl(X).
(4.64)
It follows from (4.64) and the discrete separation theorem that there exists a vector y E RE such that
Defining z = x - y, we have from (4.65) z E P(f2) and from (4.66) y E P(f,). W e t h u s h a v e z = y + z E P(f,)+P(fz). Therefore,P(fl+fz) g P(f,)+p(f,). This completes the proof of the fact that P(f, + f 2 ) = p(f,) + P(fz). 122
4.3. THE COMMON BASE PROBLEM
4.3. The Common Base Problem
Let (P;,f;) (i = 1,2) be two submodular systems on E . The common base problem for submodular systems (Pi,!;) (i = 1,2) is to discern whether there is a common base x E B(f1) n B(f2) and, if any, to find one such common base. Clearly, that fl(E) = f2(E) is necessary for the existence of a common base. Theorem 4.13: Let (P;,f;) (i = 1,2) be submodular systems on E with fl(E) = f2(E). Then there exists a common base x E B(fl) n B(f2) if and only iffz# 5 f l , i.e.,
vx E p1 nE: fZ#(x) 5 fl(x).
(4.67)
Moreover, i f f ; (i = 1 , 2 ) are integer-valued and a common base exists, then there exists an integral common base.
(Proof) If there exists a common base x E B(fl) n B(f2), then since B(f,) n B(f2) = p(f1) n p ( f ~ # )we , have f2# < x 5 f l . Conversely, if f 2 # 5 fly then there exists a vector x E RE such that f2# 5 x 5 fl, due to the discrete separation theorem (Theorem 4.12). Hence x E P(fl) n P(f2#) = B ( f l ) n B(f2#) = B(f1) n B(f2). Moreover, the integrality part also follows from the integrality part of the discrete separation theorem. Q.E.D. Note that, in Theorem 4.13,
fl(E)= f2(E). Also note that
5 f l if and only if 5 fly’is equivalent to:
f2#
“f2#
f1#
5 fz, since
From the intersection theorem, (4.68) means that there exists a vector x E P(f1) n P(f2) such that x ( E ) 2 f Z ( E ) ,and such a vector x is a common base since fl(E) = f z ( E ) . In this way Theorem 4.13 can also be shown by the intersection theorem. The common base problem can be solved by finding a maximum common subbase x E P(f1) n P(f2) through the algorithm shown in Section 4.1. We shall also give an algorithm for the common base problem which deals only with bases in B ( f l ) and B(f2). 123
111. NEOFLOWS Given bases bl E B(fl) and 62 E B(fi), we denote p = (b1,bz) and define the auxiliary network Np = (Gp = (V,A p ) ,TP+,Ti,c p ) as follows. G p is the underlying graph with the vertex set V = E and the arc set Ap defined by (4.69)
Ap = A; U A;,
I u, E v, = { ( u , ~ I) u , E~V ,
A; = { ( u ,V )
A;
21
{.I} , E dep2(b2,~)- {.I}, E dePl ( b l , ).
-
(4.70) (4.71)
where depl and dep2 are the dependence functions associated with (PI, f l ) and (P2, f i ) ,respectively. c p : Ap + R is the capacity function defined by (4.72)
Here, el and 22 are the exchange capacities associated with (D1, respectively. Also, T: and Ti are subsets of V defined by
: T
= {V
Ti = { V
f l ) and
I E V, bi(v) > bz(v)}, I v E V , bi(v) < b2(0)}.
( Pz,fz),
(4.73) (4.74)
Tg is the set of entrances and Ti the set of exits in Np. Now, an algorithm for finding a common base of B(f1) and B(f2) is given as follows.
An algorithm for finding a common base I n p u t : Submodular systems (D;,fi) (i = 1,2) on E with fl(E) = f2(E) and initial bases bi of (P;,fi) (i = 1,2). O u t p u t : A common base 61 (= b2) if any exists. Step 1: While bl # b 2 , do the following (a)-(c): (a) Construct the auxiliary network Np = (GP= (V,A p ) ,TJ,Ti,c p ) associated with p = (61,bZ). If there is no directed path from T$ to Ti,then stop (there is no common base in B(f1) and B(f2)). (b) Let P be a directed path from TJ to T f in G p having the smallest number of arcs and put a
+-
min{min{cp(a)
I a is an arc on P } ,
b l ( d + P ) - b2(d+P), bz(C3-P)
-
b@P)}.
( d + P is the initial vertex of P and d - P the terminal vertex of P.) (c) For each arc a E A p , 124
5.1. NEOFLOWS if a = (u,v) E A;, then put
bl(4
+
bl(4
- a,
bl(4
+ a,
bz(v)
+
bl(4
+ a,
if a = (u,v) E A;, then put b2(u) +-
Step 2: The current terminates. (End)
bl
b 2 ( ~ )
+-
b 2 ( ~)
a.
is a common base of B(fl) and B(f2) and the algorithm
Because of the way of choosing a directed path P in (b) of Step 1, the vectors bl and b2 remain bases in B ( f 1 ) and B(f2), respectively, due to Lemma 4.5. If the algorithm terminates at (a) of Step 1, then let U be the set of the vertices in GBwhich are reachable by directed paths from Ti.It follows from the definition of the auxiliary network Np that (4.75)
b l ( U ) = f l ( E )- f l ( E - U ) , b2(U) = f 2 ( U ) .
(4.76)
Since b l ( U ) > b 2 ( U ) by the assumption and the definition of U , we have from (4.75) and (4.76)
f1bW=
f 2 ( E ) ) > f l ( E - U )+ f 2 ( U ) .
(4.77)
From (4.77) (and Theorem 4.9) we see that there exists no common base in and B ( f 2 ) . When f l and f 2 are integer-valued and initial bases bl and b2 are integral, bases bl and b2 obtained during the execution of the above algorithm are integral and hence the algorithm terminates after repeating (a)-(.) of Step 1 at most b l ( T 2 ) - bZ(Ti) times. For general rank functions f l and f 2 we adopt the lexicographic ordering technique described in Section 4.l.c ([SchOnslebenSO],[Lawler Martel82al). When finding a shortest path from Ti to Ti by the breadth-first search, for each u E V search arc (u,v) in Ab (or A;) earlier than arc (u,v') in A$ (or A ; ) i f r ( v ) <~(v'),forafixednumberingx: V - + ( l 7 2 , . . - , I V I } o f V Bythis . modification the algorithm terminates after repeating Cycle (a)-(.) of Step 1 O( / E l 3 )times. B(l-1)
+
5. Neoflows
125
111. NEOFLOWS
In this section we consider the submodular flow problem, the independent flow problem and the polymatroidal flow problem, which we call neojlow problems. We discuss the equivalence among these neoflow problems and give algorithms for solving them.
5.1. Neoflows
We first give the definitions of the submodular flow problem, the independent flow problem and the polymatroidal flow problem. (a) Submodular flows
Let G = (V,A)be a graph with a vertex set V and an arc set A. Also let c: A -+ R U {+m} be an upper capacity function and c: A -+ R u {-m} be a lower capacity function. A function 7 : A t R is a cost function. Let 3 C 2v be a crossing family with 0, V E 3 and f: 3 -+ R be a crossing-submodular function on the crossing family 3 with f(0) = f(V)= 0. (See Section 2.3 for the definition of crossing-submodular function on a crossing family.) Denote this network by NS = (G = (V,A),c,E,y,(3,f)). The submodular jlow problem considered by Edmonds and Giles [Edm Giles771 is described as follows.
-
+
Ps: Minimize
(5.la)
7(a)p(a) aEA
subject to ~ ( u5) p(a) 5 Z ( a )
+
(a E
(5.lb)
A),
E B(f).
(5.1~)
Here, d p is the boundary of p with respect to G (see (2.23)) and B(f) is the base polyhedron associated with f (see Theorem 2.5), where we assume
B ( f ) # 0. A feasible p: A + R satisfying (5.lb) and ( 5 . 1 ~ )is called a submodular flow in NS and an optimal solution of the submodular flow problem PS is called an optimal submodular flow in Ns. (The term, submodular flow, was introduced by Zimmermann [Zimmermann82].)
(b) Independent flows Let G = ( V , A ; S + , S - ) be a graph with a vertex set V , an arc set A, a set S+ of entrances and a set S - of exits such that S + , S - C V and S+ n S - = 0. Also let C: A -+ R u ( $ 0 0 ) be an upper capacity function, c: A 4 R U ( - 0 0 ) be a lower capacity junction, and 7 : A R be -+
126
5.1. NEOFLOWS a cost function. Moreover, let (D+,f+) be a submodular system on S+ and (D-,f-) be a submodular system on S - . Denote this network by 11= (G =
(V,A; s+,S-),c,c,7,
(D+,f+),
(D-7
f-1).
The independent flow problem [Fuji78a] is given as follows. For a given v* E R,
PI:Minimize
(5.2a)
7(a)p(u) &A
subject to c ( a ) 5 p(a) 5 Z(u) ( u E A ) , ap(v) = 0 (v E - (S+ u s-)),
v
(5.2b) (5.2~)
( a d s +E P(f+),
(5.2d)
(adS- E ap(s+)= v*.
(5.2e)
w-1,
-
(5.2f)
Here, (dp)" (or (ap)"-)is the restriction of dp: V -+ R to S+ (or S - ) and P ( f + ) and P(f-) are, respectively, the submodular polyhedra associated with (D+,f + ) and (D-,f-). (The original independent flow problem considered in [Fuji78a] is described in terms of polymatroids and is slightly generalized here to submodular systems.) It should also be noted that if the system of (5.2b)-(5.2f) is feasible, we have min{f+(S+),f-(S-)} 2 v* and that letting ( D + , f * + ) and ( D - , f * - ) be, respectively, the (f+(S+) -v*)-truncation of (D+,f+) and the (f-(S-) -v*)truncation of (D-,f-), we can replace (5.2d)-(5.2f) by
Here, note that ap(S+)= --dp(S-) due to ( 5 . 2 ~ ) . A feasible flow p: A -+ R satisfying (5.2b)-(5.2f) is called an independent flow of value V * in NI and an optimal solution of the independent flow problem PI is called an optimal independent flow of value V * in NI. (c) Polymatroidal flows
Let G = (V,A)be a graph with a vertex set V and an arc set A. For each + vertex v E V we consider distributive lattices :D C_ 2b " and 0; C 2"" and submodular functions f: D,r' + R and fu-: D,; -+ R. Here, we assume 0 E D:, 0 E D,- but not necessarily 6+v E D:, 6-v E D,-. Also letc: A 4 R u {-m} be a lower capacity function and 7 : A + R be a cost function. Denote this network by N p = (G = (V,A),c,r,(D:,f:)(v E V),(DJ,fl)(v E V)). 127
111. NEOFLOWS The polymatroidal flow problem [Hassin78,82], [Lawler is given as follows.
P p : Minimize
+ Marte182a,82b] (5.3a)
y(u)p(a) aEA
subject to c ( u ) 5 p(u) (u E A ) , ap(.) = 0 ( v E V ) ,
(5.3b) (5.3c)
(. E V ) ,
(5.3d)
P6-uE P ( f i ) (. E V ) ,
(5.3e)
PO6+'E P ( f 3
where ap is the boundary of p with respect to G, p6+' (or p6-")is the restriction of p: A + R to 6+v (or 6 - v ) , and
P(f:)
= {z
I z E R6+', V X E D::z(X) 5 f : ( X ) } ,
P ( f l ) = {z I z E R6-', V X E Dl:z(X) 5 fi(X)},
(5.4) (5.5)
(The problem is originally defined in terms of polymatroids and is slightly generalized here.) A feasible flow p: A + R satisfying (5.3b)-(5.3e) is called a polymatroidul flow in N p and an optimal solution of Problem P p is called an optimal polymatroidal flow in .Np .
5.2. The Equivalence of the Neoflow Problems
We show the equivalence of the submodular flow problem, the independent flow problem and the polymatroidal flow problem. Here, the equivalence is with respect to the capability of modeling flow problems. Different models may require different oracles for algorithms but we will not go into this matter here. (a) From submodular flows to independent flows Consider the submodular flow problem Ps defined by (5.1). From Theorem 2.5 and the definition of the submodular flow problem we can assume that f appearing in (5.1) is a submodular function on a distributive lattice D C 2" such that 0, V E D and f(0) = f(V)= 0. Let s- be a new vertex not in G = (V,A ) and define s + = v , s- = {s - 1. (54 128
5.2. THE EQUIVALENCE OF THE NEOFLOW PROBLEMS Then the submodular flow problem Ps is rewritten as Minimize
7(a)cp(a)
(5.7a)
subject to ~ ( a5) p ( a ) I Z(a) ( a E A ) ,
(5.7b)
( a d S +E: B ( f ) , - ( a q E (0).
(5.7c)
aEA
(5.7d)
This is an independent flow problem with the underlying graph G’ = (V U { s - } , A ; S + , S - ) . (See (5.2b), (5.2c), (5.2g) and (5.2h), where constraint (5.2~) is void.) It is interesting to see that the submodular flow problem looks like a very special case of the independent flow problem (see Fig. 5.1).
S-
Figure 5.1.
(b) From independent flows to polymatroidal flows Consider the independent flow problem PI described by (5.2). Without loss of generality we assume that there is no arc entering S+ or leaving S- and that f + ( S + )= f - ( S - ) = u * . Let s+ and s - be new vertices not in G = 129
111. NEOFLOWS
(V,A; S+, S - ) . Construct a graph given by
2= (3,A) with vertex set t and arc set A
P = v u {s+,
s-},
(54
A = A u A+ u A -
u AO, AS = {(s+,v) I v E S'},
(5.9) (5.10)
A- = { ( v , s - ) I v E S - } , A' = {(s-,s+)}.
(5.11)
Also define a lower capacity function + R by
?:A
2:
--t
R
(5.12)
U (-00)
and a cost function
(a E A), ( a = (s-,s+)), (u E A+ U A - ) ,
(5.13)
(5.14)
C R6+"and P;
Moreover, for each vertex v E V define polyhedra P: by
P;=
{
4
P-=
R6-"
P(f +)
(v = s+),
(-m,+m)
(v E {s-}
I z E R6+",Vu E 6 + v : z ( u )5 i?(u)} P(f -1
(v E V - S - ) , (v = s-), (v E {s+} U S + ) , (5.16) (v E V - S+),
{z
(-m,+rn)
{z
I z E R6-", Vu E 6 - v : z ( u ) 5 C(u)}
U S - ) , (5.15)
where P ( j S ) and P(f - ) should, respectively, be regarded as polyhedra in RA+ and RA- under the natural correspondence between S+ and A+ and between S- and A - . Now, the independent flow problem PI is rewritten as Minimize
(5.17a)
+(u)p(u) a d
subject to c(a) 5 p ( u ) (u E dp(v) = 0 (v E
a),
t),
P6+"
E P,'
pos-l' E P; 130
(5.17b)
(5.17~)
(v E
ri),
(5.17d)
(v E
P).
(5.17e)
5.2. THE EQUIVALENCE OF THE NEOFLOW PROBLEMS We can easily see that for each v E V there exist distributive lattices 0,' C. 26+u and Du26-u and submodular functions f;: D', -+ R and fu-: 0,- -+R such that 8 E D,S n D;, f$(8) = f i ( 0 ) = 0 and
p,'
= P(f,+),
P,- = P ( f i ) .
(5.18)
Therefore, the independent flow problem is reduced to a polymatroidal flow problem (see Fig. 5.2).
S-
S+
S-
Figure 5.2.
(c)
From polymatroidal flows to submodular flows
Consider the polymatroidal flow problem Pp defined by (5.3). From the underlying graph G = ( V , A ) we construct a graph G' = ( W , A ) with the same arc set, where the vertex set W is given by
W = {w:
I a E A } U {w, I a E A }
(5.19)
and we define d+a = w: and d - a = w, for each a E A in G' (see Fig. 5 . 3 ) . Each arc of G' forms a connected component of G'. Define an upper capacity 131
111. NEOFLOWS function Z': A + R U ( $ 0 0 ) and a lower capacity function c': A + R U { +m} by ~ ' ( a=) +00 (a E A), .'(a) = ~ ( a )( a E A ) . (5.20) Also define
w,'= {w; I a E 6 + U } w, = {w; I a E 6 - u }
(5.21) (5.22)
where 6+ and 6- are with respect to G. Under the natural correspondences between W,,+ and 6+u and between Wv- and 6 - u for each v E V we regard P(fV+)and P(f;) as polyhedra in RwZ and RW;, respectively.
U
G
G' Figure 5.3. Define for each u E V
and let B
C RW be the direct sum of B, B=$ VEV
132
(u E V ) :
B,.
(5.24)
5.3. FEASIBILITY FOR SUBMODULAR FLOWS Then, the polymatroidal flow problem is rewritten as Minimize
(5.25a)
$u)cp(a) aEA
subject to ~ ' ( a5) p(a) 5 i?(u) acpE B.
(u E A),
(5.25b) (5.25~)
Note that y E B, if and only if (5.26) (5.27)
Y ( W 3 + Y(WJ
= 0,
(5.28)
26+u and D; 5 26-". The system of (5.26)-(5.28) is where we regard D Z equivalent to that of (5.26), (5.28) and
For each v E V let 3, be the crossing family defined by
7, = ',D u D, u {W,+u W l } , where
= {W: U (W; - X)
I X E D;},
(5.30)
and let f,: 3, + R be defined by
Then, f,, is a crossing-submodular function on the crossing family 3, and we have B, = B(f,), a base polyhedron. Therefore, it follows from (5.24) and (5.25) that the polymatroidal flow problem P p is reduced to a submodular flow problem. It is interesting to see again that the polymatroidal flow problem looks like a very special case of the submodular flow problem.
5.3. Feasibility for Submodular Flows
In the previous section we have shown the equivalence of the submodular flow problem, the independent flow problem and the polymatroidal flow problem. 133
111. NEOFLOWS Since the submodular flow problem is simple to describe, let us consider as a neoflow problem the submodular flow problem
Ps: Minimize
(5.la)
q(a)p(a) aEA
subject to :(a)
5 p ( a ) 5 C(a) ( a A ) ,
aP E B ( f ) .
(5.lb) (5.1~)
Due t o Theorem 2.5 we assume for simplicity that f is a submodular function on a distributive lattice D C 2v with 0, V E D and f(0) = f(V)= 0. Recall (2.65), where we have shown
~ ~ -2"7 :+ R U ( $ 0 0 ) is the cut function associated with the network ( G = ( V , A ) , c , C )and 8@ is the base polyhedron associated with the cut function I C , , ~ . Hence, there exists a feasible flow 'p for the submodular flow problem if and only if
Here,
U
=
i.e., there exists a common base in B(K~,:) and B(f). From Theorem 4.13 we have
Theorem 5.1 [Frank84]: There exists a feasible Aow for the submodular flow problem Ps satisfying (5.lb) and ( 5 . 1 ~ if ) and only if
vx E D : or
YX E
(KC.E)#(X)5
f( X )
D: C ( A - X ) - c ( A + X ) + f ( X ) 2 0 ,
(5.34)
(5.35)
where for each X C V A + X = { a I a E A , d+a E X , 8 - a E V - X } and A - X = { a I u E A , d - a E X , d+a E V - X } . Moreover, if C, c and f are integer-valued and P.T is feasible, there exists an integral feasible Aow. (Proof) Immediate from Theorem 4.13.
Q.E.D.
A feasible flow for the submodular flow problem can be obtained by the use of the algorithm shown in Section 4.3. 134
5.3. FEASIBILITY FOR SUBMODULAR FLOWS Frank [Frank841 showed feasibility theorems for the cases where f is an intersecting-submodular function and where f is a crossing-submodular function. We can give Frank’s result by combining Theorems 5.1 and 2.6. That is,
Corollary 5.2 [Frank84]: (i) When f is an intersecting-submodular function on an intersecting family 3 such that 0,V E 3 and f(0) = f ( V ) = 0, the submodular flow problem Ps described by (5.1) has a feasible Aow if and only if we have (5.36) for each X
CV
and disjoint X , E 3 (i E I ) such that X = UiErX i .
(ii) When f is a crossing-submodular function on a crossing family 3 such that O,V E 3 and f ( 0 ) = f(V)= 0, the submodular Aow problem PS has a feasible flow if and only if we have (5.37) for each X C V , codisjoint X i C V (i E I ) and disjoint Xij ( j E J ; ) (for each i E I ) such that X = X ; and X ; = UjEJiXij (i E I ) . Note that (ii) of Corollary 5.2 is also expressed in a dual form as follows: Problem PS has a feasible flow if and only if (5.37) holds for each X C V , disjoint X ; C V (i E I ) and codisjoint X ; j ( j E Ji) (for each i E I ) such that X = UiEIXi and X i = X ; j (i E I ) (see the remarks after Theorem 2.6). Since the description of the algorithm for the common base problem given in Section 4.3 depends on the base polyhedron B(f) but not on the submodular function f or the system of linear inequalities expressing B(f), the algorithm also works even if f is a crossing-submodular function on a crossing family, provided that an initial base in B(f) and an oracle for exchange capacities are available. For such an f , however, finding a base in B(f) together with determining the nonemptiness of B(f) is itself a nontrivial problem. For a fixed element e E E l define families 31 = { X I e 4 X E 3} U { V } , 32 = {X I e E X E 3 ) U (0) and = { E - X I X E 32)’ and let f l and f 2 , respectively, be restrictions o f f to 31and 32.Then, 31and are intersecting families and f l and are, respectively, an intersecting-submodular function and an intersecting-supermodular function. Since B ( f ) = B(f1) n B(f2) = B(fl) n B ( f f ) , a vector in B (f) is a common base in base polyhedra B(f1) and B ( f f ) , if both B(f1) and B ( f f ) are nonempty. Since P(f1) (or P(f2#)) is a
njEJi
f2#
135
111. NEOFLOWS submodular (or supermodular) polyhedron, we can find a maximal (or minimal) vector in P(f1) (or P ( f f ) ) by adapting greedy algorithm I1 in Section 3.2.b. A vector in B ( f ) , if any exists, is thus found by the algorithm for a common base problem (see [Frank84], [Fuji87b]). A more direct algorithm is given by [Frank Tardos881 (also see [Naitoh Fuji891) as a bi-truncation algorithm.
+
+
5.4. Optimality for Submodular Flows Consider the submodular flow problem Ps described by (5.1), where ( 0 , f ) is a submodular system on V with f ( V ) = 0. We show the following optimality theorem.
Theorem 5.3: A submodular Aow p: A -+ R for Problem Ps is optimal if and only if there exists a function p: V + R such that, defining rP: A -+ R bY 7*(4 = 7 b )
+ p(d+a) - p ( d - 4
(a E A),
(5.38)
we have for each a E A (5.39) (5.40) and such that the boundary dp: V + R is a maximum-weight base of B(f) with respect to the weight function p. (Proof) The “if” part: By an elementary calculation we have
The “if” part immediately follows from (5.41). We postpone the proof of the “only if” part. Q.E.D.
To prove the “only if” part of Theorem 5.3 we need some preliminaries. Any function p: V + R is called a potential. A potential p satisfying the conditions of Theorem 5.3 is called an optimal potential. Given a submodular flow p, we define the auxiliary network N, = (G, = (V,A , ) , c,, 7,), where G, is the graph with vertex set V and arc set A , given by (5.42) (5.43) A: = { a I a E A , p(a) < Z ( U ) } , B” = {Ti I a E A , c(a) < p(a)} (a: a reorientation of a ) , (5.44) (5.45) c, = { (v) u , v E v,11 E dep(dcp,v) -
A,,, = A ; U B; U C,,
,
w},
I
136
5.4. OPTIMALITY FOR SUBMODULAR FLOWS
c,: A , -+ R is the capacity function given by
-c(a)- d a )
( a E A;) p ( h ) - ~ ( h ) ( a E B;, h(E A ) : a reorientation of a) Z(dP,V,'LL) ( a = (v) E C,),
(5.46)
and 7,:A , + R is the length function given by
h(E A ) : a reorientation of a ) ( a = (u,v) E C,).
(5.47)
We call the graph Gap = (V,C,) the exchangeability graph associated with the base dp of B(f). Also, we call a directed cycle of negative length a negative cycle.
Lemma 5.4: Let p be an optimal submodular Aow for Problem Ps. Then there exists nonegative cycle, relative to the length function y,, in the auxiliary network N,. (Proof) Suppose, on the contrary, that there exists a negative cycle in N,. Let Q be a negative cycle having the smallest number of arcs in 1, and let the arcs in C, lying on Q be given by ( u i , v ; ) (i E I). We show that by an appropriate numbering of arcs (u;,vi)(i E I) the assumption of Lemma 4.5 is satisfied. Suppose, on the contrary, that the assumption of Lemma 4.5 cannot be satisfied by any numbering of arcs ( u ; , v,) (i E I ) , i.e., there are arcs ( u i k , v i k )(k = 1,2,...,p) such that i k E I (k = 1,2,...,p) and (u;,,v;,+,) E C, (k = 1,2,...,p) with i,+l = il. Then for each k = 1,2,.-.,plet Qk be the directed cycle formed by arc ( U ~ ~ , V ; ~ and the path in Q from v;,+~ to uik (see Fig. 5.4). Since y,((uik,vik)) = y , ( ( ~ i ~ , v i ~= + ~0 )(k ) = 1 , 2 , . . . , p ) , we see that I'
%(Qk)
= (P - qhp(Q)
<0
(5.48)
k=l
for some integer q such that 1 5 q < p , where y,(&k) and y , ( Q ) are the lengths of Qk and Q relative to the length function 7., It follows from (5.48) that there is at least one Qk (k = 1,2,. . . , p ) having a negative length and such a directed cycle Qk has a smaller number of arcs than Q . This contradicts the definition of Q , so that by an appropriate numbering of arcs ( u i , v;) (i E I ) the assumption of Lemma 4.5 is satisfied. Define (5.49) a = min{c,(a) I a lies on Q} 137
+ ~ )
111. NEOFLOWS
Figure 5.4. and modify the flow p as
+
~ ( a )Q - a:
(a E A; (‘si E l3;
n Ap(Q)) n A,(Q), ‘si: a reorientation of a )
(5.50)
(0therw ise)
for each a E A, where A , ( Q ) denotes the set of arcs lying on Q . Then p’ is a submodular flow due to Lemma 4.5 and
aEA
aEA
aEA
This contradicts the assumption that p is an optimal submodular flow. ConQ.E.D. sequently, there is no negative cycle in N,. The proof technique concerning (5.48) was originated by the author [Fuji 77a, 77b] for matroids and may be interesting in its own right (also see [Zimmermann821. Now, we show the “only if” part of Theorem 5.3. (Proof of the “only if” part of Theorem 5.3) Let p be an optimal submodular flow for Problem Ps. Then, from Lemma 5.4 there exists no negative cycle in 138
5.4. OPTIMALITY FOR SUBMODULAR FLOWS
the auxiliary network 4, relative to the length function 7,. This implies that there exists a potential p: V + R such that (5.52) for each a E A > . (Such a potential p can be found by a shortest path computation from a fixed origin s outside N,, where the origin s is connected with each vertex of V by a new arc of any finite length, say, zero.) We can easily see that (5.52) for a E A; u implies (5.39) and (5.40) and that (5.52) for a E C, implies P ( 4 2 P(4 .( E dep(&V) - {.I). (5.53)
~ ( f ) ) is a maximum-weight base of B(f) From (5.53) and Theorem 3.16 d p ( B with respect to the weight function p. Q.E.D. It should be emphasized here that Theorem 5.3 is independent of how the base polyhedron B ( f ) is represented by a system of linear inequalities. The proof of Lemma 5.4 suggests an algorithm for solving the submodular flow problem Ps as follows: Starting from an arbitrary submodular flow p, (i) find a negative cycle Q having the smallest number of arcs in the auxiliary network I,, (ii) modify the present flow p along the negative cycle Q as in (5.49) and (5.50), where if a = +m, the problem is unbounded, and (iii) repeat this process until there is no negative cycle in N,. This is the primal algorithm given in [Fuji78a] and [Zimmermann82] (also see [Cui Fuji881). When C, c, f and an initial p are integer-valued, this algorithm terminates after a finite number of steps and finds an integer-valued optimal submodular flow if any optimal one exists. We shall discuss more efficient algorithms in the next section. A necessary and sufficient condition for the existence of an optimal submodular flow is given as follows.
+
= Theorem 5 . 5 : For the submodular flow problem Ps define a network ( G = ( V , q ) , where 6 is a graph with vertex set V and arc set 2 given by
a), A = A* U B* U C ,
A* = { a I a 6 A , E(a) = +m}, B" = {a 1 a E A , ~ ( a=) -m} ( E : a reorientation of a ) ,
c = { ( u , v ) I u , v , E v,vx E D: (v E x =+ 139
uEX)}
(5.54) (5.55) (5.56) (5.57)
111. NEOFLOWS and fi: 2 -+ R is the length function defined by
Z(E A ) : a reorientation of u) (u E
’
(5.58)
C).
Suppose that there exists a submodular flow for Problem Ps. Then, there exists an optimal submodular flow for Problem Ps if and only if there is no negative cycle in relative to the length function fi.
fi
(Proof) The “if” part: Suppose that there is no negative cycle in -+ R such that for each B E
A
fi. Then there is a potential p : V fip(B) where
k relative to
= +(a) + p(d+B) - p ( 8 - B ) 2 0,
and d - are with respect to
&.
(5.59)
(5.59) implies
A , Z(U)= +&),
?(a) t p(d+t) - p ( a - t )
20
(U E
7 ( u ) t p(a+a) - p ( a - a )
50
( a E A , e(a) = -m),
P(4 2 P ( 4 ((w) E C).
(5.60) (5.61) (5.62)
Since (5.1~)is expressed as (5.63) (5.64) where (5.64) is void, and since
dP(X) = P(A+X) - cp(A-x),
(5.65)
) replaced by (5.63) the linear-programming dual of Problem Ps with ( 5 . 1 ~being is described as
140
5.4. OPTIMALITY FOR SUBMODULAR FLOWS
5
where [, A t R , v: D t R and we should regard (5.66a) as the objective function with the terms ( ( a ) c ( a )( a E A , c ( a ) = -00) and T ( a ) Z ( a ) ( a E A , Z(a) = +00) being suppressed. Because of (5.62) there is a minimal chain
c: 0 = s, c s1 c . * . c s,
=v
(5.67)
of D such that p is constant on each quotient Sk - s k - 1 (k = 1,2,. this chain C and the potential p , define v(sk) =Pk-Pk+l
- - ,n). Using
(k=1,2,*",n-l),
(5.68)
where p k is the value of p taken in s k - S k - 1 and note that define v ( X ) = 0 for other X E D. Moreover, define
v(&) > 0.
+ p(a+a) - p ( 8 - a ) ( a E A , Z(a) = ((4= -7b) - P P + a ) + p ( a - a) ( a E A , S(U) = - w ) ,
( ( a ) = $a) -
$00)~
Also
(5.69) (5.70)
arc a E A with ?(a) < +00 and c ( a ) > -00 define ( ( a ) and ( ( a ) such that ( ( a ) , ?(a) 2 0 and (5.66b) holds. We can easily see that thus defined [, 7, 9 satisfy (5.66b)-(5.66e), where note that for each arc a E A with Z(a7 = $00 and c(a) = -00 we have 7(a) p ( a + a ) - p ( a - a ) = 0 due t o (5.60) and (5.61). Since the dual of Problem Ps has a feasible solution and the feasibility of the primal problem Ps is assumed, ther,e exists an optimal solution of Problem
-and for each
+
Ps . The "only if" part: Suppose that there is a negative cycle in k relative to the length function 9 , and let Q be such a negative cycle in k . Then for any positive a,if we define p': A -+ R by (5.50), p' is feasible for Problem Ps because of the definition of fi and we have (5.51). Since a! (> 0) is arbitrary Q.E.D. and rP(Q)< 0, Problem Ps is unbounded. We also have
Theorem 5.6 [Edm+Giles77]: The system of linear inequalities (5.71)
aP(x)(=LP(A+X)
-
P(A-x)) 5 f ( X ) (X E
D)
(5.72)
for the submodular flow problem Ps is totally dual integral. (Proof) Consider a submodular flow problem P_s such that the coefficients ~ ( a ( )A E A ) of the objective function are integers and that there exists an 141
111. NEOFLOWS optimal submodular flow p. From the proof of the “only if” part of Theorem 5.3 there exists an integral potential p : V -+ Z such that for each a E A
Pb) I P(4. Let pl
> pa >
+
*
(5.75)
> pl be the distinct values of p ( u ) (u E V ) and define
W; = { u I u E
v,p ( u ) 2 pi)
(2
= 1,2,-,1).
(5.76)
From (5.75) we have
For the dual problem Ps* in (5.66) of
Ps define
t ( a ) = max{o,rp(a)) -
(a E A),
t(4 = max{O, -rp(a))
(a E A), (i = 1 , 2 , * * , I - l ) ,
Q(W;)= p; - p i t 1 q ( X ) = 0 for other X E D. We can easily see that these (, from (5.73), (5.74) and (5.76),-
aEA
7 and Q
-
satisfy (5.66b)-(5.66e).
(5.78) (5.79) (5.80) (5.81) Moreover,
XED
aEA 1-1
aEA
i=l 1-1
aEA
i= 1 1
aEA
i=l
aEA
UEV
(5.82) 142
5.4. OPTIMALITY FOR SUBMODULAR FLOWS
where Wo = 0, we put 0 x ( f o o ) = 0, and note that dp(W1) = d p ( V ) = 0. Therefore, (, 7 and 7 defined by (5.78)-(5.81) form an integral optimal solution Q.E.D. of the dualproblem Ps * . It follows from Theorems 5.6 and 2.6 that if we replace f in (5.72) by a crossing-submodular function on a crossing family, the system of (5.71) and (5.72) is totally dual integral.
Corollary 5.7 [Edm+Giles77]: For a crossing-submodular function f on a crossing family 3 2 2 v , the system of inequalities
is totally dual integral. The proof of Theorem 5.6 shows the way of constructing an optimal dual solution [, 7 and 7 from an optimal potential p when f is a submodular function on the distributive lattice D. When f is a crossing-submodular function on a crossing family 3 C 2v with 0, V E 3 and f(0) = f(V)= 0, suppose that B ( f ) = B(f2) for a submodular system (P,f2) (see Theorem 2.6) and that we are given an optimal submodular flow p and an optimal potential p . Also suppose that for each W; in (5.77) we have the expression of fZ(W;) in terms of f as follows (see Theorem 2.6).
where V - ( U k E K Xi .; j k ) ( j E J;) form a partition of V - Wi for each i = 1 , 2 , - - - , 1- 1 and k;jk (k E Kij) are disjoint sets (as subsets of in 3 for each i = 1,2,-.’,1- 1 and j E J;. Here, note that f i ( V ) = 0. Then define for each X E 3
v)
v ( X )= C { p ; - p ; + l
I
X = Xijk, i E {l,*-.,l-l}, j
E J;, k E K i j } , (5.86)
where the summation over the empty set is equal to zero. (Note that if all the X i j k are distinct, we have v ( X ; j k ) = p i - p ; + l (i E {1,..-,1- l}, j E J;, k E Kij) and v ( X ) = 0 for other X E 3.) E , 2 defined by (5.78) and (5.79) and this v form an optimal dual solution, since (5.82) with D replaced by 3 holds. We show the way of finding an expression in (5.85) for each i = 1, 2, . . . , 1 - 1. Put x = 8p and define
3(.)
=
{ X I X E 3, .(X) = f(X)}. 143
(5.87)
111. NEOFLOWS We assume an oracle which, for each ordered pair ( u , v ) of distinct vertices u , v E V , gives a u-’u cut X E 3(z) or answers that there is no u-v cut X E 3(z), where a u-v cut is a set X C V such that u E X and v 4 X . Let G = (V,A ( z ) ) be the exchangeability graph associated with z, i.e.,
where note that ( v , u ) E A ( z ) if and only if u # v and there is no u-v cut X E ?(z). Choose any Wi (i = 1,2, - .. , 1 - 1). Let Gi be the graph obtained from G by deleting all the vertices in W; together with the arcs incident to W i , and let U;j ( j E Ji) be the vertex sets of the connected components of G;. Note that A+Uij = 0 ( j E J i ) (5.89) in G, so that
fz(V
-
Uij)= z ( V - Uij) ( j E Ja).
(5.90)
Therefore, for each u E V - Uij and v E Uij there exists a u-v cut X E 7 ( s ) . If X n Uij # 0, choose v’ E X n Uij such that for-some w E U,j - X we have ( v ’ , w ) E A ( z ) . Such a v’ exists since Uij - X # 0 and U i j is the vertex set of a connected component of G ; . There exists a u-v’ cut X’ E ?(z) and either X and X’ cross or X’ C X , due to the way of choosing v’. (Note that u E X n X ’ , v’ E X - X’ and w 4 X U X’.) Since 3(2) is a crossing family, we have X n X’ E 3(z) and u E X n X’ c X . Put X t X n X‘. If X n U;j # 0 , then repeat this process until we have X n U,j = 0. After repeating this process at most lUijl times we have X E 3(z) such that u E X C: V - U i j . Denote this X by X u . In this way, for each u E V - Uij we can find X u such that u E X u L V - Uij. Consider the hypergraph H = (V - U i j , { X u I u E V - Uij}) and let Xijk ( k E K;j) be the vertex sets of the connected components of H . Since 3(z) is a crossing family of subsets of V , we have Xijk E 3(2) ( k &). Consequently,
(5.91)
since z ( V ) = 0 . When f is an intersecting-submodular function on an intersecting family 3C - 2” with 0, V E 3 and f(0) = f ( V ) = 0 , for each u E W; we can find X,, E 3(2) such that u E X,, & W;. (Note that for any v , v’ E V - Wi there exist a u-v cut X E 3(z) and a u-v’cut X‘ E 3(2) and that u E X n X ‘ E 3(z) 144
5.4. OPTIMALITY FOR SUBMODULAR FLOWS since 3(2)is an intersecting family.) Let X;, ( j E J;) be the vertex sets of the connected components of the hypergraph H = (W;,{Xu I u E W;}).Then Xij E 3(s) and we have (5.92) j E Ji
where f1 is the submodular function appearing in (i) of Theorem 2.6. Let G = ( V , A ) be a connected (directed) graph. In Section 3.3.b we considered strongly k-connected reorientations of G for a positive integer k. For the crossing-submodular function ~ ( ~ 2” 1 : t R defined by (3.105), the problem of finding a minimum-cost strongly k-connected reorientation ’p: A + ( 0 , l ) is described in a relaxed form as
P(”):Minimize
(5.93a)
7(u)’p(u) aEA
subject to 0 5 p(u)
I1
(u E A ) , I “ @ ) ( U ) (U V ) ,
c
(5.93b) (5.93c)
where 7: A --f R is a cost function and p: A + R is not restricted to integral vectors. Due to Corollary 5.7 the polyhedron of feasible flows ‘p is integral and there exists an integral optimal solution, if any optimal solution exists, which is a minimum-cost strongly k-connected reorientation of G. Problem (5.93) is a typical example of the submodular flow problem (see [Frank80,8lc]). Note that Problem (5.93) with k = 1 has a feasible flow if and only if G is connected and has no bridge. For a connected graph G = ( V , A ) let D(G) be the set of all the ideals of G, i.e., (5.94) D(G)= {W I W & V , A+W = 0).
For each W E D(G)- { S , V ) we call A - W ( # 0) a directed cut. A subset B of arc set A is called a directed-cut covering of G if B has nonempty intersection with each directed cut of G. C. L. Lucchesi and D. H. Younger [Lucchesi + Younger781 consider the problem of finding a minimum directed-cut covering, which is formulated in a relaxed form as
DCC: Minimize
p(u)
(5.95a)
aEA
subject to 0 5 p ( u ) I 1 (u E A ) , ~(P(W I )“ ( l ) ( W ) (W E D(G)),
(5.9513) (5.95c)
where ~ ( lis) defined by (3.105) with k = 1. It should be noted that K ( ’ ) is a crossing-submodular function on D (G). The linear-programming dual of DCC 145
111. NEOFLOWS is given by
DCC*:Maximize
c
E(u) -
-
v(W)n(’)(W)
(5.96a)
WED(G)
aEA
subject to - ( ( u )
+ c { v ( W )I W E D(G),u E A-W}
51
(u E A ) ,
(5.96b)
E,
rl
2 0.
(5.96~)
Therefore, Problem DC C* becomes Maximize
c
min(0, [l-
aEA
+
c
c { v ( W ) I W E D(G),u E A-W}]} rl(W
W E D ( G )- (@?V}
subject to 7 2 0.
(5.97a) (5.97b)
We see from (5.95)-(5.97) and Corollary 5.7 that there exists an integral optimal solution 77 of dual DCC* such that (1) v ( W ) E {0,1} (W E D(G)- { 0 , V } ) and (2) directed cuts A-W with v ( W ) = 1 are disjoint. Consequently, we have the following theorem.
Theorem 5.8 [Lucchesi+Younger78]: The minimum cardinality of a directedc u t covering of G is equal to the maximum cardinality of a set of disjoint directed cuts of G. 5.5. Algorithms for Neoflows We consider maximum neoflow and minimum-cost neoflow problems and show algorithms for these problems.
(a) Maximum independent flows The maximum flow problem for neoflows seems to be easily formulated by the independent flow problem. The man’mum independent flow problem is:
P M I :Maximize ap(S+) subject to ~ ( u 5) p ( u ) 5 C(U) ( a E A ) , ap(v) = 0 ( v E v - (S+ u s-)),
( a d s +E P ( f + ) , - (spy- E W - ) , 146
(5.98a) (5.98b) (5.98~) (5.98d) (5.98e)
5.5. ALGORITHMS FOR NEOFLOWS where we consider the same network described in Section 5.1.b. We denote (d’p)” and - ( d ~ ) ~by- d + p and d-p, respectively, in the following. We suppose there exists a feasible flow. A feasible flow, if any exists, can be found by adapting the algorithm in Section 4.3 as discussed in Section 5.3 for submodular flows. Given a feasible flow (o, we define an auxiliary network N, = (G, = (V U { s ~ , s - } , A , ) , c , , s + , s - ) with source s+ and sink s- as follows. G, is the underlying graph with vertex set V U {s+,s-} and arc set A, defined by
A , = S; US;
u ~ ufA;
S$ = { ( s + , v )
S; = { ( v , s - )
UA; u B;,
(5.99)
I v E S+ - sat+(d+(o)}, I v E S- - sat-(d-’p)},
(5.100) (5.101)
Af = { ( u , v ) I v E sat+(d+(o), u E dep+(a+(o,v) - { v } } , (5.102) A; = { ( v , u ) I v E sat-(d-(o), u E dep-(d-p,v)
-
{v}},
A; = { u I u E A, p(a) < Z ( u ) } , B:, = {z I a E A, ( o ( 4 > c(4h
(5.103) (5.104) (5.105)
where ii denotes a reorientation of a, sat’ (sat-) is the saturation function with respect to ( P + , f + ) ((P-,f-)) and dep+ (dep-) is the dependence function with respect to (P+,f+)((P-,f-)).Also, c,: A, -+ R is defined by
C,(4
=
I
c*+(d+p,v) 2- (a-p, v )
( u = (s+,v) E SL)
E+(d+p, v , u )
(U = ( u , v )
E-(a-p,v,u)
(u = ( v , u ) E A;)
Z(4 - P ( 4
( a E A;) ( u E BG, E ( E A ) : a reorientation of a ) ,
(o@)
- c(Z)
( u = ( v , s-) E )S ;
E A:)
(5.106)
where 2+ (or c*-) denotes the saturation capacity associated with (D+,f+) (or (P-,f-)) and E+ (or c“-) the exchange capacity associated with ( P + , f + ) (or
(D-,f-)). We suppose that a feasible flow (an independent flow) ‘p is given. An algorithm for finding a maximum independent flow is furnished as follows (cf. [Fuji78a], [Lawler + Martel82a1, [Schonsleben80]). We assume oracles for saturation capacities and exchange capacities. A n algorithm for finding a m a x i m u m independent flow I n p u t : an independent flow p in network N = (G = ( V , A ; S + , S - ) , c , F , (P+,f+),(P-,f-))and a fixed numbering 71: V + {1,2,...,IVI}. 147
111. NEOFLOWS
Output: a maximum independent flow p in N . Step 1: While there exists a directed path from S+ to s- in the auxiliary network N, = (G, = (V u {s+, s-}, A , ) , cv, s+, s-), do the following. (*) Find a lexicographically shortest path P from s+ to s- in N, and put (Y
+ min(c,(a)
I a:
an arc lying on P } ,
(5.107) (5.108)
a ( € A ) : a reorientation of E ) .
In this algorithm a lexicographically shortest path from s+ to s- in N p is a directed path from s+ to s- in N, which has the minimum number of arcs among directed paths from s+ to s- in A, and whose vertex sequence (s+, v 1 , ,vp, s-), say, gives the lexicographically minimum sequence ( ~ ( v l )-,.. ,7r(vp)) among directed paths from s+ to s- in N, having the minimum number of arcs. Also, A , ( P ) is the set of arcs, in A,, lying on P . The validity of the above algorithm can be shown almost in the same manner as in the proof of the validity of the algorithm for the intersection problem in Sections 4.1.b and 4.l.c. The algorithm described above finds a maximum independent flow after repeating (*) a t most IV times. The maximum independent flow problem naturally includes the intersection problem, where the underlying graph is the bipartite graph representing the bijection between S+ and S - . e
+
-
l3
Theorem 5.9 (The maximum-independent-flow minimum-cut theorem) (cf. [McDiarmid75], (Fuji78al): Suppose that the maximum independent Aow problem PMI has a feasible Aow. Then we have max{8p(S+) I p is an independent flow (satisfying (5.98b)-(5.98e))} = min{f+(S+ - U ) +Z(A+U) - c ( A - U ) f-(S- n U ) I U C V } , (5.109)
+
where A + and A- are with respect to G and we regard f+(X) = +co (f-(Y) = +a)if X 4 D+ (Y $ P-). Moreover, if c, c, f + and f - are integer-valued and Problem P M I is feasible, then there exits an integral maximum independent Aow for Problem PMI.
(Proof) Let p* be a maximum independent flow for Problem P M ~and , consider .Nv* associated with p*. Let U* be the set of vertices the auxiliary network 148
5.5. ALGORITHMS FOR NEOFLOWS
in V which are reachable by directed paths from s+ in the auxiliary network .Alp*.Then we have (5.110) S+ - U* c sat+(d+p*), S-
n U* g sat-(d-p*)
(5.111)
since there is no directed path from s+ to s- in .Alp*. Hence, by the definition of u*, (5.112) dep+(d+p*,v) g S+ - U* (v E S+ - U * ) , dep-(d-cp*,v) C S-
n U*
(v E S-
nU*),
(5.113)
(aE A+U*),
(5.114)
p*(a)= ~ ( a ) ( a E A - U * ) .
(5.115)
p*(a)= E(a)
From (5.112) and (5.113),
a+p*(S+ - U * ) = f+ (S+ - U * ),
(5.116)
a - p * ( ~n- u*)= f-(S- n U * )
(5.117)
due to Lemma 2.1. From (5.114) and (5.115),
p*(A+U*) = E(A+U*), p*(A-U*) = c ( A - U * ) .
(5.118)
It follows from (5.116)-(5.118) that
+
+
dp*(S+)= a+p*(S+- U * ) p*(A+U*) - p*(A-U*) a-p*(S- n U * ) = f+(S' - U') + C ( A + U * ) - c ( A - U * ) f-(S- n U*). (5.119)
+
On the other hand, for any independent flow p and any subset U of V we have
(5.109) follows from (5.119) and (5.120). Moreover, if ?, c, f+ and f- are integer-valued and Problem P M is ~ feasible, then there exists an integral feasible flow due to Theorem 5.1. Starting with an integral feasible flow, the algorithm finds an integral maximum independent Q.E.D. flow in finitely many steps.
+ +
We call any U V a cut and the value f+(S+- U )+?(A+U) - s ( A - U ) f-(S- n U ) the capacity of the cut U . Theorem 5.9 is a generalization of the classical max-flow min-cut theorem for ordinary capacitated networks [Ford Fulkerson621. 149
111. NEOFLOWS Theorem 5.9 (for polymatroids) was shown non-algorithmically by McDiarmid [McDiarmid75] and algorithmically by the author [Fuji78a]. Now, consider a supermodular system (D+, )'9 on S+ instead of submodular system (D+,f + ) and also consider the following system of inequalities.
a t p ( ~= )
o
(V
E
(ad"'
v - (s+n S - ) ) , P(S++),
E
-(ads-
(5.122) (5.123) (5.124)
E p(f-1,
where P(g+) is the supermodular polyhedron associated with we have the following theorem.
(D+,g+).
Then
Theorem 5.10: There exists a feasible flow p satisfying (5.121) - (5.124) if and only if we have for each U C V such that S+ n U E D+ and S- fl U E D-
g+(s+n u) - f-(S-
n U ) I c(A+U) - c(A-u)
and for each U C V such that S+ U S0
(5.125)
CU
5 C ( A + U )- c ( A - U ) .
(5.126)
Moreover, if there exists a feasible flow and C , c, g+ and f - are integer-valued, then there exists an integral feasible Aow. (Proof) Define
D & 2"
and g: D
D ={U I U CV, g(U)=
{;
+ S+
R by
-+
S+nUE
n U ) - f-(S- n U )
(
,'D
S-nU E (U E (U E
D-},
D, (S+ u S - ) D, S+ u S-
(5.127) -
U
U).
# 0) (5.128)
If there is a feasible flow, we must have
g+(S+)- f-(s-) L 0.
(5.129)
Also, (5.125) with U = V implies (5.129). Therefore, we assume (5.129). Due to (5.129), the function g: D -+ R defined by (5.128) is a supermodular function on the distributive lattice D with 0, V E D and g(0) = g(V) = 0. We have 3: E B(g) if and only if zs+ E
P(g+), -5s- E p ( f - ) , 150
,v-(s+Us-)
- 0,
(5.130)
5.5. ALGORITHMS FOR NEOFLOWS
.(V) = 0.
(5.131)
It follows from (2.65) and Theorem 4.13 that there exists a feasible flow satisfying (5.121)-(5.124) if and only if (5.132) We see that (5.132) is equivalent to (5.125) and (5.126), under condition (5.129). The integrality part of the present theorem follows from the counterpart Q.E.D. of Theorem 4.13. Theorem 5.10, where c = 0, Z 2 0, f - is a polymatroid rank function and g+ is the dual supermodular function of a polymatroid rank function, is shown in [Fuji78d]. The discrete separation theorem also follows from Theorem 5.10. The readers may deduce Theorem 5.10 from the feasibility theorem for submodular flows (Theorem 5.1).
(b) M a x i m u m s u b m o d u l a r flows For the submodular flow problem with the network J/s = (G = ( V , A ) , c , Z,7,(P,f)),disregarding the cost function 7 , let us consider a “ma-flow” problem PMS given as follows [Cunningham + Frank851. Let uo be a fixed reference arc in A .
P M S :Maximize p(u,-,)
(5.133a) (5.133b) (5.133~)
subject to ~ ( u5) p(a) 5 C(u) ( u E A ) , dP E B ( f ) .
We assume that there is a feasible flow in .Us and define the auxiliary network J/, = (G, = (V,A , ) , c,) associated with p as follows. G, is the graph with vertex set V and arc set A , defined by (5.42)-(5.45) except that
B*9 = { a I a E A and c,: A ,
-+
- {Q}, c ( u ) < p ( u ) }
(5:a reorientation of
u)
(5.134)
R is defined by (5.46).
An algorithm for finding a m a x i m u m s u b m o d u l a r flow I n p u t : a feasible flow p in J/s with reference arc Q and a vertex numbering 7r: V -t {1,2,. - ., IVl} which defines the lexicographic ordering among directed paths from d-a0 to d+ao in A’,. O u t p u t : a maximum submodular flow p in A’s with reference arc aa. 151
111. NEOFLOWS Step 1: While p(uo) < C(uo) and there exists a directed path from ~3-mto a+ao in the auxiliary network N,, do the following. (*) Find the lexicographically shortest path P from d-uo to d+ao in Np and let Q be the directed cycle formed by P and reference arc m.Put a! t
min{c,(a)
{ where if large). (End)
I a lies on Q},
+
~ ( a ) ( a E A; n A p ( Q ) ) p(a) - a! (E E B; n A,(Q), a: a reorientation of a E A),
a! =
+m, then stop (the flow value
cp(a0) can
be made arbitrarily
Here, A,(Q) is the set of the arcs in A , lying on Q and the lexicographically shortest path P is the directed path from d - m to d'ao in Np which has the minimum number of arcs among directed paths from a-ao to d+ao in Np and whose vertex sequence ( d - a o , v1, 'up, d+tao), say, gives the lexicographically minimum sequence ( m ( v l ) , .- ,m(vp)) among directed paths from d - m to d+ao in 1, having the minimum number of arcs. The algorithm terminates after repeating (*) O( IV 13) times. The analysis is by the same technique as shown in Section 4.l.c. a ,
Theorem 5.11: For the maximum submodular flow problem PMS described by (5.133), max{p(ao) I p is a feasible flow in 1 s ) = min{Z(ao), min{Z(A-X) - c ( A + X - {Q})
+ f ( X ) I X E D, uo E A+X}}.
(5.135)
Moreover, if c, Z and f are integer-valued and there exists a maximum submodular flow, then there exists an integral maximum submodular flow in Ns. (Proof) The maximum flow value is equal to the maximum value of c(u0) under the constraint that the network NS has a feasible flow, where c(ao) is regarded as a variable. Therefore, relation (5.135) is deduced from Theorem 5.1. The integrality property also follows from Theorem 5.1. Q.E.D. Theorem 5.11 can also be shown algorithmically. When the algorithm terminates with a maximum flow p* such that p*(ao) < Z ( a o ) , let U be the set of the vertices which are reachable by directed paths from a-ao in the then obtained N,.. From the assumption, %a,-, E U and d+ao $ U. Define W = V - U . It follows from the definition of N,* that p*(a) = Z ( a )
(u E
152
A-W),
(5.136)
5.5. ALGORITHMS FOR NEOFLOWS
cp*(a) = c(a) ( a E A+W - { a o } ) , dep(+*,v) G W
(. E W ) ,
(5.137) (5.138)
where A+ and A- are with respect to G. From (5.138) we have dP*( W ) = f ( W .
(5.139)
and from (5.136) and (5.137)
a'p*(W)=p*(ao) + c ( A + W
- {uo}) -E(A-W).
(5.140)
Combining (5.139) with (5.140), we get P*(Q) =C(A-W) -c(A+W - { a o } )
+ j(W).
On the other hand, we can easily see that for any feasible flow and any X E D with a0 E A + X , ~ ( a o5 ) C(A-x)
-
c(A+X
+f(X).
- {Q})
(5.141) 'p
in Ns
(5.142)
From (5.141) and (5.142) we have (5.135), where the case when p*(ao) = C(ao) is taken into account. Moreover, the integrality part of Theorem 5.11 follows from the fact that if Problem PMS is feasible and c, C and f are integer-valued, $here exists an integral feasible flow and, starting from such an integral feasible flow, we get an integral maximum submodular flow by the algorithm if a maximum submodular flow exists. When p*(ao) < E(ao),the above defined V (= V - W ) is called a minimum cut in Ns with reference arc ao. We can also consider the minimum submodular flow problem which is to minimize 'p(a0) subject to (5.133b) and (5.133~). Note that this problem is a maximum submodular flow problem when we consider the dual order <* among R. Hence an algorithm for the minimum submodular flow problem is given rnutatis rnutandis. ( c ) Minimum-cost submodular flows
As a minimum-cost flow problem for neoflows, consider the submodular flow problem P s , described by (5.1), in network Ns = (G = ( V , A ) , g , C , 7 ,
(D,f))* Ps: Minimize
7(a)p(a)
(5.la)
subject to c(u) 5 p( u) 5 C(u) ( a E A ) ,
(5.lb) (5.1~)
&A
aP E B ( f ) , 153
111. NEOFLOWS where ( 0 , f ) is a submodular system on V , the vertex set of the underlying graph G = (V,A ) . We suppose that Problem Ps has a feasible flow. We shall show an algorithm which tries to find a feasible flow p : A -+ R and a potential p : V -+ R satisfying the optimality condition of Theorem 5.3. Suppose that we are given a feasible flow p in Ns. Choose a potential p:V -+ R such that dp E B(f) is a maximum-weight base of B ( f ) with respect to the weight function p , i.e., p ( u ) 2 p ( v ) for each u , v E V with u E dep(dp,v) - { v } . For example, p = 0 (the zero function) satisfies this = (G, = (V,A , ) , c,, 7 , , p ) requirement. We define the auxiliary network as follows. G, is the graph with vertex set V and arc set A , defined by (5.42)-(5.45) and c , : A , -+ R is defined by (5.46). We define 7 , , p : A , + R by (5.143) 7,,p(a) = 7 , ( 4 + p(d+a> - p ( 8 - a ) ( a E A , ) , where 7 , is given by (5.47). Now, an algorithm based on Cunningham and Frank's [Cunningham Frank851 is given as follows. Also, compare it with an out-of-kilter method given in [Fuji87b].
+
An algorithm for finding an optimal submodular flow Input: a feasible flow p in Ns and a potential p : V -+ R such that p ( u ) 2 p ( v ) ( v E V , u E dep(dp,v) - { v } ) . Output: an optimal submodular flow p and an optimal potential p . Step 1: While y,,p(a) < 0 for some a E A , , choose an arc u0 E A , such that 7,,P(ao)< 0 and do (1-1) or (1-2) according as uo E A or a0 4 A : (1-1) If a' E A , then, while p(ao)< e(ao) and r p ( a O ) ( =7 ( a o )+ p ( d S a o ) p ( a - a o ) ) < 0, do the following: (*) Starting with p, find a maximum submodular flow po in the modified network N o = (G = ( V , A ) , ~ o , $ y ( D o , f owith ) ) the reference arc a', where the lower and upper capacity functions go, $ : A -+ R are defined by co(uo) = p(a') , $' (a') = i?(ao) and for each a E A - { a o }
(5.145) (where yP(a) = 7 ( a ) + p ( d + a )- p ( d - a ) with d+ and 8- being defined with respect to G) and, letting p l > p2 > > pt be the distinct values of p ( v ) (v E V ) and defining
---
154
5.5. ALGORITHMS FOR NEOFLOWS
so = 0,
(5.147)
( P O , f O ) is the submodular system given by the direct sum
(5.148) o f t h e s e t minors (P,f).Si/S,_l ( i = 1,2,.-.,t). If the maximum flow value is equal to +oo, then stop (Problem PS is unbounded). Otherwise put p t po. If po(ao)< i?(ao),then for the auxiliary network N$ associated with the current submodular flow poin N o let U be the set of the vertices which are reachable by directed paths from F a o in A:,, , define
I a E A-U, I a E A+U,
rP(a)< 0}, y P ( a )> O } ,
(5.149) (5.150) H2 = {a ( A + , A- in (5.149) and (5.150)are with respect to G.)
HI = { a
H3 = {(ti,.)
I
uE
U,
21
E V - U, u E dep(dcp,v) - { v } } ,
(5.151) (dep is with respect to (P,f).) p* = min{min{17P(a)I I a E H1 U H 2 } , min{p(u) - P ( 4
I
(u,u) E
Hd},
(5.152)
and put P(4
+
P ( 4 - P* .( E U ) .
(5.153)
(1-2)If a0 6 A, let $ E A be the reorientation of uo and, starting with p, find a minimum submodular flow po,with reference arc Z', in the modified network N o as defined in Step (1-1). Carry out Step (1-1) mutatis mutandis. (End) It should be noted that when we carry out (5.149)-(5.153), we have H1 U H2 U H3 # 0 since u0 E H I , and that p* in (5.152) is a finite positive number. For a feasible flow p and a potential p, if an arc a E A satisfies (i) +,(a) > 0 and c(a) < p(a) or (ii) 7p(a)< 0 and p(a) < i?(a),then arc a is said to be out of kilter and otherwise in kilter with respect to p and p. Denote the set of all the out-of-kilter arcs by Ao(p,p) and that of all the in-kilter arcs by A'(p,p). During the execution of the algorithm, (1) in-kilter arcs remain in kilter, (2) the value of 17p(~)l of each out-of-kilter arc a is monotone non-increasing, 155
111. NEOFLOWS (3) 17p(~0))l decreases every time the potential p is changed by (5.153) in Step (1-1) or (1-2), and (4) p is a submodular flow in NS and ap is a maximum-weight base of B(f) with respect to weight function p . Therefore, when the cost function 7 is integer-valued, the algorithm terminates I ~ ( u ) I maximum and minimum submodular-flow computaafter at most CaEA tions in Step (1-1) and Step (1-2) if we start with the initial potential p = 0. Moreover, for any real cost function 7 the algorithm also terminates after finitely many steps, as shown below. While the inner cycle (*) of Step (1-1) is repeated, potential p(a+ao) remains fixed and p ( d - a O ) is decreased by (5.153), where note that for each ( u , v ) E H3 we have p ( u ) > p ( v ) . Every time we change the potential p by (5.153), one of the following two cases occurs:
(i) at least one arc in HI U H2 becomes in kilter, (ii) the set of the vertices which are reachable from a-ao in the new auxiliary network N$ is augmented. Note that the total number of the occurrences of Case (i) is at most / A [and that Case (ii) occurs consecutively at most IVI - 1 times without increasing po(ao). While p(ao) < Z(ao) (when rp(a0)< 0), the potential difference p(a-ao) p ( d + a O )is decreased by (5.153) between the successive maximum submodular flow computations. Since the potential difference p ( d - a O )-p(a+ao) is equal to the length of a directed path from %ao to d+ao relative to the length function 7,, since the length of such a path relative to 7,,p is equal to zero. Since the number of distinct lengths, relative to length function 7 p , of elementary directed paths from a-ao to a+aO in any possible auxiliary networks is finite, p ( u o ) is increased only finitely many times. This argument can be applied to Step (1-2) mutatis mutandis. It follows that arc u0 becomes in kilter or we discern that Problem Ps is unbounded, after finitely many steps. If the algorithm terminates with p and p such that 7p,p(a) 2 0 for all a E A,, then the obtained 'p is an optimal submodular flow and p is an optimal potential due to Theorem 5.3. If the maximum flow value for the modified network N o in Step (1-1) is equal to +oo, then there exists a directed cycle Q, containing ao, in the auxiliary network N: = (GO, = (V,A,),c:) associated with the current p such that +(a) = +oo for any arc a in Q. By the definition of N o , Q is also a directed cycle in the auxiliary network N, = (G,,c,,7,) for the original submodular flow problem Ps and the length of Q relative to the length function 7, is negative. Moreover, p remains to be a (feasible) submodular flow if we change p along the directed cycle Q by an arbitrary positive amount of flow value. (Here, the condition in Lemma 4.5 for multiple exchanges is not required since +(a) = +oo for any arc a E C, in Q.) Consequently, Problem Ps is unbounded, i.e., the value of the objective function of Ps is made arbitrarily 156
5.5. ALGORITHMS FOR NEOFLOWS
small. Also, the same argument is valid mutatis mutandis for Step (1-2). Given an optimal submodular flow p and an optimal potential p , we can find an optimal dual solution of Ps by the procedure given in Section 5.4 when the base polyhedron is expressed in terms of a submodular function on a distributive lattice, or an intersecting- or crossing-submodular function on an intersecting or crossing family. When the cost function 7 is integer-valued and an oracle for exchange capacities is assumed, the above algorithm requires time polynomial in IVI, IA( and max{l7(a)I I a E A } , i.e., it is a pseudopolynomial algorithm. Applying the cost-scaling technique for the ordinary min-cost flows of Rock [Rock801 to submodular flows, we obtain a polynomial algorithm for the submodular flow problem ([Cunningham Frank85]), provided that an oracle for exchange capacities is available. Without loss of generality we assume c(a) > --oo for each a E A .
+
A cost-scaling algorithm
Input: a feasible flow p in .Ns, a potential p = 0 , and C s max{ I7(u) I I a E A } , where the cost function 7 is integer-valued and C > 0. Output: an optimal submodular flow p and an optimal potential p . Step 0: Discern whether Problem PS is unbounded. If it is unbounded, stop; otherwise put k t [log, Cl. Step 1: While k 2 0, do the following: (1-1) For each a E A put + ( a ) t [7(a)/2'1. (1-2) By the pseudopolynomial algorithm given above, starting from the current flow p and potential p , find an optimal submodular flow p* and an optimal potential p* in the network JS = (G = (V,A),g,i?,q,
(D,f))* (1-3) Put p
t
p*,p
t
2p*, and k
t
k - 1.
(End) Step 0 can be carried out by a shortest path computation based on Theorem 5.5. In Step (1-2) we have
for the current and p . Hence each Step (1-2) requires at most 21AI maximum and minimum submodular-flow computations. It follows that the costscaling algorithm requires O( IAl log, C ) maximum and minimum submodular 157
111. NEOFLOWS flow computations and that the algorithm runs in polynomial time if an oracle for exchange capacities is available. It should also be noted that, since in Step 1 we have (5.155) and since Problem Ps is bounded when we proceed to Step 1, the problem on network #s = (G = (V,A),c,Z,?, (D,f)) with approximated cost function is also bounded due to the assumption that c(a) > --oo ( a E A ) (recall Theorem 5.5). If we apply the cost-rounding and tree-projection technique of the author [Fuji861 (which is an improved version of Tardos’s algorithm [Tardos85]) for the ordinary minimum-cost flows, we can get a strongly polynomial algorithm for the submodular flow problem ([Fuji Rock Zimmermann89]). The first strongly polynomial algorithm for the submodular flow problem was given by Frank and Tardos [Frank Tardos851 by the use of the simultaneous approximation algorithm of [Lenstra Lenstra Lov&z82]. To give a strongly polynomial algorithm of [Fuji Rock Zimmermann891 we need a few preliminaries. For simplicity we assume that c and C take on only finite values, which guarantees the boundedness of Problem P s . For a cost function 7: A R and a positive real a,7’: A -+ R is called an a-approsirnation of 7 if [ ~ ’ ( a-) -y(a)l 5 a for all a E A . The following lemma is fundamental.
+
+
+
+
+
+
+
--f
Lemma 5.12: Let 7’ be an a-approximation o f 7 and p’ be an optimalpotential in N‘ = (G = ( V , A ) , c , Z , y ’ (P, , f)). Then there exists an optimal potential p in N = (G, c, Z, 7, (D,f ) ) such that we have for each u , v E V
(Proof) Without loss of generality we assume ~ ’ ( a 2) $a) for all a E A (by possible reorientations of arcs). If 7’ # 7 , let vo be a vertex in V such that 7‘(a) > ~ ( afor ) an arc a E 6-vo. Define (5.157) Starting from an optimal submodular flow p’ and an optimal potential p’ in W‘ = (G,s,Z,7’, (P,f ) ) , we apply a slightly modified version of the (nonscaling) algorithm for submodular flows to J? = (G,c,c,.j., (P, f ) ) . The modification consists only in postponing potential changings as long as possible, which does not affect the finiteness of the algorithm. 158
5.5. ALGORITHMS FOR NEOFLOWS
Note that initially for any out-of-kilter arc a E A we have
aE
(5.158)
6-21',
0 > + p l ( u ) 2 -a,
(5.159)
@ ( a ) < C(.).
(5.160)
In the original version of the algorithm an out-of-kilter arc a' E 6 - v o is chosen and @ ( a o ) is increased by solving a maximum submodular flow problem with reference arc uO, which is followed by a potential changing. In the modified version we repeatedly solve maximum submodular flow problems, each with an out-of-kilter arc a E 6-v' as a reference arc, without any potential changings. If there exists at least one out-of-kilter arc after this process, then let U be the set of the vertices reachable from v' in the current auxiliary network and change the potential p by (5.149)-(5.153). Repeat this process until all the out-of-kilter arcs become in kilter. (This is repeated finitely many times.) Let p be the resultant potential and let a' be one of the arcs which became in kilter at the last potential-changing. We can see from (5.159) that m={ I(P'(4 - P'b)) - (P(4 - P ( V N 5 m={ IP'(4 - P ( U ) I € v} I 1% (a') I 5 a,
I
I I
u , 21 E
v} (5.161)
where note that 0 5 p'(u) - p ( u ) for all u E V due to (5.153). Putting p' t p and 7' +- .^y and repeating the above argument for other vertices, we see that the total change of any potential difference is bounded by QlVI. Q.E.D. From this lemma we have
Theorem 5.13: Let 7' be an a-approximation of 7 and p' be an optimal potential in N' = ( G = (V,A),g,Z,7', ( D , f ) ) . Then for any optimal submodular flow P N = (G = (V,A),c,-d,7,(D,I ) ) , (1) Y a E A: 7 p ~ ( a>) alVI ==+p(a) = c ( a ) , (2) VU E A: 7 p t ( ~< ) -alVl =+-P ( U ) = Z ( U ) , (3) V u , v E V : p'(u) - p ' ( v ) > aIVI ==+v $! dep(dp,u). (Proof) The present theorem follows from Lemma 5.12 and Theorem 5.3. Q.E.D. Theorem 5.13 gives a basis for a strongly polynomial algorithm for submodular flows. 159
111. NEOFLOWS We show a strongly polynomial algorithm which consists of the repeated applications of a procedure called Fundamental Cycle.
Fundamental Cycle Input: Lower and upper capacity functions c and C; a paitition W = {W' I i E I}of V ;a representation of S = $i,=lSi as a direct sum of submodular systems S' = ( D i , on Wi (i E I ) ; a graph H = (V,D) with connected components Hi = (Wi, E') (i E I) which are strongly connected; and a set A' = { a I a E A , c(a) = i?(a)} of all tight arcs. (Comment: At the initial application of this procedure we put