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!
.
nl,
without a f f e c t i n g primal
However, i f X2 i s chosen w i t h deg X2 > 3, b o t h
primal f e a s i b i l i t y and t h e value o f
w i l l be a f f e c t e d . p r i m a l s o l u t i o n i n (7.2)
Thus t h e general
is x1 = 5
and
x2 ,< 3.
(7.5)
S i m i l a r l y a p p l y i n g s e n s i t i v i t y a n a l y s i s t o t h e dual s o l u t i o n i n (7.3) we f i n d t h e is
general dual s o l u t i o n i n (7.2)
y1 = 3
(7.6)
and y2 s 0.
Obviously, t h e d e t a i l s o f t h e s e n s i t i v i t y a n a l y s i s w i l l v a r y i n d i f f e r e n t numerical examples, b u t f o r any p a i r o f dual extremal L.P's such as (7.1), t h e primal and t h e dual L.P. over
both
o f t h e corresponding symmetric-dual p a i r (7.2)
Z(z) w i l l have f e a s i b l e s o l u t i o n s .
F o r t h e p r i m a l L.P. always has t h e
o r i g i n a s a f e a s i b l e p o i n t , and a f e a s i b l e s o l u t i o n t o t h e dual L.P.
i s always
o b t a i n a b l e by a s s i g n i n g values o f s u f f i c i e n t l y h i g h degree t o a l l v a r i a b l e s . Hence f o r any g i v e n choice o f t h e u n i t parameters
J,
g. these two L.P.'s
always
have optimal f e a s i b l e s o l u t i o n s , w i t h equal o p t i m a l o b j e c t i v e f u n c t i o n values Pmax ( T Y ? )
(say).
Now, f o r t h e two extremal L.P.'s
over
f o l l o w i n g weak d u a l i t y p r i n c i p l e [15]:
2,
i t i s very s t r a i g h t f o r w a r d t o prove t h e
Using fields for semiring computations
67
No f e a s i b l e v a l u e o f t h e p r i m a l o b j e c t i v e f u n c t i o n can exceed any f e a s i b l e v a l u e o f t h e dual o b j e c t i v e function. I t f o l l o w s t h a t t h e v a l u e o f deg Pmax(~,g) i s independent o f t h e c h o i c e o f values
f o r t h e u n i t parameters, e l s e we c o u l d f i n d two s e t s of u n i t parameters (C,CI),
(!',ti) such t h a t o v e r 2 ( z ) t h e dual o b j e c t i v e f u n c t i o n c o u l d a t t a i n t h e v a l u e Pmax (2,g) and t h e p r i m a l o b j e c t i v e f u n c t i o n t h e v a l u e Pmax
(y',!')
>
deg Pmax
(s,$),
(TI,!.')
w i t h deg Pmax
which would v i o l a t e t h e weak d u a l i t y p r i n c i p l e o v e r
Thus we have used c o n v e n t i o n a l L.P.
2.
t h e o r y o v e r t h e o r d e r e d f i e l d Z(z) as a con-
v e n i e n t d e m o n s t r a t i o n o f t h e s t r o n g d u a l i t y p r i n c i p l e f o r a p a i r o f d u a l extremal o v e r 2 D5]:
L.P.'s
Both extremal L.P.'s
have an o p t i m a l f e a s i b l e s o l u t i o n , w i t h e q u a l i t y o f o p t i m a l
o b j e c t i v e f u n c t i o n value.
8.
ILLUSTRATION: EXTREMAL QUADRATIC PROGRAMMING
O p t i m i s a t i o n problems o v e r (2, @ , 8 ) i n v o l v i n g q u a d r a t i c o b j e c t i v e f u n c t i o n s do n o t seem t o have f i g u r e d p r o m i n e n t l y i n t h e l i t e r a t u r e . As an example o f such a problem, c o n s i d e r m in
2 @x ( ~@ ) 2
subject t o
8x Qy
@3
@ 2 @ x @y
(8.1)
x @ 3 @ y = 1.
Over I ( z ) we c o n s i d e r m in
Z'X2
subject t o
X
t
+
Z2XY
z3Y =
+
+
z3Y2 t z2x
Y
ITZ
X>,O,Y>,O
where
'TI
i s a u n i t parameter.
N o t i n g t h a t t h e Hessian m a t r i x o f t h e minimand, i.e.
i s p o s i t i v e - d e f i n i t e , we know t h a t t h e f o l l o w i n g Kuhn-Tucker C o n d i t i o n s (8.4), (8.5),
(8.6) g i v e s u f f i c i e n t c o n d i t i o n s f o r a minimum:
2z2x
+
z 2 ~t
x +
z2Y t
22 t h
2 z 3 ~+ 1 z3Y
-
ITZ
+
-
p = 0
-
2 3 ~
q =
o
= o
(8.4)
R.A. Cuninghame-Green
68
x >,o,
Y
>,o
(8.5)
p>,o,q>,o
px = qY = 0
(8.6)
Here (8.4) are the s t a t i o n a r i t y conditions; (8.5) the non-negativity conditions on the variables X , Y and the Lagrange multipliers p,q; and (8.6) the usual complementari t y conditions.
a i s the Lagrange multiplier f o r the equality constraint. These conditions a r e s a t i s f i e d by X = O ;
-2
Y =nz
= z2tn-2nZ-2-z-3;
=
o
(8.7)
1 = -2nz-'-z-3
whence x = --;y = -2; giving an otpimal objective function value of -1. Sensitivity analysis shows t h a t x may r i s e i n value t o 1 before i t violates the equation constraint in (8.1), b u t may only r i s e to value t o -3 before i t begins t o increase the object function value. Hence the general optimal solution i s :
x
d
-3, y = -2.
In general, a minimising extremal quadratic programing problem with linear equation and/or inequality constraints, such as (8.1), may be solved via a corresponding problem such as (8.2) over Z ( z ) , provided the l a t t e r problem has p o s i t i v e definite Hessian. For then i t can be shown by standard algebraic arguments t h a t the Kuhn-Tucker conditions are s u f f i c i e n t f o r a solution, and these conditions may be solved by L.P. derived processes such a s Wolfe's method, or principal pivoting. But,if we consider e.g. mi n
x ( 2 ) 0 3 @ x @Y 0 2 QY(2)
02 @ x O y
subject t o x @ 3 @ y = 1 ,
(8.8)
then i t i s easily seen t h a t the otpimal solution i s again x \< -3, y = -2. However, the corresponding problem over 2(z) now has non-positive-definite Hessian and leads us into the realms of non-convex quadratic programming.
9
ILLUSTRATION: THEORY OF POSITIVE MATRICES
Matrices over ( I , @ .@ ) correspond t o matrices over Y ( z ) with non-negative entries. The theory of such matrices i s , of course, highly developed and we can
Using fields for semiring computations
69
f i n d i n t e r e s t i n g correspondences between t h i s theory and t h a t o f matrices over
(2, 0 , Q ), by using the isomorphism (3.10). For example a square p o s i t i v e m a t r i x always has a Perron root, i.e. p o s i t i v e eigenvalue w i t h associated p o s i t i v e eigenvector.
a greatest
Hence a square m a t r i x
over (2, @ ,@)) always has a f i n i t e l y soluble eigenvector-eigenvalue problem ( i n f a c t t h e eigenvalue i s unique [6]). Again, from the theory o f i t e r a t i v e schemes r e l a t e d t o maximal-path-finding problems over
(2, @ ,6 )
i t i s known that, i f a m a t r i x a has no p o s i t i v e cycles,
then there e x i s t s a m a t r i x y s a t i s f y i n g (9.1 1
a@v@i = Y where i i s the i d e n t i t y matrix. To deduce t h i s r e s u l t using the isomorphism (3.10) we f i r s t remark t h a t i t i s s t r a i g h t f o r w a r d t o show t h a t i f a has no
p o s i t i v e cycles then the m a t r i x I - A , where A i s t h e corresponding m a t r i x over
I ( z ) and I i s the i d e n t i t y matrix, has p o s i t i v e p r i n c i p a l minors. known theorem f o r p o s i t i v e matrices and i s p o s i t i v e .
Thus
[lo]
=
Then by a w e l l -
r (say) e x i s t s
r i s p o s i t i v e and s a t i s f i e s Ar
Hence the corresponding m a t r i x
10.
we know t h a t (I-A)-'
Y
+I
=
r.
(9.2)
e x i s t s and s a t i s f i e s (9.1).
ILLUSTRATION: POWER SERIES OVER (IR, @ ,@ )
I n n 7 ] , we studied the properties o f power-series bo @ bl 0 x 0 b2@ x(') @ over (IR,
0 ,@ )
showing t h a t they converged f o r x
...
< P
(10.1)
and diverged f o r x >
p
where p = lim ~
-'
i n f br -r
(10.2)
Via the isomorphism (3.10), P corresponds t o the usual radius o f con.vergence -1 /r l i m i n f larl (10.3) rbr Of power-series w i t h c o e f f i c i e n t s ar = 2 The theory may be extended t o power-series o f a square m a t r i x a over (R, @ bo @ bl @ a @ which [17]
converges (resp. diverges) i f h(a)
the (necessarily unique) eigenvalue o f a.
... < p
,@ ) : (10.4)
(resp. A(a)
> P)
where x(a) i s
I n the l i g h t o f the present theory,
R.A. Cuninghame-Green
70
t h i s r e s u l t corresponds t o the convergence (resp. divergence) o f a m a t r i x powers e r i e s w i t h p o s i t i v e c o e f f i c i e n t s , f o r a p o s i t i v e m a t r i x whose Perron r o o t l i e s i n s i d e (resp. outside) the c i r c l e o f convergence o f the s c a l a r power-series.
11.
THE METHOD I N GENERAL
If ( G , @ ) i s a t o t a l l y ordered group and .I i s an i n t e g r a l domain, we may by standard algebraic methods c o n s t r u c t the group-ring Io(G) = I 1 (say). Then I l is again an i n t e g r a l domain, t o t a l l y ordered i f . I
is.
(We may thus continue the
... .
sequence Io , ,I ) l
(i,@,
Arguing exactly as i n Section 3 and i n [ll],we may show t h a t @ ), i.e. ( 6 , max, @ ) i s isomorphic t o t h e algebra o f equivalence classes o f t h e p o s i t i v e
6
cone o f t h e q u o t i e n t f i e l d F1 o f 11,where
= G
UI--l.
For the case when I. and G a r e Y, the z-method i s simply a convenient and i n t u i t i v e method o f c a r r y i n g o u t t h e c o n s t r u c t i o n o f F1, which i s i n t h i s case z(Z). For general p1 there i s a mapping d:F1
+
E
analogous t o the mapping deg, i . e .
d(X) e G f o r X # 0 d(0) =
-
(11 .l)
d(ab) = d(a) @ d ( b ) d(a + b)
d(a) @ d ( b )
The mapping d i n e f f e c t defines a non-Archimedean v a l u a t i o n
on F l .
It i s a
c l a s s i c a l r e s u l t f o r f i e l d s F~ so constructed t h a t they have a topological completion i n f i e l d s of formal Laurent series, which f o r t h e z-method a r e j u s t c l a s s i c a l Laurent s e r i e s w i t h i n t e g r a l c o e f f i c i e n t s and a t most a f i n i t e number o f terms of p o s i t i v e power. t o the valuation. [l]
Such Laurent s e r i e s are always convergent r e l a t i v e
The Giffler-Wongseelashote method consists e s s e n t i a l l y o f a d i r e c t construction o f generalised Laurent s e r i e s as well-ordered sequences o f elements o f a given z r b i t r a r y t o t a l l y ordered group G, as discussed i n [lZ] when .I
,
[15].
For t h e case
and G are 2, the two methods a r e t h e r e f o r e equivalent.
F i n a l l y , i f we c a r r y o u t the c o n s t r u c t i o n described above, f o r the dual s t r u c t u r e (G, @',Q ) = (G,min, 0 ) we o b t a i n the same q u o t i e n t f i e l d , and t h e mechanics o f
Using fields for semiring computations t h e isomorphism, v a l u a t i o n and c o m p l e t i o n a r e analogous.
71 We make use o f such a
dual c o n s t r u c t i o n i n t h e n e x t s e c t i o n .
12.
ILLUSTRATION: (SEMI) GROUP MINIMISATION PROBLEM
Suppose we a r e g i v e n c e r t a i n
m.
J
E
costs (j = 1
,...,n )
(0 < ml
f o r c e r t a i n elements o f an a b e l i a n semigroup ($,
$
g. E J
(j = 1
$,
We w i s h t o f i n d t h e cheapest element o f
<
m2 < ...)
(12.1)
0)
,..., n ) .
(12.2)
c o n s t r u c t i b l e as a p r o d u c t o f t h e
g i v e n g . ’ s a t g i v e n c o s t s m . which s h a l l l i e i n a g i v e n f e a s i b l e s e t C s J J’ t h u s we w i s h t o f i n d x j E 7 t o minimise
$:
Zm.x. J J X
g1x1 Q
subject t o
... @ g n n E
x. a 0 J
(12.3)
C
( j = 1,
Using t h e z-method we may c o n s t r u c t t h e semigroup r i n g t z SkZPk ( S k E $;pk E I) k=l
...,n )
a ( $ )o f
f o r m a l expressions (12.4)
The element 1 o f 7 ( $ )where
c
n
=
c g.z
j=1
m, (12.5)
J
c o l l e c t s each g e n e r a t o r g
and i t i s easy t o see t h a t labelled with i t s cost m j’ j’ r a i s i n g Z t o a power q ( s a y ) produces a sum l i k e (12.4) which c o l l e c t s each
element o f
$ o f t o t a l power q i n { g j } , l a b e l l e d w i t h i t s t o t a l c o s t .
Hence i f we expand ( l - Z ) - ’
as a f o r m a l geometric s e r i e s ( 1 4 p = 1
+c
t
z* +
...
(12.6)
and t h e n r e a r r a n g e i n ascending power o f z, we s h a l l t h e r e b y pr;oduce a l i s t i n g o f elements of
$ generated by t h e g
j’
w i t h associated cost, l i s t e d i n increasing
order o f cost. Mechanically, t h i s i s most e a s i l y done by f o r m a l l o n g - d i v i s i o n :
R.A. Cuninghame-Green
72
1-glzl-
1+g1z1+.
....
1-g z 1 1 g121+
..... .....
". 11
(12.7)
etc. The d i v i s i o n process i s simply terminated a t t h e f i r s t - o c c u r r i n g term i n t h e q u o t i e n t whose c o e f f i c i e n t belongs t o C;
i t s exponent then g i v e s t h e minimum
cost. The q u o t i e n t i s , o f course, a forma
Laurent s e r i e s i n the completion o f t h e
belongs, and a l l formal manipulations a r e eas 1Y j u s t i f i e d i n the l i g h t o f t h e c l a s s c a l arguments discussed i n Section 1 f i e l d El,
t o which ( l - z ) - '
In [16] we described a method o f so v i n g I n t e g e r P r o g r a m i n g problems whose j u s t i f i c a t i o n i s o f e x a c t l y t h i s nature.
REFERENCES van der Waerden, B.L., Roy, B.,
Modern Algebra (Frederick Ungar Pub. Co.,
T r a n s i t i v i t e e t connexite', C.R.
1953).
Acad. Sci. P a r i s 249 (1959) 216-218
Cuninghame-Green, R.A., Process synchronisation i n a steelworks - a problem of f e a s i b i l i t y , ( i n : Proceedings of t h e 2nd I n t e r n a t i o n a l Conference on Operational Research, E n g l i s h U n i v e r s i t y Press (1960) 323-328. Bellman, R. and Karush, W., On a new f u n c t i o n a l transform i n a n a l y s i s : t h e maximum transform, B u l l . h e r . Math. SOC. 67 (1961) 501-503. Yoeli, M., A n o t e on a g e n e r a l i z a t i o n o f boolean m a t r i x theory, Amer. Math. Monthly 68 (1961) 552-557. Cuninghame-Green, R.A., Describing i n d u s t r i a l processes w i t h i n t e r f e r e n c e and approximating t h e i r steady-state behaviour, Operational Res. Quart. 13 (1962) 95-100. G i f f l e r , B., Scheduling general p r o d u c t i o n systems using schedule algebra, Naval Res. L o g i s t . Q u a r t . 10 (1963) 237-255. Hoffman, A.J., On a b s t r a c t dual l i n e a r programs, Naval Res. L o g i s t . Q u a r t . 10 (1963) 369-373. G i f f l e r , B., Schedule algebra: a progress r e p o r t , Naval Res. L o g i s t . Q u a r t . 1 5 (1968) 255-280. Nikaido, H.,
Convex S t r u c t u r e s and Economic Theory (Academic Press, 1968).
Borawitz, W.C., Asymptotische reeksontwikkelingen i n minimax algebra toegep a s t op netwerkproblemen, Bachelor's t h e s i s (T.H. Twente, Netherlands, 1975).
Using fields for semiring computations
73
[12] Wongseelashote, A., Path algebras: A multiset-theoretic approach, Ph.D. thesis (University o f Southampton, 1976). [13] Cuninghame-Green, R.A., Minimax Algebra (Lecture Notes in Economics and Mathematical Systems No. 166, Springer-Verlag, 1979).
[14] Cuninghame-Green, R.A. and Meier, P.F.J., An algebra for piecewise-linear minimax problems, Discrete Appl. Math 2 (1980)267-294. [15]
Zimnermann, U., Linear and combinatorial optimization in ordered algebraic structures (Annals o f Discrete Mathematics 10, North-Holland, 1981).
[16] Cuninghame-Green, R.A. Integer programming by l o n g division, Discrete Appl. Math. 3 (1981) 19-25.
[17] Cuninghame-Green, R.A. and Huisman, F., Convergence problems in minimax algebra, Journ. Math. Anal. & Appl. 88,l (1982) 196-203. [18] Cuninghame-Green, R.A., The characteristic maxpolynomial o f a matrix, Journ. Math. Anal. 8 Appl. 95, 1 (1983) 110-116.
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 75-82 0 Elsevier Science Publishers B.V. (North-Holland)
75
SCHEDULING BY NON-COMMUTATIVE ALGEBRA
W F
R A Cuni nghame-Green
Borawitz
de D u l f 37 8918EB Leeuwarden The Netherlands
Department o f Mathematics U n i v e r s i t y o f Birmingham Birmingham 815 2TT England
The connection i s discussed between t h e use o f t h e m a t r i x i t e r a t i o n v = U ~ D T B V over t h e semiring (zuI-), min, +) = (2,@, @), aTid tfie use o f t h e z-transform, i n r e l a t i o n t o network scheduling i n v o l v i n g a s i n g l e vehicle. By i n t r o ducing non-commuting v a r i a b l e s t h e ideas can be extended t o producing e f f i c i e n t i t i n e r a r i e s i n v o l v i n g scheduled interchanges o f t r a v e l l e r s among t h e v e h i c l e s o f a m u l t i v e h i c l e t r a n s p o r t system.
1.
THE EARLIEST ARRIVALS
Suppose 4 towns X1,X2,X3,X4
a r e served by a c i r c u l a r bus r o u t e as shown i n F i g . 1,
t h e t r a n s i t times being: from X1 t o X2,
2 u n i t s ; from X2 t o X3, 3 u n i t s ; from X3
4 u n i t s ; from X4 t o X1, 1 u n i t . The m a t r i x 0, whose ( i , j ) t h element dij (i,j = 1, 4) i s the t r a n s i t time frm Xi t o X j along t h e a r c (Xi,Xj), o r else
t o X4,
...,
is
m
i f t h e r e i s no a r c (Xi,x.),
J
is:
(For convenience, we do n o t d i s t i n g u i s h n o t a t i o n a l l y between t h e physical system and t h e graph which represents i t . ) L e t us i n t r o d u c e 4 buses i n t o the system, one each a t : X1 a t time u1 = 7; X2 a t time u2 = 9; X3 a t time u3 = 1; X4 a t time u4 = 7.
The buses then c i r c u l a t e .
What i s t h e e a r l i e s t time vi a t which a bus w i l l be a v a i l a b l e a t each Xi?
Appeal-
i n g t o the o p t i m a l i t y p r i n c i p l e , we have: vi = min(ui,
min (vk+dki)) k = l , ,4
.. .
I n the n o t a t i o n of the semiring (ZUIml,min,+),
( i = 1,...,4)
notated as (?,@,@),
) = 1 vi = ~ ~ @ ( ( v , @ d , ~ ) @ . . . @ ( v ~ @ d ~ ~ )(i
,...,4)
(1.2) i s (1.3)
R.A. Cuninghame-Green and W.F. Borawitz
76
So, i n m a t r i x - v e c t o r n o t a t i o n i t i s t h e f a m i l i a r i t e r a t i o n v = U @ -
C
T
(FJV
-
where g, a r e t h e v e c t o r s w i t h components ui, vi r e s p e c t i v e l y ( i = 1 ,. .. ,4) and T D i s t h e transposed of D. (Our v e c t o r s a r e column-vectors.)
I f we c a l l
D T @ v-
y
t h e a v a i l a b i l i t y v e c t o r , g t h e i n i t i d l a v a i l a b i l i t y v e c t o r and
t h e a r r i v a l s v e c t o r then (1.4) says t h a t t h e a v a i l a b i l i t y o f a bus a t a
town i s e i t h e r by i n i t i a l a v a i l a b i l i t y a t t h a t town o r by a r r i v a l from another town where t h e bus was p r e v i o u s l y a v a i l a b l e . I t e r a t i o n s such as ( 1 . 4 ) have been discussed by many a u t h o r s
-
the extensive reference l i s t therein developed.
-
see e.g.
[5]
and
and may be solved by t h e methods they have
I n p a r t i c u l a r we consider t h e s o l u t i o n o f (1.4) by t h e z-method which
depends upon t h e isomorphism between classes o f p o s i t i v e elements o f t h e
(2, 0 , Q )and t h e a l g e b r a o f equivalence f i e l d z(z) o f r a t i o n a l expressions i n an
indeterminate z, w i t h i n t e g e r c o e f f i c i e n t s ( c f [6]
f o r (IUI--],max,+)).
Accordingly we must now solve, over Z ( z ) , t h e r e l a t i o n y
f o r the vector
y
>/
T = y + a y
0,where z*
0
A = -
Notice t h a t
= [dij]
i s a -_ d e f i n i t e m a t r i x i n t h e sense t h a t each c i r c u i t - s u m
d..ord. t...+d. JJ JlJ2 Jp-14 m t r i x !-:has
>
2) i s positive.
Then as discussed i n [6],
the
p o s i t i v e p r i n c i p a l minors and by a well-known theorem (I-A -) - ' e x i s t s Thus y 3 i n ( 1 . 7 ) and y i s i n t e r p r e t a b l e under t h e
and i s a p o s i t i v e m a t r i x . isomorphism.
(p
0
I f o p e r a t o r z e r counts zeroes a t t h e o r i g i n :
77
Scheduling bj, non-commutative algebra
(1.8)
More g e n e r a l l y , l e t us c o n s i d e r graphs w i t h n nodes.
From now on we assume t h a t
t i m e i s measured i n i n t e g r a l u n i t s r e l a t i v e t o some datum.
When t h e w e i g h t s dij
o f a complete d i r e c t e d weighted graph have a n i n t e r p r e t a t i o n i n terms o f t r a n s i t t i m e s r a t h e r t h a n d i s t a n c e s , we s h a l l speak o f a t r a n s i t graph and we s h a l l assume t h a t f o r such a graph dij
i s either
0=
[dij]
i s a positive matrix
o r a positive integer.
-
i . e . each element
F o r t h e o f f - d i a g o n a l elements o f
r e p r e s e n t s t h e reasonable assumption t h a t d i r e c t t r a n s i t f r o m Xi
this
t o X j (i# j )
i n t h e p h y s i c a l system i s e i t h e r i m p o s s i b l e o r e l s e t a k e s a f i n i t e amount o f time. F o r t h e d i a g o n a l elements i t may seem l e s s n a t u r a l , b u t i t r e p r e s e n t s t h e f a c t t h a t we assume e v e r y element o f
0refers
t o a motion, t a k i n g time.
p o s s i b i l i t y t h a t a v e h i c l e may move f r o m Xi
t o Xi
We a l l o w t h e
( i n d e e d i n S e c t i o n 6, we s h a l l
need t h i s p o s s i b i l i t y i n m o d e l l i n g p a r t i c u l a r s i t u a t i o n s ) b u t t h a t m o t i o n always t a k e s time, so dii
i s always p o s i t i v e .
Hence f o r such n-node systems i t e r a t i o n (1.4) may be s o l v e d by
v
2.
= zer(
(L-AT ) -1 w)
(1.9)
GIFFLER’S SERIES EXPANSION
I f we expand ( 1 - z l o ) - ’ as a f o r m a l g e o m e t r i c s e r i e s , (1.7) g i v e s
The f i r s t component o f t i m e s 6,7,8
...
y
shows t h a t some bus i s a v a i l a b l e a t Xi
The t e r m 2zI7 shows t h a t
two buses
a t each o f t h e
a r e p r e s e n t a t X1 a t t i m e 17.
So we see t h a t t h e components i n (2.1) a r e j u s t t h e z-transforms o f the a v a i l a b i l i t y processes a t t h e c o r r e s p o n d i h g nodes o f t h e graph, i n t h e f o l l o w i n g sense. Suppose t h a t a t a g i v e n town Xi, The sequence ao,a,, process a t Xi,
... i s
a,
buses w i l l t u r n up a t t i m e r ( = O , l , ...).
a t i m e s e r i e s which we may say d e f i n e s t h e a v a i l a b i l i t y
and t h e power s e r i e s a.
z - t r a n s f o r m o f a g i v e n t i m e s e r i e s ao,al,
+
alz
...
+
a2z2
+ ...
i s by d e f i n i t i o n t h e
I n an analogous way, and w i t h s e l f
e v i d e n t meanings, we may d e f i n e t h e z - t r a n s f o r m s o f t h e i n i t i a l a v a i l a b i l i t y
R.A. CuninghamcGreen and W.F. Bormvitz
78 process a t Xi
( i f v e h i c l e s are f e d i n t o t h e system v i a Xi
from o u t s i d e a t v a r i o u s
times); and o f t h e a r r i v a l process a t Xi. I n b r i e f : t h e elements o f
are r a t i o n a l f u n c t i o n s o f z , which as discussed i n [6] i n f i n i t e series.
may be expanded i n t o formal
I f elements o f w a r e the z-transforms o f t h e r e s p e c t i v e i n i t i a l
a v a i l a b i l i t y processes, then t h e expanded elements o f y a r e e x a c t l y t h e z-transforms o f t h e a v a i l a b i l i t y processes a t t h e r e s p e c t i v e nodes. The technique works n o t o n l y f o r " c i r c u l a r " graphs, b u t i n general f o r f o r k - f r e e t r a n s i t graphs where a graph i s d e f i n e d t o be f o r k - f r e e i f f o r each i = 1, t h e r e i s a t most one d . . < 1J
-
( j = 1,
a l l d i r e c t e d arcs f o r which dij
=
-
... ,n).
...,n
I f we d e l e t e from a f o r k - f r e e graph
then t h e remaining graph w i l l be c a l l e d t h e
r e s i d u a l graph o f t h e g i v e n f o r k - f r e e graph.
I n such a r e s i d u a l graph t h e r e may
be a confluence o f d i r e c t e d arcs b u t never a divergence; F i g . 2 i l l u s t r a t e s some t y p i c a l examples. I n what we have o u t l i n e d so f a r , we have e s s e n t i a l l y f o l l o w e d G i f f l e r ' s p i o n e e r i n g work [l] (1968), b u t we have used t h e f i e l d Z(z) r a t h e r than G i f f l e r ' s constructed f i e l d , thus r e l a t i n g t h e technique t o t h e f a m i l i a r one o f z-transforms. another approach, see Wongseelashote [3]
3.
For
.
NON-COMMUTING VARIABLES
Now suppose various c i t i e s a r e connected among themselves by several d i f f e r e n t t r a n s p o r t a t i o n systems.
Using the foregoing techniques, we may represent t h e
p a t t e r n s of a v a i l a b i l i t y o f each vehicle-system a t t h e v a r i o u s nodes.
A traveller
may j o i n o r leave a v e h i c l e a t a p a r t i c u l a r node o n l y a t a t i m e when the v e h i c l e i s a t t h a t node.
For mathematical convenience we assume t h a t a l l v e h i c l e s a r e
c o n s t a n t l y i n motion and a r e o n l y i n s t a n t a n e o u s l y a t any node.
A t t h a t moment a
t r a v e l l e r may leave, j o i n , o r change v e h i c l e s simultaneously a t t h a t node.
In
Section 4, however, we s h a l l consider some m o d e l l i n g techniques t o account f o r t h e f a c t t h a t t r a v e l l e r s and v e h i c l e s may a c t u a l l y
wait a t
v a r i o u s p o i n t s o f the
p h y s i c a l system. Suppose, then, t h a t we have m f o r k - f r e e graphs which a l l use t h e same nodes
XI.
...,X,
b u t have separate arc-systems.
a t a given time.
A t r a v e l l e r i s present a t a given node
How should he p l a n t o reach another given node as soon as
possible, using t h e v e h i c l e s and changing as necessary?
Scheduling b.v non-commutative algebra
We i n t r o d u c e a s e p a r a t e v a r i a b l e zh f o r each graph ( h = l,...,m)
79
and i n t h e
obvious way d e f i n e t h e i n i t i a l a v a i l a b i l i t y v e c t o r s w(zh), m a t r i c e s n ( z h ) and avai 1a b i 1it y v e c t o r s y ( z h ) = (L+(Zh)
T -1
) w(zh)
(h = l,***,m)
(3.1)
We l e t t h e v a r i a b l e zo r e p r e s e n t t h e t r a v e l l e r , w i t h i n i t i a l a v a i l a b i l i t y v e c t o r w ( z o ) , and l e t t h e unknown v e c t o r
1=
l(zo,zl
,. ..z,),
g i v e the transforms o f the
r e s u l t i n g a v a i l a b i l i t i e s o f t h e t r a v e l l e r , i n t h e f o l l o w i n g sense. of
Each component
w i l l be a ( u s u a l l y i n f i n i t e ) sum o f homogeneous f u n c t i o n s o f ~ ~ , z ~ , . . . , z ~
arranged i n ascending o r d e r o f t o t a l degree.
Each such homogeneous f u n c t i o n w i l l
be a term o r sum o f terms, each t e r m b e i n g a p r o d u c t o f powers o f z ~ , z ~ , . . . , z ~ and r e p r e s e n t i n g a p a r t i c u l a r way o f b e i n g a v a i l a b l e a t a p a r t i c u l a r t i m e and place.
Thus a p r o d u c t e.g. z ~ o z 1 2 z o( o f t o t a l degree 13) o c c u r r i n g i n t h e second
component o f v would r e p r e s e n t an a v a i l a b i l i t y a t X p a t t i m e 13 as a r e s u l t o f : s t a r t i n g a t t i m e 1 ( g i v i n g z:), ( g i v i n g z);
spending two t i m e - u n i t s on v e h i c l e - s y s t e m 1
and t h e n changing and spending 10 u n i t s o f t i m e on v e h i c l e - s y s t e m 2 N o t i c e t h a t t h e o r d e r o f f a c t o r s i n such a p r o d u c t has s i g n i f i -
( g i v i n g 221').
cance: we must work w i t h non-commuting v a r i a b l e s . Our t a s k i s t o determine
1 from
t h e o t h e r d a t a o f t h e problem.
To t h i s end we
d e f i n e a new a l g e b r a i c o p e r a t i o n . m
z
m
,...,zm)
,,...,
z gr (zo,z zm) be two s e r i e s o f terms r=o r=o w i t h fr,gr homogeneous o f t o t a l degree r ( r = O , l , ...) ; fr,gr may p o s s i b l y be Let a =
fr (zo,zl
z e r o o f course.
and B =
We d e f i n e : m
a08 =
When
1 fr(l,l, r=o
...,l ) g r ( z o . z l ,..-,zm)
(3.2)
a r e sums o f power-products, we may d e s c r i b e t h e a c t i o n o f t h i s o p e r a t i o n
by s a y i n g t h a t i n aoB, t h e terms o f B o c c u r each m u l t i p l i e d by t h e number o f power-products t h e r e a r e i n a o f t h e same t o t a l degree.
In particular the effect
i s t o remove any terms w h i c h a r e n o t matched by any non-zero t e r m o f t h e same t o t a l degree i n a . Further, i f
5, b
t h e p r o d u c t do!
a r e v e c t o r s whose components ai,Bi i s d e f i n e d componentwise
So, s i n c e y ( z l ) , ...,y( z),
-
i.e.
a r e s e r i e s such as a,B, t h e n
t h e ith component o f
gok
r e p r e s e n t t h e a v a i l a b i l i t i e s o f v e h i c l e s , and
i s aio6i.
1
r e p r e s e n t s t h e a v a i l a b i l i t i e s o f t h e t r a v e l l e r , we i n f e r t h a t y(zl)ol,...,.y(zm)o~ r e p r e s e n t those a v a i l a b i l i t i e s o f t h e t r a v e l l e r which a r e c o n s i s t e n t w i t h a departure, f r o m somewhere a t some time, by t h e r e s p e c t i v e v e h i c l e s .
Hence:
80
R.A. Cuninghamc-Greenand W.F. Borawitz T T ~ ( 2 1 )( l ( ~ l ) o v ) , . . . , a ( z m ) (Y(Zm)OV)
represent h i s p o s s i b l e a r r i v a l s by t h e r e s p e c t i v e v e h i c l e s .
Since a v a i l a b i l i t y
a r i s e s by i n i t i a l a v a i l a b i l i t y o r by a r r i v a l we i n f e r t h e f o l l o w i n g i m p l i c i t relationship f o r
v:
v = w(zo) + ; ( L \ ( z h ) T i ( ( r - a ( z h ) T ) - l w ( Z h ) ) o v } ) h -
We may s o l v e such r e l a t i o n s i t e r a t i v e l y o r r e c u r s i v e l y f o r
4.
(3.3)
1as i l l u s t r a t e d next.
AN EXAMPLE
Suppose t h a t two c i t i e s C1 and C 2 a r e served by two separate t r a n s p o r t a t i o n
-
systems
a c i r c u l a r bus r o u t e and a t r a i n s h u t t l e s e r v i c e .
The bus takes 4
time u n i t s t o t r a v e l from C1 t o C2, w a i t s a t C2 f o r 2 u n i t s , t r a v e l s back t o C1 i n 3 u n i t s , w a i t s a t C1 f o r 3 u n i t s , and then repeats t h e process. The t r a i n takes 2 t i m e u n i t s t o t r a v e l from C1 t o C2.
w a i t s a t C2 f o r 2 u n i t s ,
t r a v e l s back t o C1 i n 2 u n i t s , w a i t s a t C1 f o r 2 u n i t s , and then repeats t h e process. F i g . 3 shows how we m i g h t model t h i s s i t u a t i o n .
I n o r d e r t o account f o r t h e
time which each v e h i c l e w a i t s a t each c i t y , we r e p r e s e n t each c i t y Ci nodes X i and Yi.
t o Yi
We decree t h a t each v e h i c l e which v i s i t s Ci
by
two
" t r a v e l s " from Xi
i n a time equal t o i t s w a i t i n g t i m e a t Ci.
Suppose t h e r e i s j u s t one bus i n commission, which s t a r t s from Y 1 a t time 1 and one t r a i n which s t a r t s from Y1 a t t i m e 2. wishes t o v i s i t c i t y C2,
A t t i m e 0, a t r a v e l l e r i s a t Y,.
He
r e t u r n i n g n o t l a t e r than t i m e 10, having spent as much
t i m e as p o s s i b l e i n c i t y C2.
How does he proceed?
Now, unless two v e h i c l e s a r e simultaneously present a t a g i v e n c i t y , t h e t r a v e l l w wishing t o change f r o m one t o t h e o t h e r a t t h a t c i t y must w a i t t h e r e f o r an a p p r o p r i a t e time.
We may b r i n g such w a i t i n g w i t h i n t h e scope o f o u r method by
i n t r o d u c i n g a w a i t i n g l o o p a t each node Yi
which we may t h i n k o f as r e p r e s e n t i n g
an imaginary v e h i c l e which operates on a c i r c u l a r r o u t e from Yi one u n i t o f time per c i r c u i t . v e h i c l e when he w a i t s a t Yi. city.
t o i t s e l f taking
The t r a v e l l e r i s regarded as b e i n g "on" t h a t F i g . 4 shows t h e interchange arrangements a t each
The t r a v e l l e r may change v e h i c l e s a t Xi
i f t h e two v e h i c l e s f o r t u i t o u s l y
a r r i v e simultaneously; otherwise he t r a v e l s t o Yi on t h e " w a i t i n g - t i m e v e h i c l e " and stays i n a w a i t i n g l o o p u n t i l such t i m e as t h e v e h i c l e he wishes t o j o i n reaches Yi.
Because a l l " w a i t i n g - v e h i c l e ' ' t r a n s i t s t a k e u n i t time, he misses
Scheduling by non-commutative algebra
81
no o p p o r t u n i t i e s . I n (3.3) we have f o r t h e w a i t i n g ,
bus and t r a i n v e h i c l e s r e s p e c t i v e l y
To s o l v e (3.3) r e c u r s i v e l y we assume f o r t h e jth component o f m
the form
z
ajr(zo,
...,zm)
where ejr
v ~
an expansion o f
i s an unknown t e r m o f t o t a l degree r.
r=o 117ay t h u s develop t h e r i g h t - h a n d s i d e o f (3.3) i n terms o f t h e eir
We
and equate
J
terms of equal t o t a l degree i n t h e l e f t - h a n d and r i g h t - h a n d s i d e s t o d e r i v e a sequence o f r e c u r s i o n s w i t h r e s p e c t t o r among t h e
J on t h e r i g h t w i l l be p r o v i d e d by known f u n c t i o n s i n ~ ( z , ) ,
The lowest-degree terms g i v i n g us values f o r
t h e l o w e s t degree terms on t h e l e f t , and t h e r e c u r s i o n s may be s o l v e d systematically. A l t e r n a t i v e l y , d i s c u s s i n g (3.3) i n a condensed n o t a t i o n
v = w ( z o ) + ?(Z1, we may s o l v e i t e r a t i v e l y f o r
1 by
...,Zm
;
v)
(4.3)
t a k i n g an i n i t i a l s o l u t i o n
v0
(4.4
= w(zo)
and t h e n computing
vk+' = w(zo) + I ( z l
,...,z,
k
;1 )
( k = 0,1, . . . )
(4.5
I n b o t h methods t h e s c a l a r a l g e b r a i s m u l t i p l i c a t i v e l y non-commutative and r e g a r d must be p a i d t o t h e f a c t t h a t t h e m a t r i c e s i n ( 3 . 3 ) m u l t i p l y f r o m t h e l e f t . By e i t h e r method, we f i n d t h a t t h e terms o f t o t a l degree n o t exceeding 10 i n t h e f i r s t component o f
v are:
R.A. CuninghamcCreen and W.F. Borawitz
82
(Some o f these terms occur w i t h very l a r g e c o e f f i c i e n t as a r e s u l t o f m u l t i p l e a l t e r n a t i v e s a r i s i n g through t h e w a i t i n g - v e h i c l e "reproducing i t s e l f " i n t h e w a i t i n g loop; a l t e r n a t i v e m o d e l l i n g procedures w i l l a v o i d t h i s inelegance.) I f we examine these terms t o f i n d t h a t which has t h e h i g h e s t power o f z1 as i n t e r n a l f a c t o r , we f i n d t h a t i t i s 223z13z32z12, g i v i n g t h e f o l l o w i n g i t i n e r a r y ; T r a v e l l e r a r r i v e s a t Y1 a t t i m e 0, a l l o w s t h e bus t o d e p a r t a t t i m e 1, and catches t h e t r a i n which departs a t time 2.
On a r r i v a l a t c i t y C2 he stays t h r e e
u n i t s o f time, a l l o w i n g the t r a i n t o r e t u r n w i t h o u t him. a r r i v e s and he catches i t back t o c i t y C1
Meantime t h e bus
.
REFERENCES
G i f f l e r , B. Schedule algebra: a progress r e p o r t , Naval Res. L o g i s t . Q u a r t . 15 (1968) 255-280. Borawitz, W.C., A s m p t o t i s c h e reeksontwikkelinqen i n minimax alaebra toegepast op netweikproblemen, Bachelor's t h e s i s (T.H. Twente, i e t h e r l a n d s , 1975). Wongseelashote, A, An a l g e b a f o r determining a l l path-values i n a network w i t h a p p l i c a t i o n t o k - s h o r t e s t path problems, Networks 6 (1976) 307-334. Cuninghame-Green, R.A. Minimax Algebra (Lecture Notes i n Economics and Mathematical Systems No. 166, Springer-Verlag 1979). Zimnermann, U., L i n e a r and combinatorial o p t i m i z a t i o n i n ordered a l g e b r a i c s t r u c t u r e s Annals o f D i s c r e t e Mathematics 10 (North-Holland 1981). Cuninghame-Green, R.A., Using f i e l d s f o r semiring computations, Annals o f D i s c r e t e Mathematics ( t h i s volume), Chapter 5.
Annals of Discrete Mathematics 19 (1984) 83-98
83
0 Elsevier Science Publishers B.V. (North-Holland)
PSEUDO-BOOLEAN FUNCTIONS AND STABILITY OF GRAPHS
P.L. Hamner
Ch. Ebenegger
D. d e Werra RUTCOR Ecole P o l y t e c h n i q u e E. A.U.G. Rutgers ' Center f o r F e d e r a l e de Lausanne Uni v e r s i t 6 de Gensve O p e r a t i o n s Research DCpt. de Mathgmatiques CH-1200 GenPve Rutgers U n i v e r s i t y MA Ecublens Switzerland New Brunswick CH-1015 Lausanne NJ 08540 Switzerland USA I n t h i s oaper t $ e c o n c e n t o f c o n f l i c t g r a o h a s s o c i a t e d w i t h a pseudo-Boolean f u n c t i o n i s discussed; one e x p l o i t s t h e f a c t t h a t t h e problem o f f i n d i n g a s t a b l e s e t w i t h maximum w e i g h t i n a graph can be reduced t o t h e m a x i m i s a t i o n o f a pseudo-Boolean f u n c t i o n and c o n v e r s e l y . On these Boolean f o u n d a t i o n s a graph t h e o r e t i c a l procedure i s develooed asso c i a t i n g t o any graph a n o t h e r one h a v i n g a s t r i c t l y s m a l l e r s t a b i l i t y number. Fragmentary c o m o u t a t i o n a l e x p e r i e n c e seems t o show t h a t t h i s r e d u c t i o n may be a p p l i e d e f f i c i e n t l y i n a l g o r i t h m s f o r o b t a i n i n g t h e s t a b i l i t y number o f a graph. INTRODUCTION The purpose o f t h i s n o t e i s t o show how i n some cases Boolean methods can suggest graph t h e o r e t i c a l procedures which can o f c o u r s e be d e r i v e d a p o s t e r i o r i d i r e c t l y I n t h e n e x t s e c t i o n , t h e concept of con-
by u s i n g graph t h e o r e t i c a l p r o p e r t i e s .
f l i c t g r a p h a s s o c i a t e d w i t h a pseudo-Boolean f u n c t i o n w i l l be presented; t h e r e l a t i o n between t h e m a x i m i s a t i o n o f a pseudo-Boolean f u n c t i o n and t h e determinat i o n o f a s t a b l e s e t w i t h maximum w e i g h t i n a graph w i l l be developed. I n t h e case where a s t a b l e s e t w i t h maximum c a r d i n a l i t y
C(
must b e f o u n d ( u n w e i g h t d
case), we w i 11 d e s c r i b e a t r a n s f o r m a t i o n o f t h e c o r r e s p o n d i n g pseudo-Boolean f u n c t i o n ; t h i s t r a n s f o r m a t i o n amounts t o c o n s t r u c t i n g another graph h a v i n g a-1 as i t s s t a b i l i t y number.
Section 2 w i l l contain t h i s transformation w h i l e a d i r e c t
c o n s t r u c t i o n w i l l be d e s c r i b e d i n graph t h e o r e t i c a l terms i n S e c t i o n 3. The e q u i v a l e n c e o f these procedures w i l l be proven i n S e c t i o n 4 where one w i l l show how t h e procedure can be used i n t h e weighted case.
F i n a l l y i n S e c t i o n 5 some com-
p u t a t i o n a l experiments w i l l b e r e p o r t e d . The g r a p h t h e o r e t i c a l terms w i l l be borrowed f r o m d e f i n i t i o n s , t h e reader i s r e f e r r e d t o a node a ( a i s n o t i n N ( a ) ) .
m.
w h i l e f o r pseudo-Boolean
N(a) w i l l be t h e s e t o f neighbours o f
Furthermore, a l l graphs w i l l be assumed s i m p l e (no
l o o p s and no m u l t i p l e edges a r e a l l o w e d ) , so we w i l l s i m p l y speak o f graphs.
1
.
CONFLICT GRAPHS
We s h a l l b e i n t e r e s t e d i n t h i s s e c t i o n i n t h e o p t i m i s a t i o n o f a pseudo-Boolean
Cli. Ebenegger et al.
84
f u n c t i o n and we s h a l l c o n s i d e r a graph t h e o r e t i c i n t e r p r e t a t i o n o f t h i s problem. F i r s t we need some d e f i n i t i o n s .
. . ,xn)
A pseudo-Boolean f u n c t i o n f a s s o c i a t e s w i t h e v e r y n - t u o l e (xl ,x2,.
E
IO, 1 In
a r e a l value; i t i s known t h a t a pseudo-Boolean f u n c t i o n f can always be w r i t t e n i n a polynomial fonn, i . e .
f(x1,x2,
Ifa l l wi
>
. . . ,x n )
= K
+
nr
where T . =
1 w.T i=l
0 ( i = 1 ,... ,p), we say t h a t
1
P
r
wiTi
n
x.
n
xk
kEBi
jEAi
i s a posifonn.
j=l
...,xn)
Suppose we want t o maximise a p o s i f o r m f ( x l ,
o v e r { O , 1 ) " ; we may a s s o c i a t e
w i t h f a graph G c o n s t r u c t e d as f o l l o w s : f o r each Ti we i n t r o d u c e a node ai w i t h a w e i g h t wi
and we l i n k ai and a . i f t h e c o r r e s p o n d i n g terms Ti J
fl
.e. t h e r e e x i s t s sane i n d e x k
k
Bi,
E
11 ,...,n l such t h a t k
and T 1 a r e i n conE
x.J appears i n Ti
Ai h B j o r
( o r T . ) w h i l e x . appears i n T. ( o r J J J i s c a l l e d t h e c o n f l i c t graph of t h e p o s i f o r m f. Some i l l u s t r a t i o n s o f or equivalently
Ti c o n f l i c t graphs a r e g i v e n i n
[q.
I t i s c l e a r f r o m t h e c o n s t r u c t i o n o f G t h a t t h e maximum v a l u e o f f i s equal t o t h e
maximum w e i g h t o f a s t a b l e s e t i n G.
F i g u r e 1.1 shows a c o n f l i c t g r a p h correspon-
ding t o t h e posiform f(X,Y,Z,U,V)
= 2xu
+ 3xy + 7v; + 5y
2xu
t 62
t
+
xzi +
4zu + 4xiy
3yZ -_
3x4'
7UV
F i g u r e 1 .l. C o n f l i c t g r a p h of f(x,y,z,u,v)
+
Pseudo-boolean functions and stabi1it.v of graphs
85
We observe t h a t each v a r i a b l e x . o f f i s a s s o c i a t e d i n G w i t h a complete b i p a r t i t e J ( n o t n e c e s s a r i l y induced) subgraph whose nodes correspond on one s i d e t o a l l terms containing x
and on t h e o t h e r s i d e t o a l l terms c o n t a i n i n g
j
Conversely, i f we a r e g i v e n a graph G w i t h w e i g h t s wi
xj *
a s s o c i a t e d w i t h i t s nodes,
we may c o n s t r u c t a f u n c t i o n f as f o l l o w s : i n i t i a l l y we s e t Ai
= Bi
=
fl f o r each
node i o f G and we c o n s i d e r an a r b i t r a r y c o v e r i n g o f t h e edge s e t by complete b i p a r t i t e subgraphs G1 G .; t h e n we s e t J
,.. . ,Gq ; l e t
X -,X. be t h e 2 s e t s o f nodes c o r r e s p o n d i n g t o J J
Ai = I k B 1. = { k
n Finally f =
c
wiTi i=l
n
(where Ti =
n Xk)
x
jEAi
j ..EB
i s a p o s i f o r m h a v i n g G as i t s
i
conf 1 ic t graph. 2.
REDUCTION OF THE STABILITY NUMBER
We s h a l l now deal w i t h t h e problem o f f i n d i n g t h e s t a b i l i t y number a ( G ) o f a graph G = (X, U) w i t h node s e t X = {ao,a ly...,anl.
f(xO,xl
,. .. ,xn)
We can a s s o c i a t e w i t h G a p o s i f o r m
such t h a t max f ( x o,...,xn)
= a(G) 9
and t h a t we can f i n d a p o s i f o r m g ( x o ,..., xn) such t h a t f ( x o y ...,xn) = 1 g( xo,.
. . ,xn)
f o r a1 1 values o f xO,
+,
...,xn.
Construction o f f : 1)
L e t a.
be a n a r b t r a r y node and al,a2,
term To = 2)
x1
x2
..
xP w i t h
node a.
.
Furthermore f o r each neighbour ai o f a.
n
T. = x . 1
1.
j:a.EN(a-)
-I.1
...,aP
i t s neighbours.
We a s s o c i a t e t h e
we d e f i n e a term
X
j.
3)
J<1 F o r e v e r y r e m a i n i n g node ai o f G ( i > p) we i n t r o d u c e a term Ti = xi
4)
F i n a l l y we p u t f =
n
x
jEN( i ) j '
1
Ti.
i:a.EX 1
An example o f c o n s t r u c t i o n o f f i s g i v e n i n F i g u r e 2.1.
N o t i c e t h a t xo i s n o t
used i n t h i s c o n s t r u c t i o n , so we s h a l l w r i t e s i m p l y f ( x l,...,xn).
C/I.Ebenegger el al.
86
- -
) - - - - -
f = x 1x 2x 3x 4x 5 t x
+
x 5 XIx3
x1x2 t x3 + i 3 x 4 +
ili3X5
+ X3X4X6
F i g u r e 2.1 T h i s c o n s t r u c t i o n amounts t o c o v e r i n g t h e edge s e t o f G by s t a r s centered a t al ,a2
,..., a;,
f o r i = 1 ,...,p t h e s t a r centered a t ai covers [ai, a 4 with i
edges [ai,
c
j 4 p, w h i l e f o r i
>
aJ
and a l l
p t h e s t a r centered a t ai covers a l l
edges adjacent t o ai. Fran Section 1 we have: P r o p o s i t i o n 2.1.
Max f(xl
,...,xn)
= a(G)
Remark t h a t a depends o n l y on G, w h i l e f depends a l s o on t h e choice o f a.
..., aP
t h e p a r t i c u l a r order al,
o f i t s neighbourhood.
=1 t
I n order t o o b t a i n t h e posiform g such t h a t f t h e f o l l o w i n g i d e n t i t y w i t h il
-
x
-
x. il ' 2
...
xi
= 1
9
N o t i c e t h a t o n l y t h e terms Ti our a t t e n t i o n t o
-
and o f
<
i2 <
x
-
il
(i
D)
...
g, we w i l l r e p e a t e d l y apply
< i
9
-
-
x 'il 'i2 'il 'i2 i3
-
... -
w i l l b e m o d i f i e d so t h a t we can r e s t r i c t
Pseudo-booleanfunctions and stability of graphs
and show t h a t we s h a l l g e t a p o s i f o n n go(xl,
P x
,n
When r e p l a c i n g To =
J=1
...,xo)
such t h a t f o E 1 t go.
P n i.we o b t a i n i = l 1 j< i J
by 1 - z x -
j
ajEN( ai ) D
=
1 +
Denote ui = (1
-
t h e same i d e n t i t y as b e f o r e , we g e t
k< i akkN(ai) ui =
k z< i
slk
'k
ak&N(ai)
asCN(aif
Hence
since k
<
i we have
n
j
a.EN(ai) J
x
J
n
s
Xk)
k
j
ik). Using
n
ij(' n
n
c xi i=l
-
x
S
=
's
87
Ch. Ebenegger et al.
88
q
SO go(xl
,..., xp)
it and
n
jS
7
s.q
r 5 D.
q
,..., xp)
= fo(xl
-
1 i s a p o s i f o m and
n
g(xl
,..., x n )
= go(x
f(xl
,..., x n )
= 1 t
,,..., x p ) i. r: Ti i s a l s o a p o s i f o m w i t h i=p+l g ( x l ,..., x n ) . I n p a r t i c u l a r max g ( x l ,..., xn)
max f f x l , . . . ,xn)
-
Proposition.2.2
a(")
1.
I f we denote by = a(G)
=
G, t h e c o n f l i c t g r a p h o f go, t h e n we have
- 1.
For example, s t a r t i n g f r o m t h e g r a p h i n Fig. 2.1, t a k i n g as
- - - - -
t h e node "coded" as
x1x2x3x4x5, and c h o s i n g t h e n a t u r a l o r d e r o f t h e nodes i n t h e nei9hbourhood
of, , ,a
we g e t
- -
- - - - -
+ x1 + x1x2 + x 3 + X3x4 + x1x3x5 +
f = x x x x x = l + x
- -
1
- x1
+;x +X3+'3x4+XXX 1 2 1 3 5
-
-
x1x2
-
- -
+
( 1 - X1X2)X3 + ( 1
= 1
+
(xl + Z,X2)X3
= l + x x + ip.f.3
-
x1x2x3
1
=
i .
-
= 1
- - -
x1x2x3x4
+
-
'3'4'6
- - - -
x x x x x 1 2 3 4 5
X1X2)X3X4 + (1
+ (xl + X,X2)X3X4
-
-
x1x3x4 + x1x2x3x4
- +
-X 3 X-4 X 6
t
x2x4)x1x3x5 +
x
X3X4X6
x 3x 5
+ 2x 4 )X 1
- -
t
(x*
+
x1x2x3x5 + x x x x x 1 2 3 4 5 +
'3'4'6
+ T13
- - - -
-
+
'3'4'6
- - -
- -
T23 + T 1 4 + T 2 4 + TZ5 + T45 + x3x4x6
T h i s suggests t h a t s t a r t i n g from G and i t s a s s o c i a t e d f u n c t i o n f , we c o n s t r u c t a graph G ' c o r r e s p o n d i n g t o g
5
f
-
1, such t h a t a(G') = a(G)
-
1.
Such a d i r e c t
c o n s t r u c t i o n w i l l be d e s c r i b e d i n t h e n e x t s e c t i o n .
3. THE DIRECT CONSTRUCTION We s h a l l now d e s c r i b e a g r a p h t h e o r e t i c a l t r a n s f o r m a t i o n w h i c h a s s o c i a t e s w i t h a graph G ( w i t h n(G)
> 1 ) a n o t h e r g r a p h G ' such t h a t
a(G') = a(G)
-
1.
89
Pseirdo-boolean fiinctioris and stabi1it.v of'graphs Construction o f G ' : L e t a. al,
be an a r b i t r a r y node of G and l e t t h e neighbourhood o f a.
..., a , and P
let a
P+l
,...,an
s e t o f G ' w i l l c o n s i s t of ap+,
The node
c o n s i s t o f nodes
be t h e o t h e r nodes o f G.
,...,an,
as w e l l as o f a s e t o f "new"
nodes a . . ( 1 < j 6 p) a s s o c i a t e d t o a l l t h e p a i r s i , j o f non-adjacent nodes 1J a . , a . i n t h e neighbourhood o f ao. We s h a l l r e p r e s e n t t h i s s e t o f new nodes as 1 J b e i n g p a r t i t i o n e d i n t o " l a y e r i ' Li = l a . . ,..., a . . 1 c o n s i s t i n g o f a l l new nodes 'J1 lJk a . . h a v i n g i as t h e f i r s t i n d e x . 1J The edge-set o f G ' w i l l be d e f i n e d as c o n s i s t i n g o f ( 1 ) a l l t h e edges o f t h e subgraph o f G induced by ap+l,...,an; a. . ,a. . , (il# i,) '1J1 '2J2
( 2 ) a l l t h e edges l i n k i n g new nodes
b e l o n g i n g t o two d i f f e r e n t l a y e r s ; ( 3 ) edges l i n k i n g two
nodes a . . , a , . i n t h e same l a y e r i f a . and a . were l i n k e d i n G; ( 4 ) edges J2 1J1 'J2 J1 l i n k i n g a new node a . . t o a node a, 1J i n G.
( r > p f l ) i f ar was l i n k e d t o ai o r t o a . J
An example o f t h i s c o n s t r u c t i o n i s g i v e n i n F i g u r e 3.1 f o r t h e graph G o f F i g u r e 2.1; one v e r i f i e s t h a t a(G) = 3 and a ( G ' ) = 2 .
G'
F i g u r e 3.1 Whenever no c o n f u s i o n s can a r i s e , we s h a l l w r i t e ( i , j ) f o r a . . and i f o r ai. 1J Given any s t a b l e s e t S ' i n G ' , t h e r e e x i s t s a s t a b l e s e t S i n G
Proposition 3.1. with I S /
Proof. S = S'
=
I S ' I + 1.
i f S ' c o n t a i n s no new node, t h e n
L e t S ' be a s t a b l e s e t i n G ' ;
u
{ao? i s the required stable set.
necessarily o f the form ( i , j l ) , This means t h a t t i , j,, j,
s
( i , j,)
,..., j r i
= (5' - t ( i , jl),(i,
I f S ' c o n t a i n s new nodes, t h e y a r e
,..., ( i , j r )
w i t h j,
<
j, <
...
< jr.
i s a s t a b l e s e t i n G and
,..., ( i ,
j,)
i s a s t a b l e set o f G w i t h IS1 = I S ' I
+
1.
jr)l)
U {i,j,,
End o f o r o o f .
j2,...,jr)
Ch. Ebenegger eta!.
90 P r o p o s i t i o n 3.2.
Given any nonempty s t a b l e s e t S i n G, t h e r e e x i s t s a s t a b l e s e t
S ' i n G' w i t h I S ' / = I S 1
Proof.
-
1.
n (N(ao) u { a o ] ) ;
L e t S be a s t a b l e s e t i n G and So = S
i f So = 0, t h e n
b y removing any node of S, one g e t s a s t a b l e s e t S ' o f G ' w i t h I S ' I = ( S I
I f / S o l = 1, t h e n S ' = S
-
-
IS'I = IS/
So)U'(il.
-
1.
i2),(i,,
1.
So i s t h e r e q u i r e d s t a b l e s e t .
If So = !il,i2, ..., ir!w i t h r S' = (S
-
.,
2 and il
i 3 ) ,..., ( i l ,
i2 <
<
...
c
ir ' t h e n
i r ) ) i s a stable set o f G' with
End o f p r o o f .
As a consequence o f t h e above p r o p o s i t i o n s , we can s t a t e C o r o l l a r y 3.1.
F o r t h e graDh G' c o n s t r u c t e d from G we have a(G') = z(G)
-
1.
By r e p e a t e d l y a p p l y i n g t h i s c o n s t r u c t i o n , one may compute t h e s t a b i l i t y number o f G ( i n a t most d(G) 5 n s t e p s ) ; u n f o r t u n a t e l y t h e number o f nodes i s g e n e r a l l y
i n c r e a s i n g when t h e t r a n s f o r m a t i o n i s a D p l i e d .
However t h i s p r o c e d u r e combined
w i t h sane r e d u c t i o n s may g i v e an e f f i c i e n t a l g o r i t h m ; s e c t i o n 5 w i l l m e n t i o n s m e computational experiments.
4.
EQUIVALENCE
Our purpose i s t o show t h a t t h e r e d u c t i o n procedure d e s c r i b e d i n pseudo-Boolean terns i n Section 2 i s equivalent t o t h e c o n s t r u c t i o n o f G' g i v e n i n the previous section.
Consider t h e f u n c t i o n g ( x I,...,xn)
obtained i n Section 2 n
we w i l l determine t h e c o n f l i c t graph G a s s o c i a t e d w i t h g ( x l,...,xn).
Each T qr and each Ti corresponds t o a node o f G; so we see t h a t G has one node f o r each r ) o f neighbours o f a. w h i c h a r e n o t l i n k e d . These correspond t o p a i r q,r ( q t h e new nodes i n graph G' o f S e c t i o n 3. F u r t h e r m o r e G has nodes apel,ap+2,. . ,an
.
C l e a r l y t h e c o n f l i c t graph a s s o c i a t e d w i t h generated b y a p+l,.
IfZp+, Ti i s t h e subgraph
. . ,a n * T and Ti a r e i n > D) o f G. qr i f and o n l y i f ai i s l i n k e d t o
Consider now a new node (q, r ) and a node a: ( i c o n f l i c t ( i . e . (9. r ) and ai a r e l i n k e d i n either a
q
of G
6)
o r ar i n G s i n c e t h e y have t h e f o l l o w i n g form
91
Pseudo-boolean functions and stability ojgraphs
T . = x.
II a.EN(ai) J
1
F i n a l l y c o n s i d e r 2 terms Tij
and T
T.. = 1J
qr
x
>
p.
( w i t h i < j and q < r ) .
-
i~
X.X 1
with i
j
j sci S
i < t < jX t atEN( a .) J
and
a " W ar) t h e r e w i l l b e a c o n f l i c t i f and o n l y i f
xi
or
x.J appears
in T
(or
qr
xq
or
xr
appears i n T . . ) ; t h i s can o c c u r i f and o n l y i f e i t h e r i # q ( s o t h a t Xi appears 1J i n factor n of T if i < q or appears i n T . . i f i > q ) o r i f a j E N(ar) qr 9 1J u
x
xu
x
x
corresponding f a c t o r o f T . . i f j 1J
r).
>
These a r e p r e c i s e l y t h e c o n d i t i o n s under which t h e new nodes ( i . j) and (4, r ) a r e l i n k e d i n G ' as d e s c r i b e d i n S e c t i o n 2.
We have t h u s c o n s t r u c t e d a c o n f l i c t
graph G a s s o c i a t e d t o t h e f u n c t i o n g ( x l,...,xn)
which i s isomorphic t o G ' .
This
shows t h a t t h e c o n s t r u c t i o n s a r e e q u i v a l e n t . Remarks.
1)
I t i s i n t e r e s t i n g t o observe t h a t f o r a g i v e n G i f we u s e d i f f e r e n t o r d e r i n g s graphs G '
.
t h e same G.
...,a
o f node a. we may g e t n o t n e c e s s a r i l y isomorphic P F i g u r e 4.1 a ) and b ) show two d i f f e r e n t such graphs o b t a i n e d from
o f t h e neighbours al, Taking
f = 1
+
x x 1 3
+
x1x4
+
x,x2x3
- -
+
+ x x x x 1 2 3 4 we g e t
j; x x
1 2 4
92
x1
Cii. Ebenegger et al.
x2 G’
@
x3
F i g u r e 4.1 a ) However, t a k i n g f = 1 + x x
+ x,x3
t
X3x1x4 + X1x2x3 + x
x4 x3 G’
X x x ,we f i n d 1 3 2 4
@ 2.4
X
F i g u r e 4.1 b )
2)
One should observe t h a t if G i s a c l a w - f r e e graph, t h e n t h e graph G ’ o b t a i n e d by choosing a node a.
and o r d e r i n g i t s neighbours a r b i t r a r i l y i s n o t neces-
s a r i l y c l a w - f r e e as shown b y t h e examDle o f F i g u r e 4 . 2 .
However, one sees
e a s i l y t h a t when a p p l y i n g t h e t r a n s f o r m a t i o n t o G,in t h e r e s u l t i n g graph G ’ a l l new nodes form a c l i q u e K; i f K c o n t a i n s a s i m p l i c i a 1 new node ( i . e . a new node y whose neighbourhood i s a c l i q u e ) , t h e n y from G ’ and we g e t a graph G” w i t h
ic(G”)
= a(G)
IJ N ( y ) can b e removed
- 2.
93
Pseudo-boolean functions and stabiliti, of graphs
G'
Figure 4.2
One can a l s o show t h a t i f G i s the complement of a comparability graph, then f o r an appropriate choice o f node a o , the resulting graoh G ' i s s t i l l the complement of a comparability graph. However the number of nodes i n G ' may in general be l a r g e r than in G. 3)
I n the case where G i s a s e r i e s - p a r a l l e l graph ( s e e [a]), the transformation of G i n t o G ' leads t o a good algorithm. Series-parallel graphs always have a t l e a s t one node x with d G ( x ) 6 2. If dG(x) = 1 , l e t y be t h e unique neighbour o f x , then G ' = G - x - y. d G ( x ) = 2 , l e t y and z be the neighbours o f x; i f y and z a r e linked, G' = G
- x -
y
- z
If
and i f they a r e n o t , nodes x, y and z of G a r e replaced by
the new node ( y , z ) in G ' .
Thus in a l l cases, G ' has l e s s nodes than G and one v e r i f i e s t h a t G ' i s s t i l l a s e r i e s - p a r a l l e l graph ( i . e . i t contains no homeomorphic image of K4; see
'
PI 4) The above described procedure can be extended t o the weighted case a s well. A simple way t o do t h i s i s t o consider a node a. with weight
Ch. Ebenegger et al.
94
wo = min!wilai
?I(ao)
E
u
{ a o } } where wi
w i t h G a graph G such t h a t 3w(G) = aw(G) f(xl,x2
,...,xn)
L e t aw(G)
i s t h e w e i q h t o f node ai.
The c o n s t r u c t i o n w i l l a s s o c i a t e
b e t h e maximum w e i g h t o f a s t a b l e s e t i n G.
-
wo.
S t a r t i n g from t h e f u n c t i o n
a s s o c i a t e d w i t h G, we can w r i t e
=
P
wo .l Ti i=O
e
+ 1
(wi i=l
-
n
wO)Ti
O
q,r
wiTi
=
i=p+l F
1
= w o t w
1
+
Tqr +
1=1
(wi
-
n wO)Ti
+
1
i=p+l
wiTi,
,.
where N(ao) = l a l
The a s s o c i a t e d graph G c o n t a i n s nodes al,
...,a P w i t h
weights
,...,wn
- wo,...,wp - wo, nodes a P+1 ,...,an w i t h w e i g h t s w P+ 1 new nodes ( q , r ) as i n t h e unweighted case w i t h w e i g h t wo.
w1
and t h e same
Furthermore t h e edges o f G a r e o b t a i n e d b y t a k i n g t h e subgraph generated b y {al,
...,a n
'8
=
-
X
{ao', and by l i n k i n g t h e new nodes (9, r ) i n t h e same way as
i n t h e unweighted case.
I t i s t h e n easy t o see t h a t aw(G) = aw(G)
-
wo b y
o b s e r v i n g t h a t i f new nodes ( i , j l ) ,...,( i, jr) a r e i n s t a b l e s e t S , t h e n t h e nodes i, j
5.
,,..., jr
can b e i n c l u d e d i n
s.
COMPUTATIONAL RESULTS
The t r a n s f o r m a t i o n o f G i n t o G ' d e s c r i b e d i n s e c t i o n 3 i f a m l i e d r e p e a t e d l y may b e used f o r computing a { G ) . A few experiments have been r u n , b u t no s p e c i f i c e f f o r t was made y e t t o e v a l u a t e
Before applying
t h e e f f i c i e n c y of t h e method o r compare i t w i t h o t h e r a l g o r i t h m s .
t h e t r a n s f o r m a t i o n f r o m G t o G ' we s y s t e m a t i c a l l y used t h e f o l l o w i n g two reductions : R e d u c t i o n RO.
I f x is isolated, x i s eliminated ( s i n c e u(G
-
x) = a(G)
-
1 and
we t a k e G ' = G - x ) .
I f x has degree 1, x and i t s neighbour y a r e removed ( s i n c e a ( G we t a k e G' = G
-
-
x
y).
-
x
-
y ) = a ( G ) -1,
T h i s amounts t o s a y i n g t h a t we t r y t o a p p l y i n p r i o r i t y
t h e t r a n s f o r m a t i o n t o nodes o f degree 0 o r 1 . p e d u c t i o n R1. (see [3]). N(x) - { y j g N ( y )
-
I f x and y a r e nodes of G = ( X ,
{ x i , t h e n a(G
-
E ) such t h a t [x,
y ) = a(G) and one may remove y frm G .
y]
E
E,
Pseudo-boolean functions and stability o f graphs
Random graphs.
95
F o r t h e computer experiments, random graphs have been g e n e r a t e d
i n t h e u s u a l way by a s s i g n i n g a p r o b a b i l i t y f o r a p a i r of nodes t o be a d j a c e n t .
A l l experiments were performed on a
CPC Cyber 7326; we r e p o r t i n T a b l e 1 t h e
r e s u l t s o b t a i n e d f o r graphs w i t h 40 nodes.
F o r d e n s i t i e s o f 0.1 o r 0.9, one
c o u l d d e a l w i t h graphs having 70 t o 90 nodes i n t h e same t i m e as one c o u l d h a n d l e graphs o f d e n s i t y 0.5 w i t h about 45 nodes. density
a(G)
0.1 0.2
18
0.3 0.4
no. o f t r a n s f . G G' +
t o t a l no. o f added nodes
2 10
13 10
0.6 0.7 0.8 0.9
37.6 43.8
92
161.5 85.6 40.7
70
5
52 28 12
3 2
2 2 2 3 5 3 2 2 2
0.5 9.9
76
4 3
no. o f graphs generated
0 11 32
8 7 6
0.5
CP t i m e
14.7 3.9
Graphs w i t h 40 nodes ( r e d u c t i o n RO
-
R1)
Table 1 The r e s u l t s o b t a i n e d so f a r show t h a t t h e number o f nodes which a r e i n t r o d u c e d d u r i n g t h e successive t r a n s f o r m a t i o n s (no. o f new nodes c r e a t e d e l i m i n a t e d ) may be l a r g e .
-
no. o f nodes
T h i s does n o t seem t o be c r i t i c a l from a c o m p u t a t i o n a l
p o i n t o f view; we have t r i e d t o use more r e d u c t i o n s (namely r e d u c t i o n s R2 and R3 d e s c r i b e d i n t h e remark below) b e f o r e a p p l y i n g t h e t r a n s f o r m a t i o n .
The r e s u l t was
t h a t t h e number o f nodes i n t r o d u c e d c o u l d keep much l o w e r values, b u t t h e computing times increased dramatically.
I t seems t h e r e f o r e t h a t t h e b e s t t e c h n i q u e would b e
t o u s e o n l y a few r e d u c t i o n s i n such a procedure.
I t should however be k e p t i n
mind t h a t a l l t h e s e r e s u l t s a r e s t i l l fragmentary; more experiments should b e p e r formed b e f o r e g e t t i n g t o f i r m c o n c l u s i o m r e l a t e d t o t h i s approach t o t h e s t a b i l i t y number o f graphs.
I t may a l s o b e w o r t h w h i l e c a r r y i n g o u t experiments f o r s p e c i a l
c l a s s e s o f graphs. Remark.
As mentioned, a few o t h e r r e d u c t i o n s have been t r i e d i n c o n j u n c t i o n w i t h
t h e t r a n s f o r n a t i o n ; t h e y were abandoned because t h e t i m e spent t o check i f t h e y c o u l d b e a p p l i e d was n o t compensated b y t h e i r advantages. Reduction R2: [2]. N(y)
U N(z) -
I f a node x has 2 neighbours y,
( N ( x ) U { x i ) i s a c l i q u e , then a(G
-
z such t h a t
x) =
a(G)
b, z]h
E,
and one may remove x
f r a n G. N o t i c e t h a t R2 i s a s p e c i a l case o f Lemma 7 o f [3]. Reduction R3: (Lemma 12 i n r3]).
Since i n o u r a l g o r i t h m we r e p e a t e d l y use t h e
96
Clr. Ebenegger et al.
t r a n s f o r m a t i o n o f G i n t o G ' ( w h i c h s h o u l d g i v e us a c l i q u e i n t h e l a s t s t a g e ) , i t may be h e l p f u l t o t r y t o i n t r o d u c e edges e i n G i n such a way t h a t
a(G
+ e)
= a(G)
( h e r e G + e i s t h e g r a p h o b t a i n e d by i n t r o d u c i n g an edge e between 2 nodes o f G). T h i s o p e r a t i o n s h o u l d a l s o p r e v e n t t h e number o f new nodes f r o m i n c r e a s i n g t o o fast. Since t h e transformation G
I
G' i s n o t one-to-one,
we may t r y t o c o n s t r u c t a G ' and
and go back t o a G h a v i n g more edges t h a n G, f r o m which we may o b t a i n an a l t e r n a t i v e G ' p o s s i b l y w i t h l e s s new nodes.
An example o f t h i s i s g i v e n i n F i g u r e 5.1:
f r o m G1 we o b t a i n G ' , b u t we may i n t r o d u c e edges [ Z , 4 l and [3,q
G2 which corresponds a l s o
50
we examine e v e r y node x
(N(a,)U
t
G'.
and g e t a graph
More p r e c i s e l y , when c o n s t r u c t i n g G ' f r o m G,
...
u
N ( a p ) ) - N(ao) ; i f t h e r e i s a node
a . t N(ao) - N(x) such t h a t i n 6 ' x i s l i n k e d t o e v e r y new node o f t h e f o r m ( c , j) .I o r ( j , c ) , t h e n edge -x, a.? may be i n t r o d u c e d i n t o I;. 3
Figure 5.1 ACKNOWLEDGEMENTS The a u t h o r s would l i k e t o express t h e i r g r a t i t u d e t o N. S b i h i f o r c a l l i n g t h e i r a t t e n t i o n t o t h e s p e c i a l i s a t i o n o f t h e t r a n s f o r m a t i o n t o s e r i e s - p a r a l l e l graDhs and t o A. H e r t z a t E . P . F . L .
who r a n t h e computer experiments w i t h a g r e a t
e f f i c i e n c y and a l o t of enthusiasm. s t i m u l a t i n g r e s e a r c h atmosohere.
S p e c i a l thanks a r e due t o E.P.F.L.
for the
T h i s r e s e a r c h was c a r r i e d o u t w h i l e P.L. Hammer
was v i s i t i n g t h e Ecole P o l y t e c h n i q u e F e d e r a l e de Lausanne.
Pseudo-boolean functions and stabilitj, of graphs
91
REFERENCES Berge, C., Graphs and Hypergraphs (North-Holland, Amsterdam, 1973). B i l l i o n n e t , A., Reductions e t conditions d'optima i t e dans l e Probleme de l ' e n s m b l e s t a b l e de poids maximal, R . A . I . R . O . 15 (1981) 213-231.
B u t z , L . , Hammer, P . L . , and Hausmann, D . , Reduction methods f o r t h e vertex packing problem, University of Bonn, I n s t i t u t f u r kkonometrie u n d ODerations Research, Report 7540, (1975). Chvatal, V., On c e r t a i n polytopes associated with graphs, J . o f Combinatorial Theory B 18 (1975) 138-154. Harmer, P . L . , and Rudeanu, S . , Boolean methods in Operations Research (Springer-Verlag, New York, 1968). Hamor, A. and Leorith, P., S t o r i e s o f t h e one-zero-zero-one nights: Abu Boul in Graphistan, in: Hansen, P., de Werra, D . ( e d s . ) , Regards sur l a theorie des graphes (Presses Polytechniques Romandes, Lausanne, 1980).
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 99- 114 0 Elsevier Science Publishers B.V. (North-Holland)
99
INDEPENDENCE SYSTEMS AND PERFECT k-MATROID-INTERSECTIONS R. E u l e r
Mathematisches I n s t i t u t d e r U n i v e r s i t a t zu Koln Weyertal 86 5 Koln 41 West Germany
We g e n e r a l i z e s t a b l e - s e t independence systems o f p e r f e c t graphs, 2 - m a t r o i d - i n t e r s e c t i o n s and matching independence systems t o t h e c l a s s o f k-matroid-intersections, which a r e p e r f e c t r e l a t i v e t o t h e k-matroids g i v e n . I t i s shown t h a t a p o l y h e d r a l d e s c r i p t i o n o f such an independence system i s g i v e n by t h e i n t e r s e c t i o n o f t h e corresponding m a t r o i d p o l y h e d r a and t h a t a r e l a t e d l i n e a r system has t h e p r o p e r t y o f t o t a l d u a l i n t e g r a l i t y ( T D I ) . Conversely, i f such a l i n e a r system i s known t o have t h e T D I - p r o p e r t y , t h e n t h e r e s u l t i n g independence system i s shown t o be p e r f e c t r e l a t i v e t o t h e matroids given.
INTRODUCTION The t h e o r i e s o f p e r f e c t graphs, 2 - m a t r o i d - i n t e r s e c t i o n s
and matchings i n graphs
c o n s t i t u t e three s i g n i f i c a n t cornerstones w i t h i n combinatorial optimization. T h i s paper aims t o r e l a t e t h e u n d e r l y i n g c l a s s e s o f independence systems t o each o t h e r by g e n e r a l i z i n g t h e n o t i o n o f p e r f e c t i o n t h e r e b y g i v i n g some h i n t s on how t h e d i f f e r e n t concepts and r e s u l t s m i g h t be combined t o a s i n g l e t h e o r y . Given a f i n i t e s e t E = {el p a i r (EJ)
,... ,en} J ~
A set X
c_
and a nonempty system
3
o f subsets o f E t h e
i s c a l l e d an independence system, if
E i s independent, i f X
1
~
J2 €7. -
€ 3 , dependent o t h e r w i s e .
A base o f X, X
c
E,
i s a maximal independent subset o f X ( a base o f E i s s i m p l y c a l l e d a base) and a c i r c u i t o f (E,Yj i s a minimal dependent subset o f E (maximal and m i n i m a l w i t h respect t o s e t i n c l u s i o n ) . (EJ)
w i t h R resp. C.
We denote t h e systems o f bases resp. c i r c u i t s o f
An element e ez E i s c a l l e d
no c i r c u i t c o n t a i n i n g i t .
free ( i n
The r a n k - f u n c t i o n o f (E,3)
(EJ)),
i f there i s
i s d e f i n e d f o r a l l X G E by
r ( X ) = m a x { ( I I : 1 ~ 2 1, s x } . A matroid
(EJ) i s an independence system such t h a t f o r any X
have t h e same c a r d i n a l i t y .
I f k m a t r o i d s (E,Jl)
,...,( EJk)
E a l l bases o f X and ( E J ) a r e g i v e n Q
100
R. Eider k
n yi,
such t h a t 3 =
then (EJ)
i s called a k-matroid-intersection.
i=l
A graph G = (E,C) c o n s i s t s o f a f i n i t e s e t E, t h e v e r t i c e s , and a system C o f 2-element subsets of E, t h e edges. F o r X c_ E, G[X] denotes t h a t subgraph o f G, A c l i q u e o f G i s a subgraph o f G, i n w h i c h any two d i s -
which i s induced b y X .
t i n c t v e r t i c e s a r e j o i n e d b y an edge, i . e .
t h e c o r r e s p o n d i n g 2-element s e t i s i n
A s t a b l e s e t o f G i s a s u b s e t o f E such t h a t , i n G, no two o f i t s v e r t i c e s
C.
a r e j o i n e d by a/n edge.
If A
=
i s a f a m i l y of n o t n e c e s s a r i l y d i s t i n c t subsets o f E, t h e n
(E, ,...,Em)
T = E i s called
a transversal o f A , i f there e x i s t s a b i j e c t i o n 4 : T
-&
{ l , ...,m i
such t h a t t e E
f o r a l l t ET. 6(t) A p a r t i a l t r a n s v e r s a l o f A i s s i m p l y a t r a n s v e r s a l o f a s u b f a m i l y o f A . A part i t i o n (Xi, i = 1, . . . ,k ) o f X , X C - E , i s a f a m i l y of p o s s i b l y empty subsets o f X such t h a t t h e members o f i t a r e p a i r w i s e d i s j o i n t and t h e i r u n i o n i s t h e whole set X. B a s i c r e f e r e n c e s t o t h e s e concepts a r e t h e books o f Berge [l] and Welsh 0 7 1 .
INDEPENDENCE SYSTEMS, WHICH ARE PERFECT RELATIVE TO A SET OF MATROIDS D e f i n i t i o n 2.1. and c = (c,,..
L e t (E,Y)
. ,cn)
dence system (ECJc)
Nn.
E
be an independence system, C i t s system o f c i r c u i t s b y c i s a new indepen-
Then a m u l t i p l i c a t i o n o f (EJ)
formed as f o l l o w s :
i ) IfC I = ii: i E ' 1 , ..., n and c .1 > 1 , a n d m = I C I I , we e n l a r g e E b y m p a i r w i s e d i s j o i n t s e t s o f new elements, E i j , o f c a r d i n a l i t y c 1. . -1 f o r j = 1, ...,r n * 3 m i.e. E i s e n l a r g e d t o Ec :
=
E
u (u
E f , ) , where E '
j=l
ii)
J
: = j
B f o r i, 6 CI; J
o v e r EL we form a system C c o f c i r c u i t s as f o l l o w s : choose an element. il o f C I and add t h e system to
t h e n choose i 2 out o f C I \ { i l l
.
i 'l"2
: =
u
l(C\el
and add
)U!e'.
2
e'eE;
c;
: C
eCUCi
and ei 1
E
C i t o C U Ci
2
1
2 and so on u n t i l we o b t a i n an independence system (Ec,Jc)
having
101
Itidepetidence systems and perfect k-matroid-irztersectio~zs
as system Cc o f c i r c u i t s . We n o t e t h a t i f (E,1)
,...,
i s g i v e n as t h e i n t e r s e c k i o n o f t h e k m a t r o i d s (E,C1)
t h e n ( E .f ) i s t h e i n t e r s e c t i o n o f ( n ci)k=:kc many m a t r o i d s o v e r Ec, c c '-1 i s , up t o isomorphism, uniquATy determined. More s p e c i f i c a l l y ,
(E,Ck),
and t h a t (Ec,&)
t h e c o n s t r u c t i o n o f (Ec,)c)
may be viewed as s u b s t i t u t i n g a t r a n s v e r s a l o f t h e
family A = ({ellU Ei
f o r t h e s e t {el, C
E
...,en]
EA)
u
$ - ' ( j ) f o r t h e corresponding c i r c u i t s e .EC J Ci and i = 1, ... ,k (which we w i l l o f t e n r e f e r t o as s u b s t i t u t i n g T f o r
{ ely...
,en}),
as w e l l as
,..., { e n j u
then e n l a r g i n g t h i s new ground s e t t o E c by a d j u n c t i o n o f t h e
remaining elements as f r e e elements and f i n a l l y t a k i n g t h e i n t e r s e c t i o n o f these E q u i v a l e n t l y , one c o u l d c o n s t r u c t t h e i n t e r -
m a t r o i d s f o r a l l t r a n s v e r s a l s o f A.
s e c t i o n of a l l s u b s t i t u t i o n s f o r a f i x e d m a t r o i d and then t a k e t h e i n t e r s e c t i o n of t h e r e s u l t i n g k i n t e r s e c t i o n s .
Note t h a t f o r c = (1,
and, c l e a r l y , t h e c o n s t r u c t i o n o f (Ec,Jc)
...,1 ) ,
(Ec,&)
(€,2),
=
i s independent o f t h e o r d e r o f t h e
... ,im.
numbers il,
F o r t h i s and t h r o u g h o u t t h e L e t us now c o n s i d e r such a m u l t i p l i c a t i o n (Ec,Jc). i for i= 1 ,n and Ec = { e i ,e;(c)j, where f o l l o w i n g l e t E; = {el ,... ,eli-l}
,...
n
z(c):=
c c.,1 b e such t h a t f o r i = 1 ,... ,n i=l i e' = e. and e;-+j = ej-l i-1
where
yi
=
y.tl 1
z cm. m= 1
1
m a t r o i d s such t h a t 2 = (Ec,'Jc)
for
j = 2,...,ci,
1
Then t h e f o l l o w i n g h o l d s :
L e t (E$)
P r o p o s i t i o n 2.2
,...
be an independence system, (E,J1)
.qyi and c
1=
E
Bn,
,... ,(E,2k)
be
Then a m u l t i p l i c a t i o n o f
C'E
by c ' i s i d e n t i c a l t o a m u l t i p l i c a t i o n o f (E,Y) by a v e c t o r c "
E
INn,
which i s g i v e n by c" = (
c e;E{elWEi
P r o o f W.1.o.g.
c;
,..., e;
E I
I: en)UE;
C;).
we can r e s t r i c t o u r s e l v e s t o a v e c t o r c ' o f t h e form
c ' = ( c i ,...,c ' ,1,...,
1).
I f we now m u l t i p l y (Ec,Jc)
by ( c i , l
,...,l ) ,
rnatroids remain unchanged, where el has been s u b s t i t u t e d b y an element e
a l l those E
Ei,
102
and
R. Eider n
(.x
1=2
S i n c e we now add a s e t o f new elements EA+l
t o Ec, n can b e s u b s t i t u t e d f o r el and t h i s y i e l d s ( c i - 1 ) ( n c . ) k i=2 1
ci)k many a r e l e f t . Er;+l
a l l elements e
new m a t r o i d s .
However, we c o u l d have o b t a i n e d t h e same i n t e r s e c t i o n o f m a t r o i d s ,
i f we had mu?t i p 1 i e d (E,'J a l s o v a l i d f o r c i ,..., c;
. . ,cn).
b y ( c l + c i - l ,c2,.
, multiplying
(E,j)
d i r e c t l y by (
i s i d e n t i c a l t o m u l t i p l y j n g (E,?)
Since t h i s argumentation i s by ( c i ,..., c ' ,1,,1) c1 c; ,c 2 " . . ,cn) 9
b y c and (Ec,7,) C
e;Elel l U E i
p r o v i d e d t h e c o r r e s p o n d i n g s e t s of new elements a r e chosen a p p r o p r i a t e l y . S i m i l a r l y , we f i n d t h a t a m u l t i p l i c a t i o n o f (Ec,Jc)
by c'
E
gUZ(')
can as w e l l b e
o b t a i n e d by m u l t i p l y i n g ( E , j ) by c" as g i v e n above.
Let
D e f i n i t i o n 2.3
(E,q
m a t r o i d s such t h a t 1 = r e l a t i v e t o (E,?)
be an independence system and (E,Yl),...,(E,2k)
n 2.. Then
i s s a i d t o have t h e max-min-property
1=l 1
,... , ( E , j k ) ,
r(X) =
(EJ)
be
if
k m in 1 ri(Xi) (Xi,i=l, ..., k ) i=l
f o r a l l X C E,
i s a partition of x where r resp. ri i s t h e r a n k - f u n c t i o n o f (EJ)
D e f i n i t i o n 2.4 m a t r o i d s such
L e t (E,>)
resp. (E,Yi),
be an independence system and (E,yl)
k t h a t ;1= .n3..Then 1=k
i = 1 ,... ,k.
,...,( E,Jk)
be
we c a l l (E,^3) p e r f e c t r e l a t i v e t o (E,gl),.
(E,jk), i f f o r a l l c E N " any m u l t i p l i c a t i o n of m i n - p r o p e r t y r e l a t i v e t o (Ec13,) ,. .. ,(EC,gk 1.
(EJ)
b y c, (EcJc),
.. ,
has t h e max-
C
Obviously, f o r any X G E t h e r e s t r i c t i o n (XJX) (EJ),
given b y Y X : = { I € 3 : I
m a t r o i d s , b u t r e s t r i c t e d t o X.
C o r o l l a r y 2.5
G
Moreover, b y P r o p o s i t i o n 2.2 we i m m e d i a t e l y o b t a i n
Any m u l t i p l i c a t i o n (Ec,JC)
o f an independence system (E,J),
i s p e r f e c t r e l a t i v e t o t h e m a t r o i d s (E,jl) c o r r e s p o n d i n g m a t r o i d s (Ec,J1)
o f such an independence system
i s p e r f e c t r e l a t i v e t o t h e same s e t o f
XI,
,. . . ,(
E
,...,( E , j k ) ,
which
i s perfect relative t o the
J ). kc
We remark a t t h i s p o i n t t h a t an independence system (E,J)
need n o t b e p e r f e c t k r e l a t i v e t o any s e t of m a t r o i d s (E,Il) ,...,( E,&) such t h a t 7 = .n1., a l t h o u g h 1=1 1 i t i s p e r f e c t r e l a t i v e t o some s p e c i f i c such s e t . However, i f (EJ) i s p e r f e c t
103
Independence systems and perfect k-matroid-intersections r e l a t i v e t o (EJ1) (E,jk),
...,
,..., (E,gk),
(E,rkJ,such
gi.
that’J=.r)
t h e m a x i n i n - p r o p e r t y n o t o n l y fo:=IE,’I1) multiplications.
,...,
t p n t h i s i s t h e case f o r any s u p e r s e t (EJl)
Besides, i t i s r e a l l y necessary t o c l a i m i t s e l f , b u t a l s o f o r a l l o f i t s proper
To see t h i s c o n s i d e r f o r i n s t a n c e those m a t r o i d s (E,7A), which
c x 6 r ( A ) , i . e . whose systems o f c i r c u i t s j u s t eEA e c o n s i s t o f a l l subsets o f A h a v i n g c a r d i n a l i t y r ( A ) + l , and r e l a t i v e t o which (E,2)
a r e induced by t h e i n e q u a l i t i e s has always t h e max-min-property.
One s t a r t i n g p o i n t f o r i n t r o d u c i n g t h i s concept o f p e r f e c t i o n has been t h e c l a s s of s t a b l e set-independence systems ( E J )
o f p e r f e c t graphs, i . e .
those graphs,
f o r which minimum number o f c l i q u e s i n r ( X ) = G[X] needed t o cover t h e s e t X
for all
cE,
C l e a r l y , (E,T) can be r e p r e s e n t e d as t h e i n t e r s e c t i o n o f t h o s e m a t r o i d s , whose system o f c i r c u i t s a r e g i v e n by t h e edges o f a maximal c l i q u e . {K1,
...,K k l
has t h e max-min-property r e l a t i v e t o (E,jl) ,... ..., k. By a lemma o f Berge
n o t d i f f i c u l t t o see t h a t (EJ) (EJk), (cf.
[l])
Moreover, i f
i s t h e s e t o f a l l maximal c l i q u e s i n a p e r f e c t graoh G, t h e n i t i s
where
(E,Yi)
,
i s induced by Ki f o r i = 1,
t h e m u l t i p l i c a t i o n o f (E,’JI) by c €LNn i s a g a i n t h e s t a b l e - s e t indepen4
dence system o f a p e r f e c t graph Gc, whose maximal c l i q u e s correspond, up t o r e p e t i t i o n s , t o t h e m a t r o i d s (Ec,’Ji),
i = 1 ,... ,kc.
Hence, (Ec,Zc) has t h e max-
,. . . ,(E ,2 ) and, t h e r e f o r e , (E,2) i s p e r f e c t
m i n - p r o p e r t y r e l a t i v e t o (Ec,fl)
kc i n t h e sense o f D e f i n i t i o n 2.4.
r e l a t i v e t o (E,Y1), ...,( EJk)
A POLYHEDRAL DESCRIPTION I n t h i s s e c t i o n we w i l l prove t h a t a p o l y h e d r a l d e s c r i p t i o n o f an independence system (EJ),
which i s p e r f e c t r e l a t i v e t o (E,jl)
c
xe 6 r l ( A )
for all
,...,( E , j k ) , AS
i s g i v e n by
E,
eEA
c xe
4 rk(A)
(3.1)
f o r a l l A G E,
eEA xe
3
0
for all e
E
where ri i s t h e r a n k - f u n c t i o n o f t h e m a t r o i d (E,Ti),
E,
i = 1,
... ,k.
r e f e r t o a theorem, which has a l r e a d y been used b y Edmonds [4],
For t h i s we
Chvdtal [2]
others:
Theorem 3.2
L e t S be a f i n i t e s e t o f s o l u t i o n s x
E
W”
o f t h e system o f
and
R. Euler
104
i nequal i t i e s
xe aiexe
I
B
f o r a l l e c E,
0
for all i
\c b .
1
eF E
(3.3)
I.
E
Then the s e t of a l l s o l u t i o n s of ( 3 . 3 ) i s t h e convex hull of S i f and only i f , n f o r every vector c r Z we h a v e max =
ICX :
min
i
x
-
iLI
E
Si
W ic1,
b. : li:O i i
x
~
~
aW ~ ek.E?.~
a
c
~
icI
n Now l e t c = ( c l ,..., c n ) E 72 . W.1.o.g. we can d e l e t e a l l 5 0 - c o e f f i c i e n t s of c and go over t o t h e corresponding r e s t r i c t i o n (E;2E,). I n a d d i t i o n , we can d e l e t e the f r e e elanentsof ( E , j ) as well as t h e i r c o e f f i c i e n t s in c , s i n c e e s t a b l i s h i n g t h e max-min-equality in Theorem 3.2 f o r such a r e s t r i c t i o n (E"JE,,) of (E,Y) will immediately lead t o the r e l a t e d one f o r (E,X). I t i s now our aim t o apply Theorem 3.2 t o the system of i n e q u a l i t i e s ( 3 . 1 ) and v i a the max-min-equality given t h e r e show (3.1) t o represent a polyhedral desc r i p t i o n of (E,?I), i . e . the v e r t i c e s of t h a t polyhedron correspond exactly t o the independent s e t s . For t h i s we multiply ( E J ) by c and obtain ( E c J C ) . Let t h e r e s u l t i n g k c matroids be indexed such t h a t any of the following blocks of k of than, ( Ec,jl
1,. . . * ( E c , 3 k )
. .. ;( Ec*Ikc-k+l correspond to
(E,7,),. . . , ( E , & ) ,
3 .
; ( Ec,lk+l ) 9 .
'.*(E
..
3
(Ec,Y2k) ;
kc
i .e. ( E c J 1 ,(Ec$xk+l1 ,. . . ,(
Ec'flkc-k+,)
arise
from ( E J 1 ) by s u b s t i t u t i n g E by a transversal T i of A , where { T . ) . is a 1 1 = 1 , ... fixed sequence of a1 1 t r a n s v e r s a l s of A , ( Ec,y2),( Ec,gk+2) ,. . . ,( E c ,lkc-k+2) in exactly the same way, and so on.
a r i s e from ( E J 2 )
Claim 3.4
Proof
Let I
L
z c and
i z 1.1,. . . , n i .
Now we s t a t e the following
Then
By assumption, t h e r e e x i s t s a c i r c u i t C of (Ec,JC) i n IU : e l . B u t then, by d e f i n i t i o n o f (Ec,&), the set ( C \ i e ? ) U i e ' ! i s a l s o a c i r c u i t of (Ec,&)
105
Iirdependence systems and perfect k-matroid-in tersections for a l l e'
( I e i } U E i ) , which proves t h e c l a i m .
E
Claim 3.4 says t h e f o l l o w i n g :
(Bn E)
If B i s a base of Ec, IBI = r c ( E c ) , t h e n
E
3
and, i n p a r t i c u l a r ,
161 = cxgnE, where xBnE i s t h e i n c i d e n c e v e c t o r o f BnE.
What we s t i l l need i s a
s o l u t i o n y o f t h e system o f i n e q u a l i t i e s 1
YA k
i = 1 ,..., k,
(3.5)
i
z
c
for all A GE,
3
yA >, c j
f o r a l l j = 1,
..., n
i=l e.EAcE J such t h a t
k 161 =
C
L e t (Ei,
i = l,...,kc)
c
c
yb r i ( A ) .
i=lAGE
be a p a r t i t i o n o f E c s a t i s f y i n g rc(Ec) =
kC
c
ri(EF).
i=1
,..., (Ec,Ijtk),
To any b l o c k o f k m a t r o i d s (Ec.Ijtl)
j = O,k,Zk
,..., kc-k,
there
o f A , which has been s u b s t i t u t e d f o r E i n (j/k)+l and a l l these t r a n s v e r s a l s a r e d i s t i n c t . i n a d d i t i o n , t o any element
e x i s t s a unique transversal T (EJ),
eEEc t h e r e i s a t l e a s t one b l o c k o f k r n a t r o i d s , i n whose i n t e r s e c t i o n e i s n o t a f r e e element. Now c o n s i d e r t h e s e t s
blockwise.
Then, o b v i o u s l y , e
E
Ec i s c o n t a i n e d i n one o f t h e s e t s , say E g .
3.
'f
such t h a t e i s n o t f r e e i n fl belongs t o a b l o c k o f k s e t s EC ,..., Eilk J+1 i=l I f , however, t h i s i s n o t t h e case, i . e . e i s ., we l e a v e e i n t h a t s e t E i .
t h i s E: J+1
f r e e i n t h a t i n t e r s e c t i o n , we can t a k e i t o u t f r o m E:
and p u t i t i n a s e t E:,
such t h a t e i s n o t f r e e i n t h e corresponding i n t e r s e c t i o n . T h i s i s p o s s i b l e f o r kC C a l l e E Ec w i t h o u t i n c r e a s i n g t h e v a l u e Now, l e t (E:, i = l,...,kc) ri(Ei). be a l r e a d y m o d i f i e d a c c o r d i n g l y .
j=l
Then i n any o f t h e s e t s E F t h e r e can be a t most
one element f r o m { e i } U E; f o r i = 1,. ..,n.
Now we r e p l a c e i n any o f t h e s e t s
Ei t h e elements e ' f r o m E; b y t h e corresponding ei, r e s u l t i n g f a m i l y (At,
t = l,...,kc)
i = 1, ..., n, and c o n s i d e r t h e
( o f n o t n e c e s s a r i l y d i s t i n c t subsets o f E ) , k -1. t = l , k t l , ...,p k t l ) , where p = To any
"4
i n p a r t i c u l a r t h e s u b f a m i l y (At, 1 A s E we a s s i g n t h e v a l u e yA, which i s equal t o t h e number o f times A i s o c c u r r i n g i n t h a t subfamily.
Clearly, rl(At)
=
rt(Ei)
for t
=
1 ,k+l,.
.. ,pk+l,
106
R. Eulcr
and i n t h i s manner we o b t a i n a number o f d u a l v a r i a b l e s f o r t h e system o f inequalities
z
f o r a l l A 6 E.
x e \c r l ( A )
eEA Next, we c o n s i d e r t h e i n d i c e s 2,k+2, ...,p k+2 and f i n d a v e c t o r yf\, and so on, ,Ek u n t i l we have y
E
WL
, which i s
f e a s i b l e f o r (3.5).
Since
k
we have, t o g e t h e r w i t h Theorem 3.2:
Theorem 3.6
L e t (E,’3) be an independence systen,which i s p e r f e c t r e l a t i v e t o t h e
m a t r o i d s (E,S1)
,... ,(E,’jk).
Then a p o l y h e d r a l d e s c r i p t i o n o f (EJ),
convex h u l l of t h e i n c i d e n c e v e c t o r s o f a l l members o f f ,
i.e.
the
i s g i v e n by ( 3 . 1 ) .
I t f o l l o w s , t h a t a l s o t h e f o l l o w i n g l i n e a r system c o n s t i t u t e s a p o l y h e d r a l
d e s c r i p t i o n of such an (E,T):
x
e
3 0
for all e
E
E.
TOTAL DUAL INTEGRALITY D e f i n i t i o n 4.1
L e t A r e s p . b be a r a t i o n a l - v a l u e d mxn-matrix r e s p . m-vector.
Then we say t h a t t h e l i n e a r system Axgb has t h e p r o p e r t y o f t o t a l d u a l i n t e g r a l i t y (TDI), i f , f o r any i n t e g e r o b j e c t i v e f u n c t i o n c such t h a t max{cx: Axsbl e x i s t s , t h e r e i s an i n t e g e r optimum dual s o l u t i o n . T h i s p r o p e r t y has been i n v e s t i g a t e d w i t h i n t h e c o n t e x t o f 2 - m a t r o i d - i n t e r s e c t i o n s by G i l e s
[8l
( s e e a l s o [16]),
o f submodular f u n c t i o n s on g r a p h s b y Edmonds and
G i l e s [7l and o f i n t e g e r p o l y h e d r a by G i l e s and P u l l e y b l a n k [ll]. I n p a r t i c u l a r , S c h r i j v e r [15]
has shown t h a t any r a t i o n a l p o l y h e d r o n i s t h e s o l u t i o n s e t o f a
unique m i n i m a l i n t e g e r l i n e a r system h a v i n g t h e T D I - p r o p e r t y . The p r o o f o f Theorem 3.6 shows t h a t , i f (E,’2) i s p e r f e c t r e l a t i v e t o m a t r o i d s
( E J , ) , . .. , ( E , & ) , t h e n t h e l i n e a r system ( 3 . 1 ) has t h e T D I - p r o p e r t y . Moreover, as i n t h e case o f 2 - m a t r o i d - i n t e r s e c t i o n s (see 0 6 ] ) , a l s o t h e l i n e a r system (3.7) has t h e T D I - p r o p e r t y .
107
Independence systems and perfect k-ma troid-in tersections
L e t us now deduce a converse r e l t i t i o n :
Theorem 4 . 2
I f t h e l i n e a r system ( 3 . 1 ) has t h e T D I - p r o p e r t y , t h e n (E,Y)
proof BY T D I , we have f o r e v e r y v e c t o r c
is
,... , ( E , l k ) .
p e r f e c t r e l a t i v e t o t h e g i v e n m a t r o i d s (E,j,)
LNn
E
max {cx : x i s t h e i n c i d e n c e v e c t o r o f an independent s e t } k = min
I c
c yAi ri(A)
k :
z
z
i >, c j yA
f o r j = 1,
i yA 3 0
f o r a l l A&,
...,n,
i=l e .EASE
i=l AGE
J
and t h e r e i s always an i n t e g e r optimum s o l u t i o n y.
i = 1,
...,k l
F o r t h i s s o l u t i o n y we can
always achieve k
i c y = c . i=l e.EAC-E A J J
c
f o r j = l ,
i f we have ,, > ' I i n ( 4 . 3 ) f o r some j A o f E c o n t a i n i n g e . as w e l l as an i n d e x i J by t h e t r a n s f o r m a t i o n since,
E
E
...,n,
(4.3)
11 ,...,nl, we can c o n s i d e r a s u b s e t such t h a t y; > 0. Then
{l,...,k}
we can decrease t h e sum i n (4.3) by 1 w i t h o u t i n c r e a s i n g t h e optimum v a l u e k c z yAi ri(A), s i n c e r a n k - f u n c t i o n s a r e monotone. By r e p e t i t i o n o f such a i=lAGE t r a n s f o r m a t i o n ( 4 . 3 ) can b e achieved. Now we m u l t i p l y (E,J)
by c t o o b t a i n (Ec,&)
and f r o m o u r optimum d u a l s o l u t i o n y
we w i l l c o n s t r u c t a p a r t i t i o n (ET, i = l , . . . , k c )
o f Ec such t h a t
k-
C
z ri(E:).
rc(Ec) =
i=1 L e t AsE, i
{ l ,...,k } be such t h a t yb >, 1.
To any e . E A we choose a d i s t i n c t J i element e l f r o m { e . ) U E l and r e p l a c e A by t h e s e t { e ' : e . E A}. I f yA 3 2, J J J J J we r e p e a t t h i s replacement b y a s e t { e " : e . E A, e " # e l } and so on, u n t i l we i j~ J J g e t yA p a i r w i s e d i s j o i n t subsets o f Ec. Now we choose t h e n e x t A: i ' such t h a t i' y A , b l and proceed s i m i l a r l y t o o b t a i n ybyb, p a i r w i s e d i s j o i n t subsets o f Ec and E
.
I
so on, u n t i l we g e t a p a r t i t i o n (ET, i = 1,. ..,kc)
o f Ec.
Note t h a t a l l t h e s e
s e t s ET c o n s t i t u t e p a r t i a l t r a n s v e r s a l s Ti o f t h e f a m i l y A ( s e e s e c t i o n 2) and,
R. Eiilrr
108
therefore, we can enlarge these Tls t o t r a n s v e r s a l s of A and assign a unique 1
T h i s matroid
matroid (Ec,2j.) t o Ei.
a r i s e s from one of
(€,Il) ,...,( E,&)
by
s u b s t i t u t i n g t i e enlarged transversal f o r E and, t h e r e f o r e , a f t e r a l l these
c
Hence, r '(E ) = C
C
1 r . (E.). Jj 1
C
We can show the corresponding r e l a t i o n f o r X 5 E by choosing a vector c '
E
Zn
E X , c! 0 f o r e . i X, as well a s f o r an a r b i t r a r y J J J 3 Ec, c already given, by choosing a n appropriate vector c ' and then constructing an optimal p a r t i t i o n of X . This completes the proof.
such t h a t c! = 1 f o r e . X
C_
FURTHER EXAMPLES
Example 5 . 1 Matroids (E,g) have t h e max-min-property r e l a t i v e t o themselves. I t remains t o show t h a t they keep t h i s property a f t e r every proper m u l t i p l i c a t i o n by a vector c
g:
CN'.
Let us consider t h e family A = (ie,-U
E; ,..., {e,iL) E;).
Since multiplying ( E J ) by c does n o t depend on the order of t h e c i , we may assume t h a t c1 ;c 2 p . . . ,c holds. Now we p a r t i t i o n E ( s e e Figure 5 . 2 ) in a s e t of n C ( p a r t i a l ) t r a n s v e r s a l s T i , i = 1 , . - . , c l , o f A , such t h a t T1 = E, T 2 = { e1l ,..., e nl ) ,
.... .
I f , f o r instance, c1 a c 2
5
1 , the l a s t transversal Tc
{ e1c , - l : .
just c o n s i s t s of 1
Figure 5.2
hideperidcwce
SIs t e m
109
arid perfect k-matroid-iritersections
To any o f these ( p a r t i a l ) t r a n s v e r s a l s Ti we a s s i g n t h a t u n i q u e m a t r o i d ( E c , r . ) , Ji
which we o b t a i n from s u b s t i t u t i n g TiU T i f o r E i n t h e g i v e n m a t r o i d (E,J),
,. . . , e l T . l + l i .
where T i c o n s i s t s o f t h e s e t Ien,en-l m u l t i p l i c a t i o n o f (E,Y) f o r a1 1 i = 1 ,.
. . ,cl,
where Ei = E\T!.
__ Proof
C l e a r l y , r . (T.) = r ( E . ) 1 Ji 1
Moreover, we have t h e f o l l o w i n g
1
P r o p o s i t i o n 5.3 where r
By t h e d e f i n i t i o n o f a
by c t h i s i s always p d s s i b l e .
rc(Ec) =
I: r . (Ti),
i=l Ji
denotes t h e r a n k - f u n c t i o n o f (Ec,Tc).
C
I t i s s u f f i c i e n t t o f i n d a member
I
of
2c such
t h a t (11 =
t h i s we a p p l y a s l i g h t v a r i a n t o f t h e Greedy-Algorithm (see [5]) Step 1 )
1:=0=:J,
i:=1
c1 I: r . (Ti). i=l Ji
For
t o (Ec,IC):
Step 2)
-+
I := IU( [ei }UE; )
1
Yes :
Step 2)
J
I f i = n, Stop.
One e a s i l y v e r i f i e s t h a t I 1 f ) Ti\ C. -1
]I! = c
Step 3 )
U ieil ~ 2 ? No :
Step 3 )
+
J :=Jut ei }
+
Step 3 )
Otherwise, i:=i+l and =
f
Step 2).
r . ( T . ) f o r a l l i = 1, Ji 1
... ,cl
and t h u s
r . (T.) J .
i=1
1
1
By an analogous c o n s t r u c t i o n t h e max-min-property
can be shown f o r a l l X relative t o itself.
s Ec,
r e l a t i v e t o (Ec,Il)
so t h a t t h e m a t r o i d (EJ)
i s shown t o be p e r f e c t
We p o i n t t o t h e f a c t , t h a t t h i s r e s u l t i s c l o s e l y r e l a t e d t o
Edmonds' work on m a t r o i d s and t h e Greedy-Algorithm ( c f . constitutes
,. . . ,(Ec,gkc)
PI),which,
obviously,
a n e f f i c i e n t procedure f o r computing t h e rank o f Ec3(Ec,2,)
a m u l t i p l i c a t i o n o f t h e m a t r o i d (E,Y).
being
Such a procedure even e x i s t s f o r t h e
problem of d e t e r m i n i n g a maximum w e i g h t independent s e t i n (Ec,Tc),
given a weight-
f u n c t i o n c ' over Ec.
Example 5 . 4
L e t two m a t r o i d s (E.2,).
corresponding 2 - m a t r o i d - i n t e r s e c t i o n
(EJ2) (EJ).
be g i v e n and l e t u s c o n s i d e r t h e We do n o t know o f a d i r e c t proof
( i n t h e sense o f D e f i n i t i o n 2.4) f o r showing t h a t (E,J) (E,Jl)
and ( E , j 2 ) .
However, i t i s w e l l known ( s e e [6],
i s perfect relative to [8]) that the l i n e a r
110
R. Euler
system
z xe <
rl(A)
f o r a l l A 5 E,
z xe
6
r2(A)
f o r a l l A c; E ,
3
0
for all e
eEA
(5.5)
eEA
xe has t h e TDI-property.
E
E
Consequently, by Theorem 4 . 2 , (E,>)
i s perfect relative
(EsT2).
t o (E,?),
Example 5.6
Let G = (V,E)
be a f i n i t e , undirected, loopless graph having vertex
s e t V and edge s e t E . For S c V l e t scs)denote the s e t of edges of G having exactly one end i n S and u(s)t h a t s e t of edges having both ends i n S; moreover, l e t Q:= {S c V : I S \ >, 3, IS/ odd1 and qs:= 1/2( IS\-1) f o r a l l S E Q. Edmonds [4] showed t h a t a polyhedral d e s c r i p t i o n o f t h e matching independence system (EJ) of G , i . e . t h e convex hull o f incidence vectors of a l l those subsets of E, no two elements of which a r e incident t o a common vertex, i s given by for all e
E
E,
Xe"l
for all v
E
V,
xe
for all S
E
Q.
xe
z
b
0
(5.7)
eE6(v)
z eEY(
\c
qs
S)
proved t h a t the system (5.7) a l s o has the TDI-property so t h a t again by Theorem 4.2 (E,T) i s shown t o be perfect r e l a t i v e t o t h e matroids ( E , & ) , v E V , and ( E , I S ) , S E Q , a s induced by the i n e q u a l i t i e s z x e < 1 resp. z xe c qs.
Cunningham and Marsh [3]
ess(v)
ecy( S )
Exmple 5.8 We would l i k e t o present now an independence system (E,C), which i s not perfect r e l a t i v e t o any s e t of matroids. Consider t h e s t a b l e - s e t independence system of the graph G = (E,C), E = t l , ...,6 1 , a s shown i n Figure 5.9.
I t i s well known ( s e e f o r instance [14])
5
z x . + 2x6
4 2 i=l defines a f a c e t of t h e convex hull of incidence vectors o f s t a b l e s e t s in G .
that the inequality
'
Clearly, by Theorem 3 . 6 , (E,C) cannot be p e r f e c t r e l a t i v e t o a s e t of matroids. k To show t h i s d i r e c t l y , suppose i t i s . Then '=I = n 3. f o r a s e t of k matroids i=l (E.2,) ,..., ( E , I k ) . I n p a r t i c u l a r , r ( E ) = ,I r i ( E i ) f o r sane p a r t i t i o n 1=1
(Ei, i
=
1 , ...,k ) of E.
Since r(E) = 2 , r i ( E )
3
2 f o r i = 1 ,..-,k .
Suppose t h e r e
Independence systems and perfect k-matroid-intersections
111
1
Figure 5.9 i s an i n d e x j such t h a t r . ( E . ) = 1.
J
J
Then GEEj]
can o n l y be a s i n g l e v e r t e x , a
s i n g l e edge o r a t r i a n g l e i n G, s i n c e r ( X ) = 2 f o r any 4-element s u b s e t X of E . However, r(E\E .) = 2 f o r any such s e t E and so r ( E ) = 2 cannot be achieved. J j Hence, r . ( E - ) = 0 o r 2 f o r a l l i = 1, k and, t h e r e f o r e , r ( E ) = ri(E) = 2 f o r 1 1
...,
some i n d e x i
E
...
{l, , k l .
Now we m u l t i p l y (E,I)
by c = (l,l,l,l,l,Z)
and
observe t h a t t h e r e i s no c l i q u e o f s i z e 4 i n t h e corresponding graph Gc = (EC$,) (see F i g u r e 5.10). 1
F i g u r e 5.10 So a g a i n 2 = r ( E c ) = ri(Ec)
m u l t i p l i c a t i o n o f (E,q)
f o r some index i
ri(Ec)
2,
{l,...,k,
...,Z k } .
But a f t e r t h e
by c t h e rank o f any o f t h e m a t r o i d s (E,;Ji),
i n c r e a s e s b y 1 and s i n c e (Ec,Ii), (Ec,jk),
E
3 for a l l i
E
i = 1, ...,k,
...,2k a r e " c o p i e s " o f (Ec,I,) ,..., 11, ..., k ,..., 2k1, a c o n t r a d i c t i o n t o t h e p e r f e c t i = k+l,
ness assumed f o r ( E , j ) .
CONCLUSIONS AND OPEN PROBLEMS I n t h i s paper we have i n t r o d u c e d t h e concept o f independence systems, which a r e
R. Euler
112
p e r f e c t r e l a t i v e t o a s e t o f matroids.
I n p a r t i c u l a r , a polyhedral d e s c r i p t i o n
has been presented, an i n t e r r e l a t i o n t o t o t a l d u a l i n t e g r a l i t y has been establ i s h e d and i t c o u l d be shown t h a t t h i s c l a s s i s c l o s e d under m u l t i p l i c a t i o n . I n c o n n e c t i o n w i t h independence systems (EJ)
one i s o f t e n i n t e r e s t e d i n s o l v i n g
a problem o f t h e f o r m Maximize g i v e n a weight f u n c t i o n c
I ce s u b j e c t t o I e: I
(6.1)
EJ,
..IR E ' . The q u e s t i o n a r i s e s , i f , f o r t h e case o f an ~
i n d e p e n d e m system, w h i c h i s p e r f e c t r e l a t i v e t o ( E J l ) a l g o r i t h m f o r t h e s o l u t i o n o f (6.1) e x i s t s .
,. . . ,(E,Xk),
a polynomial
More s p e c i f i c a l l y , c a n e l l i p s o i d
methods b e used, as i n t h e case o f p e r f e c t graphs ( s e e [12]),
t o s o l v e (6.1)
polynmially? As a l r e a d y p o i n t e d o u t f o r m u l t i p l i c a t i o n s o f a m a t r o i d , p o l y n o m i a l a l g o r i t h m s f o r s o l v i n g ( 6 . 1 ) o v e r s p e c i f i c c l a s s e s o f independence systems ( E , j ) may be used t o s o l v e t h e r e l a t e d problems o v e r m u l t i p l i c a t i o n s o f (E,Y).
Moreover, i f
I C ! i s p o l y n o m i a l i n / E l , i t seems t o be p o s s i b l e t o i n v e r t t h e o D e r a t i o n o f (E,2) by an a p p r o p r i a t e c h e c k i n g o f t h e c i r c u i t s and, t h e r e b y , t o
multiplying
r e d u c e ( 6 . 1 ) o v e r (E,?)
t o a s i m i l a r problem o v e r ( E ' , Y ) ,
which i s n o t a proper
m u l t i p l i c a t i o n o f any o t h e r independence system, i n a p o l y n o m i a l number o f steps. We conclude w i t h a l i s t o f o t h e r open q u e s t i o n s w i t h i n t h i s framework:
-
Are t h e r e p o l y n o m i a l a l g o r i t h m s o f p u r e l y c o m b i n a t o r i a l a n a t u r e t o d e t e r m i n e a maximum ( w e i g h t ) independent s e t r e s p . a minimum p a r t i t i o n of E i n t o independ e n t subsets f o r a g i v e n p e r f e c t ( r e l a t i v e t o (E,gl),.
. . ,(E,Yk))
independence
system;
-
a r e t h e f a c e t s of t h e p o l y t o p e d e s c r i b e d by (3.1) g i v e n b y t h o s e subsets o f E, which a r e c l o s e d and i n s e p a r a b l e r e l a t i v e t o t h e r a n k - f u n c t i o n r o f
-
(E,2);
how do concepts and r e s u l t s on p e r f e c t graphs such as odd c y c l e s and a n t i c y c l e s , g e n e r a l i z a t i o n s of which c o u l d g i v e more i n s i g h t i n t o t h e f a c e t t i a l s t r u c t u r e o f independence system p o l y h e d r a , t h e c h a r a c t e r i z a t i o n o f p e r f e c t graphs as g i v e n b y Lov6sz L13:
e t c . c a r r y o v e r t o such p e r f e c t independence
systems; and l a s t , b u t n o t l e a s t
- how do o t h e r w e l l known c l a s s e s o f independence systems such as those, which a r i s e from d e g r e e - c o n s t r a i n e d subgraphs (see [4]) and
clq) f i t
i n t o t h i s framework,
o r m a t c h i n g - f o r e s t s ( s e e [9]
and a r e t h e r e i n t e r e s t i n g examples beyond
those p r e s e n t e d h e r e and those, which a r e known from t h e t h e o r y o f p e r f e c t graphs?
Independence systems and perfect k-ma froid-intersections
113
ACKNOWLEDGEMENT
I am most g r a t e f u l t o P r o f e s s o r Claude Benzaken f o r v e r y v a l u a b l e s u g g e s t i o n s .
REFERENCES
[l] Berge, C . ,
Graphes e t Hypergraphes (Dunod, P a r i s , 1973).
[2]
Chvdtal, V., On c e r t a i n p o l y t o p e s a s s o c i a t e d w i t h graphs, J . C o m b i n a t o r i a l Theory B 18 (1975) 138-154.
[3]
Cunningham, W.H. and Marsh, A.B., A p r i m a l a l g o r i t h m f o r optimum matching, Math. P r o g r a m i n g Study 8 (1978) 50-72.
[4]
Edmonds, J . , Maximum matching and a p o l y h e d r o n w i t h 0 , l - v e r t i c e s , Nat. Bur. Stand. Sect. B 69 (1965) 125-130.
[5]
Edmonds, J . , M a t r o i d s and t h e greedy a l g o r i t h m , Math. Programming 1 (1971) 127-136.
[6]
Edmonds, J . , M a t r o i d i n t e r s e c t i o n , Annals o f D i s c r e t e Math. 4 (1979) 39-49.
[7]
Edmonds, J . , and G i l e s , R., A min-max r e l a t i o n f o r submodular f u n c t i o n s on graphs, Annals o f D i s c r e t e Math. 1 (1977) 185-204.
[8]
G i l e s , R., Submodular f u n c t i o n s , graphs and i n t e g e r polyhedra, Thesis, Univ. o f Waterloo, 1975.
[9]
G i l e s , R.,
Optimum matching f o r e s t s I, Math. Programming 22 (1982) 1-11.
PO]
G i l e s , R.,
Optimum matching f o r e s t s 11, Math. Programming 22 (1982) 12-38.
el]
G i l e s , R., and P u l l e y b l a n k , W . , T o t a l dual i n t e g r a l i t y and i n t e g e r polyhedra, L i n e a r Algebra and i t s A p p l i c a t i o n s 25 (1979) 191-196.
e2]
G r o t s c h e l , M., Lovasz, L., and S c h r i j v e r , A., Polynomial A l g o r i t h m s f o r P e r f e c t Graphs, Report No. 81178-0R, I n s t i t u t f u r Okonometrie und Operations Research d e r U n i v e r s i t a t z u Bonn (1981).
e3]
Lovdsz, L., A c h a r a c t e r i z a t i o n o f p e r f e c t graphs, J . C o m b i n a t o r i a l Theory B 13 (1972) 95-98.
e4]
S b i h i , N., Etude des s t a b l e s dans l e s graphes sans @ t o i l e s , Thesis, Univ. S c i e n t i f i q u e e t Medicale de Grenoble ( 1 9 7 8 ) .
c5]
S c h r i j v e r , A., On t o t a l d u a l i n t e g r a l i t y , L i n e a r Algebra and i t s A p p l i c a t i o n s 38 (1981) 27-32. <
n6]
S c h r i j v e r , A., (1982).
Submodular f u n c t i o n s , Note AE N5/82, U n i v e r s i t y o f Amsterdam
n73
Welsh, D.J.A.,
M a t r o i d Theory (Academic Press, London, 1976).
J . Res.
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 115-128 0 Elsevier Science Publishers B.V. (North-Holland)
115
MATROIDS ON ORDERED SETS AND THE GREEDY ALGORITHM
U. F a i g l e I n s t i t u t f u r Okonometrie und O.R. U n i v e r s i t a t Bonn Nassestr. 2 0-5300 Bonn 1, W-Germany
G e n e r a l i z e d independence systems and c l a s s e s o f o b j e c t i v e f u n c t i o n s a r e i n v e s t i g a t e d f o r which t h e greedy a l g o r i t h m works w e l l . Those systems may b e viewed as m a t r o i d s on o r d e r e d ground s e t s and i n c l u d e , i n p a r t i c u l a r , systems o f i n t e g r a l v e c t o r s o f i n t e g r a l p o l y m a t r o i d s . The greedy a l g o r i t h m can b e understood as b e i n g performed i n an associ a t e d m a t r o i d on an unordered s e t , t h e ' D i l w o r t h c o m p l e t i o n ' . T h i s a l l o w s t o d e r i v e w o r s t case bounds f o r t h e greedy heuri s t i c f o r c e r t a i n ordered systems o f i n t e g r a l v e c t o r s .
1 INTRODIJCTION The greedy a l g o r i t h m i s a c o m b i n a t o r i a l procedure t o s e l e c t an o o t i m a l member o f a f a m i l y o f subsets o f some f i n i t e s e t E w i t h r e s p e c t t o a g i v e n w e i g h t i n g o f t h e elements o f E i n t h e "most s t r a i g h t - f o r w a r d " manner.
I t has been known f o r a l o n g
t i m e t h a t t h e greedy a l g o r i t h m works w e l l i f and o n l y i f t h e f a m i l y o f subsets i s t h e c o l l e c t i o n o f independent s e t s o f some m a t r o i d on E ( s e e Boruvka [2]
o r Gale
1121 1 . Edmonds [8]
has shown t h a t t h e greedy a l g o r i t h m f o r m a t r o i d s may b e viewed as t h e
s o l u t i o n o f a c e r t a i n l i n e a r orogram w i t h r e s p e c t t o ' p o l y m a t r o i d s ' , i . e . , p o l y E determined by submodular f u n c t i o n s on t h e power s e t o f E ( s e e a l s o
topes i n B
[9])
and t h u s has been a b l e t o f o r m u l a t e a more g e n e r a l greedy a l g o r i t h m f o r l i n -
ear o b j e c t i v e f u n c t i o n s o v e r p o l y m a t r o i d s . In
[lo],
we c o n s i d e r e d a g r e e d y - t y p e a l g o r i t h m i n t h e case where t h e s e l e c t i o n
r u l e has t o r e s p e c t a precedence c o n s t r a i n t g i v e n by a ( p a r t i a l l y ) o r d e r e d s e t P , and we gave a c h a r a c t e r i z a t i o n o f t h o s e systems f o r which t h e greedy a l g o r i t h m works w e l l w i t h r e s p e c t t o ' a d m i s s i b l e ' w e i g h t f u n c t i o n s . a l g o r i t h m f o r o r d e r e d s e t s i n S e c t i o n 2.
We r e v i e w t h e greedy
As an example, we o b t a i n t h e greedy
a l g o r i t h m f o r ( d i s t r i b u t i v e ) supermatroids.
Since t h e i n t e g r a l vectors o f an
i n t e g r a l p o l y m a t r o i d f o r m a supermatroid, t h e greedy a l g o r i t h m f o r o o l y m a t r o i d s ( S e c t i o n 3 ) can be d e r i v e d w i t h o u t t h e d u a l i t y t h e o r y o f l i n e a r proqramming. Systems f o r which t h e ordered greedy a l g o r i t h m works w e l l g i v e r i s e t o ' r a n k
116
11. 1;aigle
f u n c t i o n s ' on t h e l a t t i c e F o f ( o r d e r ) i d e a l s o f P. S e c t i o n 4.
We s t u d y r a n k f u n c t i o n s i n
Every r a n k f u n c t i o n d e f i n e s an ' o r d e r e d m a t r o i d ' on P .
Furthermore,
t h e s u b m o d u l a r i t y o f a r a n k f u n c t i o n a l l o w s t h e ' D i l w o r t h c o m p l e t i o n ' o f an unordered m a t r o i d on t h e same ground s e t .
I n S e c t i o n 5, we show t h a t t h e greedy a l g o r i t h m f o r o r d e r e d s e t s may b e performed i n such a way t h a t i n e f f e c t i t becomes t h e greedy a l g o r i t h m w i t h r e s p e c t t o t h e
p o l y m a t r o i d determined b y t h e a s s o c i a t e d r a n k f u n c t i o n s .
Thus t h e o p t i m i z a t i o n
problem o f a d m i s s i b l e w e i g h t f u n c t i o n s on o r d e r e d s e t s i s e q u i v a l e n t t o t h e o p t i m i z a t i o n problem o f l i n e a r f u n c t i o n s o v e r p o l y n a t r o i d s .
Moreover, t h e greedy
a l g o r i t h m f o r supermatroids can b e i n t e r p r e t e d as t h e g r e e d y a l g o r i t h m i n t h e D i l w o r t h completion.
T h i s o b s e r v a t i o n n o t o n l y shows t h a t t h e greedy a l g o r i t h m s
above work w e l l b u t a l s o t h a t c e r t a i n o p t i m i z a t i o n problems o v e r o r d e r e d systems can b e seen as problems o v e r independence systems o f s e t s .
As an a p p l i c a t i o n ,
i n S e c t i o n 6 t h e w o r s t case bound f o r t h e performance o f t h e greedy h e u r i s t i c d e r i v e d b y K o r t e and Hausmann [14i f o r i n t e r s e c t i o n s o f k m a t r o i d s i s i n e d i a t e l y o b t a i n e d f o r o r d e r e d systems o f i n t e g r a l v e c t o r s w h i c h a r e i n t e r s e c t i o n s o f t h e c o l l e c t i o n s o f i n t e g r a l vectors o f k i n t e g r a l polymatroids.
2
THE GREEDY ALGORITHM ON ORDERED SETS
I n t h i s s e c t i o n we b r i e f l y d e s c r i b e t h e greedy a l g o r i t h m on o r d e r e d s e t s as
presented i n
[lo].
We use a s l i g h t l y d i f f e r e n t t e r m i n o l o g y and we a l l o w w e i g h t
functions achieving p o s s i b l y negative values.
I t i s easy t o see t h a t t h e l a t t e r
may b e done. L e t P be a f i n i t e ( p a r t i a l l y ) o r d e r e d s e t .
We d e n o t e b y F = F ( P ) t h e ( d i s t r i b -
u t i v e ) l a t t i c e o f a l l ( o r d e r ) i d e a l s o f P, i . e . ,
.
x 6 y implies x
subsets A E. P s o t h a t y
A and
E
A.
A non-empty c o l l e c t i o n S o f sequences o v e r P i s c a l l e d a s e q u e n t i a l f a m i l y i f (S1)
For every x = xlx 2...
(s2)
For e v e r y where t k We s e t
E
S , xi \< x . i m a l i e s i 4 j . J
= xlx 2 . . . ~ n E S , "k =
lo:
xlx =
*...x k
E
S,
i s t h e i n i t i a l segment o f
i s finite.
o f l e n g t h k, 0
6
k
Q
n.
0, t h e emoty sequence.
Note t h a t because o f (S1) a l l elements i n of
3
E
S a r e d i s t i n c t and hence t h e l e n g t h
Maximal members o f S a r e b a s i c sequences.
Because o f p r o p e r t y
!S2), e v e r y s e q u e n t i a l f a m i l y i s c o m p l e t e l y determined b y i t s b a b i c bequences. As i n m a t r o i d t h e o r y , an element p
E
P i s an S-isthmus i f p occurs i n e v e r y b a s i c
Matroids on ordered sets and the greedy algorithm
117
sequence. O f t e n we w i l l n o t d i s t i n g u i s h between t h e sequence
E
S and t h e subset o f P
u n d e r l y i n g a. T h i s should cause no c o n f u s i o n . For A
E
F l e t S(A): = { a
E
S:n =A}.
Clearly, S ( A ) i s again a sequential family.
An S ( A ) - i s t h m u s w i l l s i m p l y be c a l l e d an A-isthmus. An a d m i s s i b l e w e i g h t f u n c t i o n on P i s a f u n c t i o n w: P 4 so t h a t x 6 y i m p l i e s w(x)
3
w(y) f o r a l l x,y
P.
E
w extends t o S as f o l l o w s :
O i f a = d for a
E
S, w ( a ) : =
z w(x) o t h e r w i s e . [xECY
The problem t h e n c o n s i s t s i n f i n d i n g a w-maximal member
o f the sequential
CY
family S. The greedy a l g o r i t h m i s t h e f o l l o w i n g procedure: Step I: Choose x1
E
P such t h a t w(xl)
>
0 i s maximal and x1
E
S.
I f no such
c h o i c e i s p o s s i b l e , s e t a = # and stop. Step k : If a = x ~ x ~ . . . x E~ S- ~i s c o n s t r u c t e d , choose x k t h a t axk x
E
E
P -Ixl
E
P
-
{X~,...,X~-~}
S and w(xk) i s maximal among those w(x) w i t h w(xk-,)
,..., X ~and -~ ax EIS.,
3
such
w(x) > O ,
I f no such c h o i c e i s p o s s i b l e , s t o p .
We say t h a t t h e greedy a l g o r i t h m works w e l l i f i t c o n s t r u c t s a w-maximal sequence E
S.
I f t h e greedy a l g o r i t h m works w e l l f o r e v e r y a d m i s s i b l e w, t h e s e q u e n t i a l
f a m i l y S i s c a l l e d greedy. Theorem 1 (GS,)
ay
(GS2)
[ l o ]:
For every E
The s e q u e n t i a l f a m i l y S i s greedy i f and o n l y i f a . E~
S w i t h ( a ( < 161, t h e r e e x i s t s x
E
B and y 6 x such t h a t
s.
F o r e v e r y A,B
E
F , A c _ B, i f p
E
A i s a B-isthmus, t h e n p i s a l s o an A -
isthmus . Remark 1 :
I f f o r a1 1
cx E
S , t h e elements o f
CY
a r e l i n e a r l y ordered, t h e n ( GS1 )
i m p l i e s ( G S 2 ) ( s e e C r o i t o r u [5]). The n e c e s s i t y o f t h e c o n d i t i o n s (GS1) and ( G S 2 ) i s e a s i ly seen by c o n s i d e r i n g s u i t a b l e weight functions.
We w i l l n o t r e p r o v e t h e s u f f i c i e n c y o f t h e c o n d i t i o n s
f o r t h e greedy a l g o r i t h m i n i t s general form above b u t c o n c e n t r a t e t o t h e f o l l o w i n g s p e c i a l form o f t h e greedy a l g o r i t h m .
L! Faigle
I18
Step 0: L i s t the p o s i t i v e elements o f P, x1,x2,
1 w(xi)
w(x,) Step 1: a
..., xn,
so t h a t xm
#
xi and
>I 0 f o r m < i;
0;
+
Thus, i f S i s greedy, t h e s p e c i a l greedy a l g o r i t h m w i l l produce a w-maximal element a
E
We w i l l show i n t h e n e x t s e c t i o n how t h i s
S a f t e r n t 1 steps.
181 greedy
greedy a l g o r i t h n g e n e r a l i z e s Edmonds' roids.
a l g o r i t h m f o r i n t e g r a l polymat-
On t h e o t h e r hand, we w i l l see i n S e c t i o n 5 t h a t i n t h e Dresence o f (GS1)
and ( G S i ) t h e s p e c i a l greedy a l g o r i t h m may be viewed as an execution o f Edmonds' greedy a l g o r i t h m and thus prove the s u f f i c i e n c y o f (GS1) and (GS2) f o r the special greedy a l g o r i t h m t o work w e l l . Remark 2: Step 0 of t h e s p e c i a l greedy a l g o r i t h m may be c a r r i e d o u t as f o l l o w s : Choose x1 as a minimal element of P of maximal weight, then choose x 2 as a minimal element o f P
-
o f maximal weight, e t c .
xl,
Remark 2 suggests t o e x h i b i t a canonical subfamily o f t h e sequential f a m i l y S. The minimal f a m i l y Smin
0
E
If a
Smin.
E
i f and o n l y i f wx
Smni
o f S i s c o n s t r u c t i b l e from S i n t h e f o l l o w i n g manner: i s a l r e a d y constructed and x
S and ay
E
E
P a r b i t r a r y , then ax
E
Smni
S f o r a l l y < x.
i s greedy i f S i s greedy.
Obviously, Smni
E
Moreover, t n e s p e c i a l greedy a l g o r i t h m
w i l l always s e l e c t a member o f Smin. Remark 3: A greedy f a m i l y i s n o t n e c e s s a r i l y a 'greedoid' i n t h e sense o f K o r t e and Lovasz [15].
A minimal greedy f a m i l y , however, i s a greedoid (see Section 4 ) .
We end t h i s s e c t i o n w i t h t h e examole o f a general c l a s s o f greedy f a m i l i e s . L e t L be a f i n i t e d i s t r i b u t i v e l a t t i c e .
A subset Q E L i s a s w e n n a t r o i d on L
(see Dunstan e t a1 . [ 7 ] ) i f
(SMO) 0
E
Q.
(SM1)
E
Q
x
and
y 4 x implies y
(SM?) For every x,y x
c
x'
x
y.
E
E
Q.
Q w i t h 1x1 < I y I , t h e r e e x i s t s x '
E
C! so t h a t
(Here 1x1 denotes t h e h e i g h t o f x i n t h e l a t t i c e L ) .
L e t P be t h e ordered s e t of j o i n - i r r e d u c i b l e elements o f P, i . e . , P = i p E L: p # 0, D = x w i t h the i d e a l P ( x ) = [ p
v
y implies p = x o r p = y l .
E
P: p
6
I d e n t i f y i n g every x E L XIof P, L may be viewed as t h e l a t t i c e F ( P ) o f
Matroids on ordered sets and the greedy algorithm
[l, p . 5 9 1 ) .
i d e a l s of P ( c f . B i r k h o f f
W i t h each x
E
119
Q, we a s s o c i a t e t h e c o l l e c -
t i o n S ( x ) of a l l sequences a = xlx 2 . . . ~ n such t h a t P ( x ) = {x,,x 2,...,~n} a maximal element of P ( x ) , x
~ i -s a~ maximal element o f P ( x )
-
and xn i s
xn e t c . ( i n t h e
language o f 0 5 1 , S ( x ) i s t h e ' s c h e d u l i n g g r e e d o i d ' o f t h e o r d e r e d s e t P ( x ) ) . S(Q): =
U iS(x) : x
E
Q1 t h e n i s a s e q u e n t i a l f a m i l y , and
i m p l i e s (GS,).
(Sbf2)
Moreover, we c l a i m t h a t (GS2) h o l d s . Indeed, c o n s i d e r t h e i d e a l B = P(z) f o r some z maximal element o f B.
Let
OL
E
L and A = B
be an A-basic sequence and p
(SM2), a can be augmented t o a B - b a s i c sequence 5. t h e i d e a l of P u n d e r l y i n g 6 .
By (SM1), P ( 5 )
sequence i n S(Q). Now a c P ( 5 ) P(B)
-
b.
Hence p
E
-
-
E
Assume p
-
b, where b i s some
A be a r b i t r a r y . E
By
5, and l e t P ( 5 ) be
b i s t h e u n d e r l y i n g i d e a l o f some
b c A, and t h e m a x i m a l i t y o f
a
i m p l i e s P(,)
=
a.
Since e v e r y sequence o f S(Q) forms an i d e a l i n P, i t i s c l e a r t h a t S(Q) i s a minimal family.
3 THE GREEDY ALGORITHM FOR POLYNATROIDS Making use o f t h e d u a l i t y t h e o r y o f l i n e a r programming, Edmonds [8]
has g e n e r a l -
i z e d t h e greedy a l g o r i t h m f o r m a t r o i d s t o a c l a s s o f p o l y h e d r a s o - c a l l e d ' p o l y matroids'.
We now o u t l i n e h i s approach and t h e n i n d i c a t e how t h e g r e e d y a l g o r i t h m
f o r p o l y m a t r o i d s can b e d e r i v e d f r o m t h e greedy a l g o r i t h m f o r ordered s e t s presented i n t h e previous section. L e t E be a f i n i t e s e t and f : 2'+R
a ground s e t r a n k f u n c t i o n , i . e . ,
a function
s a t is f y ing (GRo)
f(0) = 0
(GR1)
AE; B implies f ( A ) 6 f(B)
(GR2)
f ( A U B ) + f ( A n B) 6 f ( A ) + f ( B ) .
We d e f i n e t h e p o l y m a t r o s a s s o c i a t e d w i t h f by P ( f ) = {x
E
IRE : x
Here x A i s t h e r e s t r i c t i o n o f x o f x n o t i n A equal t o 0.
E
3 0,
lxAl c f(A) f o r a l l A c E l .
(3.1)
IRt t o t h e index s e t A by s e t t i n g a l l components
1x1 i s t h e sum o f t h e comoonents o f t h e v e c t o r x.
Given P ( f ) , t h e ground s e t r a n k f u n c t i o n f can b e r e c o v e r e d by f(A) = max{lxAl : x
E
P(f)}
f o r a l l A s E.
(3.2)
U. Faigle
120
The o p t i m i z a t i o n problem c o n s i s t s i n m a x i m i z i n g c . x , where c v e c t o r such t h a t x
E
RE i s a f i x e d
P(f).
E
The greedy a l g o r i t h m f o r p o l y m a t r o i d s proceeds as f o l l o w s : Step 0: L i s t t h e elements o f E, el,e2 t h a t c(el,)
SO
c(e2) t
2
...
,..., ek ,...,en, c(ek)
2
;
0
3
c(ek+l)
>,
...
3
c(en).
L e t A1 = [el
U
Ai = Ai-, Step 1 :
Construct xo
E
[ e 1. )
f o r i = 2,
..., k
P ( f ) by
0
x ( e i ) = f(A1) X
0
lei)
= 0
x(e,)
-
= f(Ai)
),
f(Ai-
i = 2,
...,k
f o r m >, k + 1 .
T h e o r m 2 [8J : The greedy a l g o r i t h m works w e l l f o r p o l y m a t r o i d s . The p o l y m a t r o i d P ( f ) i s i n t e g r a l i f t h e ground s e t rank f u n c t i o n f t a k e s an o n l y integer values.
I n t h i s case, we may r e s t r i c t o u r a t t e n t i o n t o t h e s e t Q ( f ) o f I n p a r t i c u l a r , t h e e q u a t i o n ( 3 . 2 ) remains v a l i d .
i n t e g r a l vectors o f tP(f).
So l e t ! P ( f ) be an i n t e g r a l p o l y m a t r o i d , and choose b
P(f), i.e.,
such t h a t x
6
b for all x
E
P(f).
ELNE as a bounding v e c t o r f o r
Then
D ( b ) = ',x € W E : x 6 b i
(3.3)
i s a d i s t r i b u t i v e l a t t i c e w i t h r e s p e c t t o componentwise o r d e r .
x
t
Note t h a t a v e c t o r
D(b) i s j o i n - i r r e d u c i b l e i n D ( b ) i f and o n l y i f x has e x a c t l y one non-vanishing
component. et al. Given c
Furthermore, Q ( f ) i s a s u p e r m a t r o i d w i t h r e s p e c t t o D(b) ( c f . Dunstan
17:). F
RE, we a s s i g n w e i g h t c ( e ) t o t h e j o i n - i r r e d u c i b l e element x
and o n l y i f t h e e - t h component o f x does n o t v a n i s h . admissible weight f u n c t i o n . Suppose now c(e,)
c(e2)
E
D(b) i f
C l e a r l y t h i s y i e l d s an
e v e_ ry x Moreover, c . x i s t h e induced w e i g h t f o r _
...
a c(ek)
>
0
c(ek+,)
E
D(b).
.
To o b t a i n a l i s t i n g as i n Step 0 of t h e s p e c i a l greedy a l g o r i t h m i n S e c t i o n 2, we l i s t a l l j o i n - i r r e d u c i b l e elements o f D(b) h a v i n g n o n - v a n i s h i n g el-th
component i n
i n c r e a s i n g o r d e r , t h e n a l l j o i n - i r r e d u c i b l e elements h a v i n g n o n - v a n i s h i n g e w - t h Component, e t c . I n view of ( 3 . 2 ) , t h e greedy a l g o r i t h m f o r i n t e g r a l p o l y m a t r o i d s t h u s reduces t o
121
Matroids on ordered sets and the greedy algorithm
t h e spec a1 greedy a l g o r i t h m w i t h r e s p e c t t o t h e supermatroid Q ( f ) . Remark 4
The p r e c e d i n g argument does n o t y e t p r o v e Theorem 2 f r o m Theorem 1 .
However, assuming t h a t t h e greedy a l g o r i t h m works w e l l f o r t h e s u p e t m a t r o i d Q ( f ) i t i s r o u t i n e t o d e r i v e t h e f u l l f o r m o f theorem 2 u s i n g McDiarmid's [17]
nique o f ' r a t i o n a l approximation'.
4
tech-
We o m i t t h e d e t a i l s .
RANK FUNCTIONS AND THE DILWORTH COMPLETION
We have seen how t h e greedy a l g o r i t h m f o r p o l y m a t r o i d s can b e d e r i v e d from t h e greedy a l g o r i t h m f o r s e q u e n t i a l f a m i l i e s .
Conversely, we now a s s o c i a t e w i t h each
s e q u e n t i a l f a m i l y a r a n k f u n c t i o n i n o r d e r t o r e l a t e greedy f a m i l i e s t o polymatroids.
T h i s l e a d s t o t h e d e f i n i t i o n o f an ' o r d e r e d m a t r o i d ' .
Employing D i l w o r t h ' s [6] c o n s t r u c t i o n , we t h e n embed e v e r y o r d e r e d m a t r o i d i n t o a T h i s w i l l a l l o w us t o e x h i b i t
c a n o n i c a l unordered m a t r o i d on t h e same ground s e t .
t h e greedy a l g o r i t h m s o f t h e p r e v i o u s s e c t i o n s as s p e c i a l cases o f t h e c l a s s i c a l greedy a l g o r i t h m f o r unordered m a t r o i d s . L e t S be a s e q u e n t i a l f a m i l y o v e r t h e o r d e r e d s e t P. define the
For every i d e a l A
E
F , we
S-rank r ( A ) = max { ( a l : a
E
S(A)).
(4.1)
I f p r o p e r t y (GS1) h o l d s f o r S, i t i s s t r a i g h t - f o r w a r d t o v e r i f y t h a t S and Smni
d e f i n e t h e same rank. The p r o o f o f
[lo,
Thm.91 may now b e c a r r i e d o v e r l i t e r a l l y t o show t h e f o l l o w i n g
Theorem 3: I f p r o p e r t i e s (GS,) r : F
-f
and (GS2) h o l d f o r S, t h e n t h e r a n k f u n c t i o n
N satisfies
(Ro)
r(0) = 0
(R1)
For
As B
E
(R2)
For
A,B
F,
E
F,
0 B r(B) r ( A U 6)
+
-
r(A) B lB
-
A(
r ( A n B) c r(A)
+
r(B).
Seemingly more g e n e r a l l y , we d e f i n e any f u n c t i o n r : F + [ N w i t h t h e p r o p e r t i e s (R,,),
(R1), and (R2) t o be a rank f u n c t i o n on F and t h e p a i r (P,r)
o r d e r e d m a t r o i d on P.
t o b e an
T h i s n o t i o n t h u s g e n e r a l i z e s m a t r o i d s on unordered s e t s P.
Note t h a t e v e r y rank f u n c t i o n r extends t o a ground s e t rank f u n c t i o n f o r a l l subsets S o f P by
r
defined
C! Faigle
122
7 ( S ) = r ( 5 ) , where
'5
i s t h e i d e a l o f P generated b y the
(4.2)
subset S. C o r o l l a r y 3.1: I f S s a t i s f i e s (GS1) and (GS,), t h e n Smni
(GSi)
F o r e v e r y u,t.
E
P r o o f : Note f i r s t t h a t
Smni
w i t h la!
?(Y)
= ( Y /f o r
<
Igl. there exists x
all Y
L e t 6 = xlx 2 . . . ~ n and choose x = xi ;(a) = ? ( a u Si-,)
I f ;(a)
= ?(c,~x),
F ( a U ei)
i s a greedoid, i . e . E
13 so t h a t ax
E
Smin.
S.
E
6 such t h a t
E
b u t ; ( a ) < ? ( a u Bi).
t h e n (GR2) i m p l i e s r< ? ( a u x ) + ? ( a U
ei-l)
-
?(a) = r ( a ) ,
c o n t r a d i c t i n g t h e c h o i c e o f x.
u
Thus ? ( J
r ( a ) and hence UY
x)
?(bi-lU
I f we can show
E
Smni
f o r some y 6 x .
? ( B ~ - ~ )i ,t w i l l f o l l o w f r o m t h e d e f i n i t i o n
y)
of S . that y = x. min
Suppose r ( 6 i - 1 U
F(,U
Bi-1
u Y)
Y ) = ?(Ei-l). 6 ?(aU
a contradiction t o Every r a n k f u n c t i o n r : F
Then, b y (GR2),
Ri-1) + F(Bi-1
r(aU si-l U y ) +
z
U Y) -
r(aU y)
?(Bi-l)
= ;(a),
?(a).
W d e f i n e s a semimodular c l o s u r e o p e r a t o r i . e . , a
c l o s u r e o p e r a t o r whose l a t t i c e o f c l o s e d s e t s i s (uDper) semimodular (see, e.g., B i r k h o f f [l]),
A
+
on F v i a
A
=
UiB
E
F : A c B, r ( A ) = r ( B ) J .
(4.3)
Conversely, e v e r y semimodular c l o s u r e o p e r a t o r on F y i e l d s a r a n k f u n c t i o n v i a For e v e r y A
E
F, r(A) =
x(R),
(4.4)
where h i s t h e r a n k f u n c t i o n o f t h e l a t t i c e o f c l o s e d s e t s . F o r more m a t r o i d a x i o m a t i c s , we r e f e r t o [lll. Another c o n s t r u c t i o n t o o b t a i n r a n k f u n c t i o n s f o r unordered m a t r o i d s i s essent i a l l y due t o D i l w o r t h [6!. case as f o l l o w s .
H i s method i s d i r e c t l y a p p l i c a b l e t o t h e o r d e r e d
Matroids on ordered sets and the greedy algorithm Let f : F
+
H
be any n o r m a l i z e d submodular f u n c t i o n ,
(Ro) and (R2), and d e f i n e , A
E
i.e.,
123
a function satisfying
F,
rf(A) = minIf(X)
+
]A
Theorem 4: r f : F +!N i s a r a n k f u n c t i o n .
-
XI : X
F}.
E
(4.5)
Moreover, i f f i s a r a n k f u n c t i o n ,
t h e n rf = f. Remark 5: If f : b
E
ZE +(N i s a ground s e t rank f u n c t i o n on t h e unordered s e t E and
W E a bounding v e c t o r f o r t h e i n t e g r a l p o l y m a t r o i d I P ( f ) , t h e n f y i e l d s a norm-
a l i z e d submodular f u n c t i o n on t h e d i s t r i b u t i v e l a t t i c e D(b) by For a
E
O(b), f ( a ) = f ( s u p p ( a ) ) ,
where supp(a) = { e
E
(4.6)
# 01.
E : a,
I n t h i s case, ( 4 . 5 ) g i v e s t h e v e c t o r rank o f t h e i n t e g r a l v e c t o r a respect t o t h e polymatroid P(f).
E
NE w i t h
It i s well-known t h a t t h e v e c t o r r a n k o f
i n t e g r a l v e c t o r s c o i n c i d e s w i t h t h e r a n k d e f i n e d by ( 4 . 1 ) . Next, we c o n s i d e r Po, t h e s e t P w i t h o u t o r d e r s t r u c t u r e . Fo = F(Po) t h e l a t t i c e o f a l l subsets o f Po. every A
E
L e t us denote by
S i m i l a r l y as above, we d e f i n e f o r
Fo, r f0( A ) = m i n { f ( X ) + I A
C o r o l l a r y 4.1: r;
: Fo +oU
-
XI : X
is a rank f u n c t i o n on Fo.
E
F}
(4.7
Moreover, f o r e v e r y A
E
0 rf(A) = rf(A).
F,
(4.8
0 I n v i e w o f C o r o l l a r y 4.1, we c a l l t h e unordered m a t r o i d (Po, r r ) t h e D i l w o r t h c o m p l e t i o n o f t h e o r d e r e d m a t r o i d (P, rf).
( D i l w o r t h completions o f submodular
f u n c t i o n s have been l o o k e d a t b e f o r e ; f o r t h e i n t e r e s t i n g c l a s s o f D i l w o r t h ccnnp l e t i o n s a r i s i n g from l o w e r t r u n c a t i o n s o f c o m b i n a t o r i a l geometries,
see Crapo
131 ) . Remark 6: The D i l w o r t h c a n o l e t i o n o f t h e i n t e g r a l v e c t o r rank f u n c t i o n o f an i n t e g r a l p o l y m a t r o i d ( c f . Remark 5) shows t h a t e v e r y i n t e g r a l p o l y m a t r o i d a r i s e s i n t h e f o l l o w i n g way: F o r a m a t r o i d (T,r)
{A1,
... ,A,}
an i n t e g r a l p o l y m a t r o i d (E,f)
on an unordered s e t T, and subsets on E = { A l,...,An}
i s given v i a the
ground s e t rank f u n c t i o n . f(X) = r ( U {A : A
E
XI),
X
C_
E.
( s e e Lovasz [16]). We end t h i s s e c t i o n by showing t h a t t h e D i l w o r t h c o m p l e t i o n i s t h e " f r e e s t " ( w i t h r e s p e c t t o dependence) embedding o f t h e m a t r o i d ( P y r f ) i n t o a m a t r o i d
(4.9)
U. Faigle
1 24
defined on Po. Theorem 5: L e t (Po,r) be a m a t r o i d on Po such t h a t r ( A ) = r f ( A ) f o r every A and IL Po an independent s e t o f (Po,r). Proof: L e t X
E
F be a r b i t r a r y . f(x!
3
-
F,
Then, by t h e d e f i n i t i o n o f rf, we have r ( X ) >I r ( 1
rf(X)
f ( X ) + 11
Hence
E
Then I i s an independent s e t o f (Pw r:).
n x)
= IIn
X I a 111, and thus r 0f ( I )
XI. 3
(11.
The D i l w o r t h completion provides a unique f r e e s t embedding b u t n o t a unique enbedding o f the ordered m a t r o i d (P,r) Example: Consider t h r e e l i n e s b,c,d a,b,c,d
i n t o an unordered m a t r o i d on Po.
o f an a f f i n e plane i n t e r s e c t i n g i n a p o i n t a.
form an ordered s e t P by s e t - t h e o r e t i c containment.
With each i d e a l A
o f P, associate as rank r ( A ) t h e rank ( = dimension p l u s one) o f t h e subspace generated by A.
Then t h i s geometric s t r u c t u r e may be embedded i n t o two non-
isomorphic m a t r o i d s on Po represented by t h e a f f i n e c o n f i g u r a t i o n s :
b,c,d
non-collinear
b,c,d
collinear
( F i g u r e 2)
(Figure 1) Figure 1 here shows t h e D i l w o r t h Completion.
Returning t o the greedy algorithm, we now show t h a t t h e s p e c i a l greedy a l g o r i t h m f o r ordered sets i s i m p l i e d by t h e greedy a l g o r i t h m f o r polymatroids.
Noting
t h a t every member o f a greedy family i s independent i n t h e D i l w o r t h completion, we then i n v e s t i g a t e t h e r o l e o f t h e D i l w o r t h completion w i t h respect t o t h e greedy algorithm.
As a r e s u l t , t h e greedy a l g o r i t h m f o r supermatroids (and
hence f o r polymatroids) w i l l be recognized as a s p e c i a l case o f t h e well-known greedy a l g o r i t h m f o r unordered m a t r o i d s . L e t S be a sequential f a m i l y s a t i s f y i n g (GS,) w i t h rank f u n c t i o n r.
and (GS2) over t h e ordered s e t P
Then S g i v e s r i s e t o t h e i n t e g r a l polymatroid P ( r ) =
P(r)
Matroids on ordered sets and the greedy algorithm
r
where
125
i s t h e induced ground s e t rank f u n c t i o n on Po,
Suppose we have l i s t e d t h e elements o f P, p1 ,p2,...,
as i n Step 0 o f t n e s p e c i a l
greedy a l g o r i t h m w i t h r e s p e c t t o t h e a d m i s s i b l e w e i g h t f u n c t i o n w : P
+
R.
Thus
'0
>I Wk+l > . wlpl* P i n t h e o r d e r of t h i s l i s t i n g . A l s o suppose t h a t we r e a d t h e v e c t o r s o f W
w1
For every
1 \< i Q k ,
Note t h a t a l l Ails
2
w2
>I Wk
. a .
l e t Ai =
Iq,,
E
P : m 6 i}.
-
a r e members o f F and t h a t 0 4 r(Ai)
r(Ai-l)
6
1, 2 4 i
6
k,
b y p r o p e r t y (R1) o f t h e r a n k f u n c t i o n r. We d e f i n e t h e v e c t o r x O
E
RP
as f o l l o w s :
( 0 otherwise. I n view o f t h e d e f i n i t i o n o f t h e rank f u n c t i o n r, i t i s apparent t h a t x o i s c o n s t r u c t e d a c c o r d i n g t o t h e s p e c i a l greedy a l g o r i t h m , and t h a t xn i s t h e 0 - 1 i n c i d e n c e v e c t o r o f some element o f Smni . greedy a l g o r i t h m works w e l l i f t h e 0
-
Hence, by Theorem 2, t h e s p e c i a l 1 i n c i d e n c e v e c t o r o f e v e r y member o f Smin
belongs t o P( r ) . Theorem 6: I f x
E
IRP i s t h e 0
-
1 incidence vector o f a
E
S,in,
then x
E
P(r).
Moreover, a i s independent i n t h e D i l w o r t h c o m p l e t i o n (Po,ro). P r o o f : L e t a = a,a 2...an. endent i n (Po,r
0
), i . e . ,
By i n d u c t i o n on la1 , we may assume t h a t an-, 0 r (an-l)
= n
-
1.
0 Supposp r !an-1)
i s indep-
0 = r (a).
0 can be embedded i n t o (Po,r ), :(a) > n 1 i m p l i e s 0 t h e e x i s t e n c e o f some a < an such t h a t r (an-l U a ) = n. By (GSl), we t h e r e f o r e Smni f o r some a \c a < an, c o n t r a d i c t i n g t h e assumption must have an-la'
-
S i n c e t h e o r d e r e d m a t r o i d (P,r)
a = a
n-lan
',in*
0 I f S i s any subset o f Po, we have r ( a n S ) 4 0 (Po,r ) . Hence 0 l x s l 6 r (s) 6 F(S) N o t e t h a t t h e v e c t o r u = (1,1,. P(r)*
.. ,1)
Ian SI
f o r every
because a i s independent i n
Sc
E Rp i s g e n e r a l l y
Po.
not a
bounding v e c t o r f o r
U.Faigle
126
Example: For P = { a
<
b ) , consider t h e rank f u n c t i o n r induced by t h e sequential
family Ib,a,ab). Then x = (xa,xb)
= (0,Z)
E
P(r).
The greedy a l g o r i t h m f o r supermatroids g e n e r a l i z e s t h e greedy a l g o r i t h m f o r unordered matroids since every unordered m a t r o i d may b e viewed as a supennatroid
on a Boolean algebra o r , e q u i v a l e n t l y , as an i n t e g r a l polymatroid bounded by u = (l,l,
..., 1).
We w i l l now t u r n our a t t e n t i o n t o t h e converse i m p l i c a t i o n .
L e t Q be a supermatroid on t h e f i n i t e d i s t r i b u t i v e l a t t i c e L. As remarked e a r l i e r every element of Q may be thought o f as an i d e a l o f t h e ordered s e t P = P(L) o f j o i n - i r r e d u c i b l e elements o f L.
I n p a r t i c u l a r , every element o f Q i s an indepen-
dent s e t of the D i l w o r t h completion
9,
on Po.
Moreover, we may i d e n t i f y Q w i t h
t h e minimal greedy f a m i l y S ( Q ) . Let w : P
+IR
be an admissible weight f u n c t i o n , and p1,p2,
i n Step 0 of t h e s p e c i a l greedy a l g o r i t h n .
Then p1,p2,
..., a
...
l i s t i n g of P as
i s a l s o a compatible
l i s t i n g o f Po i n order t o perform t h e greedy a l g o r i t h m w i t h r e s p e c t t o t h e D i l w o r t h completion .Q, Theorem 7: The greedy a l g o r i t h m w i t h r e s p e c t t o Q, and t h e greedy a l g o r i t h m w i t h respect t o Q y i e l d the sane i d e a l x 0 E Q. Hence, s i n c e Q 5 Q, t h e greedy a l g o r -
ittm works w e l l f o r supermatroids. Proof: Suppose X c Po i s a l r e a d y constructed according t o the Qo-greedy a l g o r i t h m and t h a t X i s a member o f Q.
Suppose p
E
P i s t h e n e x t element adjoined t o X by
the Qo-greedy a l g o r i t h m .
If
Xu p
Xu
i s n o t an i d e a l o f P, t h e r e e x i s t s p ' < p such t h a t p ' E X and p' E Q 0 0 > r (X) = r ( X ) , where r and r a r e t h e associated rank f u n c t i o n s .
since ro(X (J p)
But p ' < p says t h a t p ' i s l i s t e d b e f o r e p.
Hence
XU p '
E
Q,
contradicts the
choice o f p .
5 THE GREEDY HEURISTIC FOR ORDERED SYSTEMS As another a p p l i c a t i o n o f t h e D i l w o r t h completion we now d e r i v e a worst case bound f o r the performance o f the greedy a l g o r i t h m f o r c e r t a i n ordered systems by redu c t i o n t o a s i m i l a r r e s u l t o f K o r t e and Hausmann [14]
f o r independence systems.
An ordered system i s a f i n i t e non-empty c o l l e c t i o n Q o f i n t e g r a l vectors i n such t h a t x 6 y
ED^^
and y
E
Q implies x
E
Q.
IN E
Matroids on ordered sets and the greedy algorithm Let b
E
lNE be a bounding v e c t o r f o r Q and w : P
127
IR an a d m i s s i b l e w e i g h t f u n c t i o n ,
-f
where P i s t h e o r d e r e d s e t o f j o i n - i r r e d u c i b l e elements o f t h e d i s t r i b u t i v e l a t t i c e D(b).
Again, we i d e n t i f y each x
E
Q w i t h i t s i d e a l o f j o i n - i r r e d u c i b l e elements.
Theorem 8: L e t Q b e t h e i n t e r s e c t i o n o f k supermatroids Q,,-..,Qk v e c t o r s o f t h e i n t e g r a l p o l y m a t r o i d s IP1,...
,Bk.
4 be t h e Q the optimal
Furthermore, l e t xg e
s o l u t i o n w i t h r e s p e c t t o t h e s p e c i a l greedy a l g o r i t h m and x* solution.
of integral
E
Then:
P r o o f : As i n p r o o f o f Theorem 7, n o t e t h a t t h e greedy a l g o r i t h m y i e l d s t h e same r e s u l t as t h e greedy a l g o r i t h m w i t h r e s p e c t t o t h e i n t e r s e c t i o n o f t h e k m a t r o i d s 0 0 0 Q,, ...,Q,, where Qi i s t h e D i l w o r t h c o m p l e t i o n o f Qi on Po. B u t f o r t h e l a t t e r , (8.1) i s e x a c t l y t h e r e s u l t o f K o r t e and Hausmann. Theorem 8 has a l s o been proved b y G i r l i c h and Kowalow [13]
f o r so-called
We w i l l end by showing t h a t
' s e p a r a b l e d i s c r e t e l y concave' o b j e c t i v e f u n c t i o n s .
t h o s e o b j e c t i v e f u n c t i o n s a r e induced by a d m i s s i b l e w e i g h t f u n c t i o n s . A function f :
NE + R i s d i s c r e t e l y concave i f f(f(x) t f(z)) 6 f(y)
Furthermore, f i s s e p a r a b l e i f f o r e v e r y e f(x) =
c fe(xe) ecE
We w i l l assume f e ( 0 ) = 0 f o r a l l e
E
for all x E
E,
-
fe(x
-
1).
y 4 z E NE
.
(8.2)
t h e r e e x i s t s f e : OU
f o r every x
+ll? such t h a t (8.3)
Ernt.
E.
Consider t h e f i x e d c o o r d i n a t e f u n c t i o n f e : N w(x) = f e ( x )
6
Thus, f o r e v e r y b
E
+
R.
For every x
E
N, x a 1, l e t
INE, f i s induced on t h e d i s t r i b u -
t i v e l a t t i c e D(b) by t h e w e i g h t f u n c t i o n w i f f i s separable. We c l a i m t h a t w i s a d m i s s i b l e i f f i s d i s c r e t e l y concave.
Consider x
E
IN, x a 1.
Then, by (8.2), w(x t 1 )
-
w(x) = f e ( x t 1)
-
2fe(x) t fe(x
-
1)
4 0 . The greedy a l g o r i t h m f o r supermatroids o f p o l y m a t r o i d s i s a l s o known as a ' g r a d i e n t ' a l g o r i t h m since, a t e v e r y step, t h e v e c t o r a l r e a d y c o n s t r u c t e d i s i n c r e a s e d b y one u n i t i n t h e d i r e c t i o n y i e l d i n g t h e b i g g e s t i n c r e a s e o f t h e o b j e c t i v e function.
We remark t h a t f o r g r a d i e n t a l g i r t h m s , Theorem 8 may f a i l a l r e a d y
i n t h e case k = 1 i f t h e d i s c r e t e l y concave f u n c t i o n f i s n o t separable.
U.Faigle
128
REFERENCES Birkhoff, G . , L a t t i c e Theory (A.M.S. Colloq. Publ., Providence, 3rd ed. 1967). Boruvka, O . , 0 j i s t m problemu minimalnim, Prace Moravske Prirodovedecke Spolecnosti 3 (1926) 37-53. Crapo, H . H . ,
Geometric d u a l i t y and the Dilworth completion, Proc. I n t . Conf.
on Combinatorics, Calgary, (Gordon and Breach, New York, 1970) 37-46.
Crawley, P . , and Dilworth R . P . , Algebraic Theory of L a t t i c e s , (Prentice-Hall, Englewood C l i f f s , N.J., 1973). Croitoru, C . , A n a n a l y s i s of t h e greedy algorithm f o r p a r t i a l l y ordered s e t s , Discr. Appl. Math. 4 (1982) 113-117. Dilworth, R.P., Dependence r e l a t i o n s i n a semimodular l a t t i c e , Duke. Math. J . 11 (1944) 575-587. Dunstan, F.D.J., Ingleton, A.W., and Welsh, D.J.A., Supermatroids, Proc. Conf. Comb. Math., (Math. I n s t . Oxford, 1972) 72-122. Edmonds, J . , Submodular functions, matroids and c e r t a i n polyhedra, Proc. I n t . Conf. on Combinatorics, Calgary. (Gordon and Breach, New York, 1970) 69-87. Edmonds, J . , Matroids and t h e greedy algorithm, Math. Programing 1 (1971) 127-1 36. Faigle, U., The greedy algorithm f o r p a r t i a l l y ordered s e t s , Discr. Math. 28 (1979) 153-159. Faigle, U., 26-51.
Geometries on p a r t i a l l y ordered sets, J . Comb. Th. B 28 (1980)
Gale, D., Optimal assignments i n an ordered s e t : an a p p l i c a t i o n of matroid theory, J . Comb. T h . 4 (1968) 176-180. G i r l i c h , E . , and Kowaljow, M.M., Nichtlineare d i s k r e t e Optimierung, (Akademie-Verlag, B e r l i n , 1981). Korte, B . , and Hausmann, D., An a n a l y s i s of the greedy h e u r i s t i c f o r independence systems, Ann. Discr. Math. 2 (1978) 66-74. Korte, B . , and L o v k z , L., Mathematical s t r u c t u r e s underlying greedy algorithms, ( P r e p r i n t Univ. Bonn, Reoort No. 81189-0R, 1981). Lovgsz, L . , Matroid matching w i t h some a p p l i c a t i o n s J. Comb. Th. B 28 ( 1980) 208- 236. McDiarmid, C.J.H., Rado's theorem f o r polymatroids, Math. Proc. Camb. P h i l . SOC. 78 (1975) 263-281.
Annals of Discrete Mathematics 19 (1984) 129-134 0 Elsevier Science PublishersB.V. (North-Holland)
129
AN ALGORITHM FOR THE UNBOUNDED MATROID INTERSECTION POLYHEDRON A. Frank*and E. Tardos Research I n s t i t u t e f o r Telecomunication, Budapest, Hungary.
An a l g o r i t h m i c r e l a t i o n , between r e s u l t s o f Edmonds, Cunningham, McDiarmid and G r o f l in-Hoffman, i s discussed.
INTRODUCTION Throughout t h e paper we suppose two matroids M1 and M2 ( w i t h o u t loops) on a f i n i t e groundset E w i t h rank f u n c t i o n s rl, r 2 and a non-negative weight f u n c t i o n
w on E.
L e t us denote the maximum c a r d i n a l i t y o f a comnon independent s e t i n A
by r ( A ) . I t i s known t h a t r ( A ) = min(r,(X) + r 2 ( A - X ) ) proved t h e Matroid Polyhedron I n t e r s e c t i o n Theorem:
THEOREM 1.
[Z].
I n [2]
Edmonds a l s o
The 1i n e a r system
x a 0, d e f i n e s t h e convex h u l l
x(A)
Q
min(rl(A),r2(A))
for
A c E
(11
P o f conmon independent sets o f M1 and M2 and (1) i s
t o t a l l y dual i n t e g r a l . (A l i n e a r system Ax 4 b i s c a l l e d t o t a l l y dual i n t e g r a l o r TDI i f the l i n e a r programming dual min(yb: y
0, yA = w ) has an i n t e g r a l optimum f o r each i n t e g r a l
w whenever t h e optimum e x i s t s .
A b a s i c f e a t u r e o f T D I systems i s t h a t they
d e f i n e a polyhedron whose f a c e t s c o n t a i n i n t e g e r p o i n t s [4,8]). Edmonds [3]
a l s o provided a good a l g o r i t h m f o r o p t i m i z i n g a l i n e a r o b j e c t i v e
over P and f o r producing an optimal s o l u t i o n t o t h e l i n e a r p r o g r a m i n g dual. Fulkerson [6]
proposed t o i n v e s t i g a t e an unbounded polyhedron i n connection w i t h
matroid intersections.
Denoting by Pk the convex h u l l o f k-element comnon inde-
pendent s e t s o f M1 and M2 Fulkerson conjectured and l a t e r Cunningham [l] and McDiarmid [g]
independently proved t h a t Pk
+ Rk
A C- E l . (2) showed t h a t the l i n e a r system i n ( 2 ) i s T D I .
= { x : x(A) a max(0,k-r(E-A))
F i n a l l y , Grb'flin and Hoffman
p]
for
'* Research p a r t i a l l y supported by Sonderforschungsbereich 21 (DFG) I n s t i t u t
Operations Research, U n i v e r s i t a t Bonn.
fur
A. Frank and E. Tardos
130
The o r i g i n a l p r o o f o f G r o f l i n and Hoffman r e l i e s on t h e concept o f l a t t i c e p o l y hedra and does n o t seem t o p r o v i d e an a l g o r i t h m f o r f i n d i n g t h e optimal s o l u t i o n s i n t h e corresponding primal and dual l i n e a r programs.
The purpose o f t h i s note
i s t o present a c o n s t r u c t i v e p r o o f f o r t h e Groflin-Hoffman theorem by d e s c r i b i n g such an a l g o r i t h m . For a subset A S E and a weighting w on and w(A) = z(w(e): e o f subsets, F
E
h
A).
E,
XA denotes t h e i n c i d e n c e v e c t o r o f A
For a number x l e t x+ = max(0,x).
3 i s c a l l e d w-minimal i n 7:
Given a f a m i l y 7
i f w(F) s w ( X ) f o r each X
E
9.
PROOF AND ALGORITHM Without l o s s o f g e n e r a l i t y we can suppose t h a t rl(E)
= r 2 ( E ) = r ( E ) = k.
hen
t h e theorem o f G r o f l i n and Hoffman mentioned i n t h e I n t r o d u c t i o n i s as f o l ows.
THEOREM 2. [7]
For every i n t e g r a l weight f u n c t i o n w
>,
0 t h e dual p a i r o f
inear
programs min(wx: x(A)
>,
k-r(E-A)) = max(zArE y ( A ) ( k - r ( E - A ) ) :
(3)
Y(A) a 0, zAsE Y(A)XA=W) have i n t e g r a l optimum s o l u t i o n s .
Proof and algorithm.
Since an o p t i m a l i n t e g r a l v e c t o r i n t h e l e f t - h a n d s i d e o f
( 3 ) corresponds t o a comnon base of H1 and M2, t o prove Theorem 2 we have t o f i n d a comnon base 6 and an i n t e g r a l v e c t o r y which p r o v i d e e q u a l i t y i n ( 3 ) . By complementary slackness, t h i s i s e q u i v a l e n t t o showing t h a t y ( A ) > 0 i m p l i e s ( l B n A [ = ) x(A) = k-r(E-A) subset o f E-A.
t h a t i s B-A i s a maximal c a r d i n a l i t y common independent
Such a s e t A i s c a l l e d admissible ( w i t h r e s p e c t t o B).
Thus our
purpose i s t o f i n d a common base B and a f e a s i b l e v e c t o r y so t h a t y ( A ) > 0 o n l y
ifA i s admissible. I n [!] we proved t h e f o l l o w i n g v e r s i o n o f Theorem 1 .
LEMMA 3.
Given M1,M2,w,
a comnon base B i s w-minimal i f and o n l y i f t h e r e a r e
weights w1 ,w2 such t h a t w1+w2=w and B i s a wi-minimal Moreover, i f w i s integer-valued, The p r o o f o f t h i s lemma i n t h e w-minimal
[q
wi
base o f Mi i = 1,2.
can be chosen integer-valued.
i s by d e s c r i b i n g an a l g o r i t h m which provides both
B and t h e r e q u i r e d weight s p l i t t i n g w1,w2.
s t a r t s w i t h these data and c o n s t r u c t s y from them.
The present method
An algorithm for the unbounded matroid intersection polyhedron
... <
L e t p1 <
p,
and q1 <
... <
r e s p e c t i v e l y and s e t po = qo =
qfi be t h e d i s t i n c t v a l u e s o f t h e w e i g h t s w1,w2, Arrange t h e elements o f E i n t o a two-dimen-
-m.
s i o n a l a r r a y so t h a t x E E i s i n e n t r y ( i , j ) i f wl(x)
= pi and w ( x ) = q
2 Note t h a t t h e r e may be e n t r i e s w i t h more t h a n one element i n them. (i,j), i f p. i
s e t Aij = { v E E: wl(v) + q J > 0 and pmi l t qj-l
LEMMA 4.
If (i,j)
Proof.
L e t A1 = i v
AIU A2
=
E-Aij
< 0.
i s c r i t i c a l , t h e s e t AiJ
E: wl(v)
E
<
j' F o r an e n t r y
C a l l an e n t r y ( i , j ) c r i t i c a l w2(v) > q j } . The key o b s e r v a t i o n i s t h e f o l l o w i n g
3 pi,
and s i n c e ( i , j )
131
i s admissible.
and A2 = Cv
pi)
E
E: w2(v)
i s c r i t i c a l , A 1 f l A2 =
0.
Then < q.1. J What we show i s t h a t
B n A h i s a maximal c a r d i n a l i t y independent s u b s e t o f Ah i n Mh ( h = 1,2). i n d i r e c t l y , t h e r e e x i s t s an element v i n Mh t h e n t h e r e i s an element u
E
E
Ah-B such t h a t ( B n Ah)
B-Ah such t h a t B
S i n c e wh(v) < wh(u) t h e wh-weight o f B
+
v
-
+
v
-
+
If, v i s independent
u i s a base o f M.,
u i s s t r i c t l y smaller than t h a t o f
B, a c o n t r a d i c t i o n . /
otherwise
0 and y ( A . . ) > 0 i m p l i e s t h a t ( i , j ) i s c r i t i c a l , and then, by 1J y(A)=w(E) f o r i s a d m i s s i b l e . The f e a s i b i l i t y o f y, t h a t i s E , i m m e d i a t e l y f o l l o w s by a p p l y i n g t h e n e x t t r i v i a l lemna f o r cij = (pi+qj)
Obviously y(A) Lemma 4, Aij e
LEMMA 5.
L e t C = ( c .) be an m by n m a t r i x . Then f o r 1 6 s 6 m y 1 6 t 4 n iJ s t Cst = ' i = 1 ' j = l (Cij+Ci-lj-l-Ci-lj-'ji-l)
where coj and c 10 . i s meant t o be 0. By now t h e p r o o f o f Theorem 2 i s complete.
//
To i l l u s t r a t e t h e method c o n s i d e r t h e f o l l o w i n g example w i t h two g r a p h i c a l m a t r o i d s on e i g h t elements a
b
c
d
e
f
g
h : t h e weights
1
3
1
5
5
0
8
6
+.
A. Frank and E. Tardos
132
The comnon base and t h e weight s p l i t t i n g provided by t h e a l g o r i t h m i n
F]:
B = {a,e,d,f}
wl:
w2:
a
b
c
d
5
5
3
3
-4
-2
-2
2
e
f
3
-
2
g 2
2
h
5
3
3
3
The array:
-4
-2
F i n a l l y , we remark t h a t S c h r i j v e r DO]
2
3
proved a theorem f o r polymatroids
analogous t o the r e s u l t o f G r o f l i n and Hoffman. extends t o polymatroids as w e l l .
I t can be shown t h a t our method
An algorithm for the unbounded matroid intersection polyhedron
133
REFERENCES Cunningham, W.H., An unbounded m a t r o i d i n t e r s e c t i o n polyhedron, L i n e a r Algebra and I t s Appl. 16 (1977) 209-215. Edmonds, J . , Submodular f u n c t i o n s , matroids and c e r t a i n polyhedra, i n : Guy, R. e t a1 (eds.), Combinatorial S t r u c t u r e s and t h e i r A p p l i c a t i o n s (Gordon and Breach, New York, 1970) 69-87.
.,
Edmonds, J . , Matroid i n t e r s e c t i o n , Annals o f D i s c r e t e Math. 4 (1979) 39-49. Edmonds, J . , and Giles, R., A min-max r e l a t i o n f o r submodular f u n c t i o n s on graphs, Annals o f D i s c r e t e Math. 1 (1977) 185-204. Frank, A., A weighted m a t r o i d i n t e r s e c t i o n algorithm, Journal o f Algorithms 2 (1981) 328-33. Fulkerson, D.R., Blocking and a n t i b l o c k i n g p a i r s o f polyhedra, Math. P r o g r a m i n g 1 (1971) 108-194. G r o f l i n , A., and Hoffman, A.J., (1981) 188-194.
On m a t r o i d i n t e r s e c t i o n s , Combinatorica 1
Hoffman, A.J., A g e n e r a l i z a t i o n o f max-flow min-cut, Math. Programming 6 (1974) 352-359. McDiarmid, C.M., Blocking, Anti-blocking, and p a i r s o f matroids and p o l y matroids, J . Combinatorial Theory B 25 (1978) 313-325. Schri j v e r , A.,
Polyhedral Combinatorics, (John Wiley) t o appear.
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 135-146 0 Elsevier Science Publishers B.V. (North-Holland)
135
ALGEBRAIC FLOWS
A.M.
Frieze
Department o f Computer Science & S t a t i s t i c s Queen Mary C o l l e g e U n i v e r s i t y o f London M i l e End Road London E l 4NS, G.B. We c o n s i d e r a n a t u r a l g e n e r a l i s a t i o n o f t h e maximum v a l u e f l o w problem, where f l o w v a l u e s a r e elements o f an o r d e r e d d-monoid. Assuming c o n s e r v a t i o n o f f l o w a t v e r t i c e s and c a p a c i t y c o n s t r a i n t s on t h e a r c s we a r e a b l e t o p r o v e a MaxFlow Min-Cut Theorem u s i n g a f l o w augmenting p a t h a l g o r i t h m . I f t h e monoid i s weakly c a n c e l l a t i v e t h e n we can make t h e a l g o r i t h m s polynomial l y bounded. INTRODUCTION We c o n s i d e r h e r e t h e problem s t u d i e d b y Hamacher [3]:
we a r e g i v e n
a d i g r a p h D = (V,A) w i t h v e r t i c e s V and a r c s A S V
x
V which (l.la)
i s l o o p l e s s and symmetric a t o t a l l y o r d e r e d commutative d-monoid (H,*,6) w i t h i d e n t i t y e a set
i.e.
H t o t a l l y o r d e r e d by
binary operation
*
c and an a s s o c i a t i v e ,
comnutative
satisfying
(1)
a 6 b i m p l i e s a*c 6 b*c f o r a l l a,b,ceH.
(2)
a
<
b i m p l i e s t h e r e e x i s t s c > e such t h a t a*c = b f o r a,b
a c a p a c i t y f u n c t i o n c:A
+
H such t h a t c ( u )
>
e for u
E
A.
2 s p e c i a l v e r t i c e s s and t. An s - t f l o w i s a f u n c t i o n f : A
+
E
H.
(1.lc) (l.ld)
H satisfying A
(1.2a)
f(v:V) = f(V:v) f o r v # s,t
(1.2b)
e
where f o r s e t s X,Y 5 V
(l.lb)
6
f ( u ) s. c ( u ) f o r u
X : Y = {(v,w) f(S) =
E
A:v
34
E
X,w
E
E
Y } and f o r S 5 A
f(v,w)
(V,W)ES N a t u r a l l y v:V i s an a b b r e v i a t i o n o f { v } : V . The v a l u e v a l ( f ) o f f l o w f i s d e f i n e d t o be f ( s : V ) . The problem o f f i n d i n g t h e s - t f l o w t h a t maximises v a l ( f ) i s a n a t u r a l
136
A . Y Frieze
g e n e r a l i s a t i o n o f t h e c l a s s i c a l maximum f l o w problem o f Ford and Fulkerson examples can be found i n [3].
[ -and
Hamacher made t h e p o i n t t h a t i n p r a c t i c e , minimum
capacity cuts are more important than maximun flows, which stresses t h e importance o f a Max-Flow Min-Cut Theorem. Unfortunately, 1.2 i s n o t q u i t e r e s t r i c t i v e enough t o make a ' s e n s i b l e ' problem and f u r t h e r r e s t r i c t i o n s a r e required.
Indeed we can see from the f o l l o w i n g ex-
ample t h a t the given d e f i n i t i o n o f f l o w leaves problems:
2 Figure 1 Note t h a t 1.2b i s s a t i s f i e d and y e t f ( s : V ) = f ( V : t ) as one
Here H = (Rt,max,<). might expect.
We w i l l consider 2 e s s e n t i a l l y d i f f e r e n t ways o f overcoming t h i s
problem.
cuts As usual a s e t X c_ V such t h a t s capacity c(X:x).
E
X, t
E
f
= V-X generates a c u t X:!
which has
Note t h a t i f i n the above examole we assume f ( u ) = c ( u ) f o r each
arc, then where X = (s,1,2,3)
we have v a l ( f ) = 2
>
0 = c(X:R) and so there i s no
Max-Flow Min-Cut Theorem f o r a r b i t r a r y flows. Hamacher d e a l t w i t h t h i s problem by p u t t i n g a r e t u r n a r c ( t , s ) and reDlac rig 1.2b by
f ( x : R ) = f(2:X) and assuming t h a t (ti,*)
for a l l
xcv
(1.3)
has a weakly c a n c e l l a t i v e p r o p e r t y (see Section 3
.
Thus
t o make any progress we must r e s t r i c t our a t t e n t i o n t o flows w i t h a d d i t i o n a l properties. I n Section 2 we consider a c l a s s o f flows f o r which we are a b l e t o prove, cons t r u c t i v e l y , a Max-Flow Min-Cut Theorem w i t h o u t making any e x t r a assumptions about the d-monoid H.
Unfortunately, t h i s a l g o r i t h i s n o t (proved t o be) p o l y n a n i a l l y
bounded. I n Section 3 we consider a d i f f e r e n t class o f flows and assume
H i s weakly cancel-
l a t i v e so t h a t we again have a Max-Flow Min-Cut Theorem and t h i s time a polyn o m i a l l y bounded algorithm f o r c o n s t r u c t i n g a maximum flow.
137
Algebraic flows DECOMPOSABLE FLOWS F o r a f l o w f l e d D ( f ) be t h e d i g r a p h ( V , A ( f ) )
where A ( f ) = { u
E
A: f ( u )
>
el.
A
f l o w f i s a P-flow i f (2.la)
D ( f ) i s a s i m p l e p a t h P ( f ) from s t o t ( p l u s i s o l a t e d v e r t i c e s )
H such t h a t f ( u )
there exists a = a ( f )
= a
for
u
E
A ( f ) and (2.lb)
f ( u ) = e f o r u E A-A(f).
A f l o w f i s decomposable i f t h e r e e x i s t P-flows fl,f 2,...,fk ( k = k ( f ) ) such t h a t f = fl*f2* ...f k ( i . e .
f ( u ) = fl(u)*f2(u)*
...f k ( u )
for u
E
A).
The m a i n r e s u l t o f t h i s s e c t i o n i s t h e f o l l o w i n g Theorem 2.1.
The maximum v a l u e o f a decomposable s - t f l o w i s equal t o t h e minimum
c a p a c i t y o f a c u t s e p a r a t i n g s and t. T h i s w i l l be proved u s i n g a f l o w augmenting p a t h argument, b u t f i r s t we need t o i n t r o d u c e some n o t a t i o n and p r o v e some s i m p l e lemnas. For a
E
H
Lemma 2.1.
dom(a) = { b a
E
E
H: a*b = a } and f o r a f l o w f dom(f) = d o m ( v a l ( f ) ) .
dom(b) and c > b i m p l i e s a
E
dom(c)
Proof. L e t c = b*d, then a*c = a*b*d = b*d = c Lemma 2.2. ___ Proof.
I f f i s a decomposable f l o w t h e n v a l ( f ) + f ( u ) f o r a l l u
E
A.
S t r a i g h t f o r w a r d b y i n d u c t i o n on k ( f ) .
( n o t e t h a t o u r example o f F i g u r e 1 shows t h i s i s n o t t r u e i n g e n e r a l f o r d-monoid flows). F o r a decomposable f l o w l e t K = K ( f ) = [k(f)]
Lemma 2.3.
L e t f be a decomposable f l o w .
where f o r p o s i t i v e i n t e g e r n
I f t h e r e e x i s t s u e A and s e t s 1,J
I c J c K such t h a t (1)
fi(4 > e
(2)
f I ( U ) = fJ(U)
for i
E
L
=
J-I
then v a l ( f ) = v a l ( f M ) where M = K-L. Proof.
L e t a = f L ( u ) = v a l ( f L ) by ( 1 ) .
L e t b = fI(u)
and c = val(f,,,).
Then
'4.M. Frieze
138
b
f M ( u ) 4 c b y Lemna 2.2.
a
E
dom(b) by ( 2 ) .
A p p l y i n g Lemna 2.1 g i v e s
a c dom(c). Lemma 2.4.
L e t f b e a decomposable f l o w and X:! val(f)*f(X:x)
Proof. arc i n
a cut.
Then
(2.2)
= f(X:!)
E q u a t i o n 2.2 h o l d s f o r P - f l o w s u s i n g t h e f a c t t h a t an s - t p a t h has one more
X:g
t h a n i t has i n
2:X.
The t r u t h o f 2.2 i n g e n e r a l f o l l o w s b y combining
t h e s e p a r a t e e q u a t i o n s f o r each p a t h . N o t e t h a t 2 . 2 i s e s s e n t i a l l y Hamacher's c o n d i t i o n and g e n e r a l l y speaking one has t o add e x t r a c o n d i t i o n s t o 1.2b i n o r d e r t h a t 2.2 o r 1.3 h o l d s . C o r o l l a r y 2.5.
L e t f b e a decomposable f l o w and X : R a c u t .
Then
v a l ( f ) 6 c(x:ji)
(2.3)
Proof. -
C o r o l l a r y 2.6.
I f f i s a decomposable f l o w t h e n
f(s:V) = f(V:t) Proof.
Put X = V - { t ;
i n 2.2.
We d e f i n e n e x t the i n c r e m e n t a l graph G ( f ) = ( V , E ( f ) ) f.
F o r (v,w)
E
V
x
V l e t i>(V,W) = (w,v)
E ( f ) = I u = (v,w)
-3
V
x
w i t h respect t o a given flow
then V):
( a ) v = t and w = s and (b) u
E
A,f(u)
{x:x*f(u)
<
c ( u ) and
= c ( u ) ~ n dom(f) =
D
or (c)
~ ( u )E A and f ( p ( u ) )
# dom(f) i
The s e t of a r c s EF of G ( f ) d e f i n e d i n ( b ) a r e c a l l e d f o r w a r d a r c s and t h e s e t o f a r c s EB d e f i n e d i n ( c ) a r e c a l l e d backward a r c s . A s i m p l e p a t h f r o m s t o t i n G ( f ) i s c a l l e d a f l o w augmenting Dath w i t h r e s p e c t t o f.
We n e x t p r o v e
139
Algebraic j k w s Lemma 2.5.
L e t f be a decomposable f l o w f o r which G ( f ) has no f l o w augmenting
paths.
Then f i s a maximum f l o w .
Proof.
Let X = I v
t
f
E
V:
E
v i s r e a c h a b l e f r o m s by a p a t h i n G ( f ) } .
Then s
E
X and
by assumption.
For u
X:g l e t g ( u )
E
. g(u)
dom(f) be such t h a t f ( u ) * g ( u ) = c ( u )
E
can r e a c h a v e r t e x o f X.
Note a l s o t h a t s i m i l a r l y u
e x i s t s e l s e we
x:X implies f ( u )
E
E
dm(f).
Thus V a l ( f ) = Val( f ) * f (
i:x)*g( x :2)
= f(X:X)*g(X:2) = c(X:R)
Thus f i s a maximum f l o w and X generates a minimum c u t . P r o v i n g t h e converse r e s u l t i . e .
t h a t g i v e n a f l o w augmenting p a t h we can a c t u a l l y T h i s i s i n e f f e c t why we
augment t h e f l o w has proved somewhat more d i f f i c u l t . a r e l o o k i n g a t decomposable f l o w s .
Lemma 2.6.
I f f i s a decomposable f l o w and G ( f ) has a f l o w augmenting p a t h then
t h e r e i s a decomposable f l o w
Proof.
Let
+
w i t h Val(+) > v a l ( f ) .
P b e a f l o w augmenting p a t h w i t h r e s p e c t t o f and l e t t h e a r c s X o f P
be d i v i d e d i n t o f o r w a r d a r c s XF and backward a r c s XB ( i t s i m p l i f i e s t h i n g s s l i g h t l y t o r e f e r t o t h e a r c s i n XB as t h e y a r e i n A i n s t e a d o f i n
.
XF l e t g ( u ) t dom(f) b e such t h a t f ( u ) * g ( u ) = c ( u
u
E
e
= min(min(g(u): u
E
XF), m i n ( f ( u ) : u
E
e 6
For
Let
XB).
As expected we a r e g o i n g t o c o n s t r u c t a f l o w f f o r wh ch Val(;) as
p(A)).
= v a l ( f ) * e > Val ( f )
dom(f) b y c o n s t r u c t i o n .
A problem a r i s e s f o r u
E
XB i f we want t o ' s u b t r a c t '
e
from f ( u ) i . e . choose f ( u )
such t h a t f ( u ) * e = f ( u ) , as one expects t o do i f one f o l l o w s an analogous proced u r e t o t h e c l a s s i c a l r e a l case.
The problem a r i s e s f r o m t h e p o s s i b i l i t y o f t h e r e
b e i n g s e v e r a l choices f o r f ( u ) and i t i s n o t c l e a r ( t o t h e a u t h o r ) which, i f any, maintain conservation o f flow. cedure t h a t we now d e s c r i b e . Phase 1.
T h i s we hope w i l l j u s t i f y t h e r a t h e r complex p r o There a r e 3 phases t o t h e update o f f.
A t t h e end o f t h i s phase, t h e decomposition o f f w i l l have been amended
( b u t n o t f i t s e l f ) so t h a t f o r each u
E
XB
t h e r e e x i s t s r = r ( u ) such t h a t
e
= f,(u)*f2(u)*
...*f r ( u ) .
(2.3)
140
A.M. Frieze
Suppose t h e r e e x i s t s u
Define x,y
f
[PI
(u)
>
F
H by
F
XB f o r which 2.3 f a i l s , then f o r some p 6 k ( f ) we have
6 = f
IP-11 x necessarily.
Now renumber f
P+ 1
,..., f k as
( u ) * x and x*y = f
[PI
( u ) which w i l l be p o s s i b l e as
fp+2,... , f k + l t o leave a gap f o r a new fp+l.
Replace a ( f p ) by x and add a new P-flow fp,l
Let Q = P(fp).
t o t h e decomposition
w i t h P ( f p + l ) = Q and a ( f p + l ) = y.
C l e a r l y 2.3 now holds f o r u w i t h r = p t l and i f 2.3 h e l d f o r u ' = u b e f o r e t h i s change, i t w i l l s t i l l h o l d b u t r ( u ' ) may have increased by 1.
We s h a l l use the term s p l i t t i n g f Phase 2.
P
u s i n g x,y t o denote the above c o n s t r u c t i o n .
A t the end o f t h i s phase t h e d e c m p o s i t i o n o f f w i l l have been amended
so t h a t t h e r e i s a sequence al ,a2,. such t h a t f o r each u
. . ,a P
o f mmbers o f H - { e l
XB t h e r e e x i s t s a permutation
E
o f t h e n o n - i d e n t i t y members o f t h e sequence
...,f r ( u ) ,
fl(u),f2(u),
t o al,a2,.
. . ,a P
Suppose then t h a t XB = {u, ,u2,.
u
E
{ U ~ , U ~ , . . . , U ~ - ~ } ,which
(thus
r =
e
.. ,ul}
r(u), which i s i d e n t i c a l
* * . ..ap).
= al a2
and assume i n d u c t i v e l y t h a t 2.4 holds f o r
holds t r i v i a l l y f o r m = 2.
We show now how t o extend
2.4 t o i n c l u d e .u, Suppose then t h a t t h e n o n - i d e n t i t y members o f t h e sequence f (urn),f 2( urn) ,. . . fr(um), r = r ( u m ) are bl,b2
,..., b
9'
We then i t e r a t i v e l y do t h e f o l l o w i n g : i f al = bl:
cl:= al;
i f a,
l e t al = ai*b,;
.,
bl:
continue w i t h a2,...ap,b2,... cl:= bl;
bq
.
f o r i:= 1 t o m-1 l e t j ( i ) be such t h a t al
corresponds t o f . ( u ) i n the g i v e n permutation o f t h e n o n - i d e n t i t y J(i) i members o f f l ( u l ) ; f o r j d j ( l ) , . . . j (m - 1 ) ) s p l i t f j using ai,bl; continue w i t h ai,a 2,...ap,b2,...bq. i f al
bl:
l e t bl = bi*al;
s p l i t t h e P-flow f . such t h a t f . ( u ) J ~m u s i n g bi,al; continue w i t h a2,...ap,bi,b2,...bq.
cl:=
corresponds t o bl,
al;
' A f t e r a t most p+q-1 i t e r a t i o n s o f t h e above we w i l l have produced a sequence
Algebraic flows c1,c2, bl
...c P' and
,. . .bq.
141
have exhausted one ( o r b o t h ) o f t h e sequences al,
L e t dl
,. . .dq'
...a P o r
denote t h e remainder o f t h e unexhausted sequence.
...bq
convenience assume t h a t bl,
For
g e t s exhausted f i r s t , t h e o t h e r case i s s i m i l a r .
We now f i n d t h a t f o r i = 1 ,...,m-1 t h e n o n - i d e n t i t y members o f t h e sequence fl(ui)
,... f r ( u .i ) ,
r = r(ui)
a r e a p e r m u t a t i o n o f c1 ,... c p,,dl,...d
n o n - i d e n t i t y members o f t h e sequence fl(um),
and t h a t t h e q' r = r ( u m ) a r e a permuta-
...fr(um),
and f u r t h e r t h a t d, *d *.. .*dq, E dom(c1*c2* ...c ) . Note t h a t -*.cP' P' t h e P-flows corresponding t o dl, ...d are d i s t i n c t from those corresponding t o q' as t h e f o r m e r have n o t been a f f e c t e d by t h e above procedure. We can cl,.. . c P' then a p p l y Lemma 2.3 t o remove t h e f l o w s corresponding t o d, ,. and we f i n d dq' t h a t 2.4 h o l d s w i t h u, i n c l u d e d .
t i o n o f cl,
..
Phase 3.
L e t al
,... a P be
as i n 2.4 and l e t S = {al
t h e f o l l o w i n g : l e t I = {i:a ( f i )
= a].
one u n i t o f f l o w a l o n g each p a t h P(fi)
,... aPI .
For each a
E
S do
C o n s t r u c t an i n t e g r a l f l o w g by sending f o r i E I.
L e t m b e equal t o t h e number
Augment g by an amount m u s i n g t h e f l o w augmenting
o f t i m e s a occurs i n al,..
path P t o c r e a t e a new i n t e g r a l f l o w h .
Decompose h i n t o a s e t o f f l o w s o f v a l u e
1 a l o n g paths from s t o t as f o l l o w s : f i n d a Dath Q from s t o t u s i n g o n l y a r c s u Decrease h b y 1 on each a r c o f Q.
' f o r which h ( u ) > 0.
S t o r e Q.
t h e r e i s no p a t h from s t o t w i t h p o s i t i v e h f l o w i n a l l i t s a r c s . be t h e paths s t o r e d . paths Q1,
...Q
q
Replace t h e P-flows fi f o r i
E
Repeat u n t i l L e t Ql,
...0'q
I b y t h e s e t o f P-flows w i t h
and f l o w v a l u e a.
I t s h o u l d b e c l e a r t h a t t h e above 3 phase procedure does i n f a c t augment f t o a flow
?- w i t h
Val(;)
= val(f)*e.
To complete t h e p r o o f o f Theorem 2.1 we must show t h a t we need o n l y augment a f i n i t e number o f times.
T h i s i s n o t d i f f i c u l t because a f t e r an augmentation a l o n g
a p a t h P e i t h e r a f o r w a r d a r c o f P becomes s a t u r a t e d o r a backward a r c o f P becomes f l o w l e s s .
Thus i f we a p p l y t h e obvious analogue o f t h e D i n i c A l g o r i t h m
[l] , t h e same arguments can be used t o show t h a t no more t h a n O ( 1 V I 4 ) augmentat i o n s a r e needed u n t i l G ( f ) has no f l o w augmenting paths. Complexity o f t h e a l g o r i t h m .
Although f i n i t e , t h e a l g o r i t h m above i s n o t p o l y -
nomial as t h e s i z e k ( f ) o f t h e decomposition seems t o b e capable t o growing exponentially.
The problem occurs i n Phase 2 where k c o u l d double (we can e a s i l y
ensure t h a t o n l y I A ( P - f l o w s a r e c r e a t e d f o r each a along a
E
E
S i n Phase 3 by r e d u c i n g h
Q by enough t o c r e a t e a t l e a s t one new h f l o w l e s s a r c ) .
142
A.M. Frieze
I n some cases t h e a l g o r i t h m can be made polynomial by ensuring t h a t a l l t h e paths P(fi),
i = 1,
a(fi)*a(f.)
...k
J
- i f P(fi) = P ( f J. ) we can r e p l a c e a(fi) by Thus i f we consider a c l a s s o f digraphs i n which t h e
are d i s t i n c t
and d e l e t e f j .
IVI
nunber o f s - t paths i s bounded by a polynomial i n
then t h e a l g o r i t h m becomes
polynanial.
ACYCLIC FLOWS Recall t h a t f o r a flow f s a t i s f y i n g 1.2 we d e f i n e A ( f ) = { u say t h a t a f l o w i s a c y c l i c i f t h e digraph D ( f ) = (V,A(f)) cycles.
A: f ( u ) > e l .
E
Note t h a t o u r 'problem' flow o f F i g u r e 1 i s n o t a c y c l i c .
t h a t t : V = V:s = Lemna 3.1.
We
has no ( d i r e c t e d ) We now assume
0 w i t h o u t any r e a l l o s s o f g e n e r a l i t y .
L e t f be an a c y c l i c f l o w and l e t
X:8 be a c u t s e p a r a t i n g s and t .
Then f(s:V)*f(X:x) Proof.
(3-3)
= f(X:R)
...
For t h e purposes o f the Lemma we assme V = {l, n l , s = 1 and t = n and
s i n c e D ( f ) i s a c y c l i c we can assume t h a t f ( i , j )
e implies i c j .
augment A w i t h those a r c s ( i , j ) where 1 6 i < j d n and (i,j)
I
A.
We t e m p o r a r i l y
We p u t
f ( i , j ) = e f o r such a r c s and note t h a t f i s s t i l l an a c y c l i c f l o w .
ii)
L e t p = p ( x ) = max( i:iE. x ) , q = q(X) = min( i:i E Case l : q > p. case.
Thus X = 11
,... p ) , R
= {p+l,-.. n l .
Note t h a t
f(f:X)
= e i n this
We v e r i f y 3.1 by i n d u c t i o n on p.
I f p = 1 then s:V = X : i and so t h e r e i s n o t h i n g t o prove. Suppose then we have v e r i f i e d t h i s case f o r
1x1
p and suppose now t h a t
c
1x1
= p.
...p- 11 then L e t Y = {l, f(Y:Y) = f(Y:p)*f(Y:R) = f(p:ii)*f(Y:f)
using 2 . l b
= f(X:l)
and t h e i n d u c t i o n s t e p i s e a s i l y completed. Case 2: q
<
p.
We proceed by i n d u c t i o n on p-q.
Case 1 provides t h e base p-q
Now f ( s : V ) * f ( R:X) = f ( s : V ) * f ( i i - t q l : X ) * f ( q : X ) = f(s:V)*f(R-{q):X
u {q})*f(q:X)
<
0.
Algebraic .flows
s i n c e f ( R - { q } : = q ) = e.
143
Also f (X:ii) = f ( X : q ) * f (X :R-Iq}) = f(q:X)*f (q:R-{q})*f (X:R-{ql)
Thus
since f(X:q) = f(V:q) = f(q;V).
f(X:R) = f(q:X)*f(X
u
{q}:ii-{ql).
Thus 3.1 h o l d s i f f(s:V)*f(X-{q}:XU
I q } ) = f(X
u {q}:l-{ql)
B u t t h i s can be assumed i f we use i n d u c t i o n on p-q,
s i n c e i f p(X) > q(X) we have
P(X) = P ( X U { q ( X ) } ) and q(X U { q ( X ) I ) > q ( X ) . Note t h a t t h e c o n c l u s i o n s o f C o r o l l a r i e s 2.5 and 2.6 t h u s h o l d f o r a c y c l i c f l o w s . Flow augmenting paths a r e d e f i n e d e x a c t l y as i n S e c t i o n 2, ( e x c e p t t h a t we can r e - d e f i n e EF = { u
6
1 dom(f)}
A: c ( u ) - f ( u )
which has t h e advantage o f b e i n g
s i m p l e r and computable i n O( ( A ] ) t i m e ) . Lemna 3.2.
I f f i s an a c y c l i c f l o w and G ( f ) has no f l o w augmenting p a t h s t h e n f
i s a maximum f l o w . P r o o f ( i d e n t i c a l t o Lemna 2.5). We now assume t h a t o u r d-monoid obeys t h e weak c a n c e l l a t i v e r u l e a*b = a*c i m p l i e s b = c o r a*b = a f o r a,b,c
E
H.
(3.2)
Then i t can be shown t h a t t h e r e e x i s t s a n o t h e r o r d e r e d s e t ( I , & ) and a s u r j e c t i v e function in: H
+
A satisfying a 4 b implies in(a)
Q
(3.3a)
in(b)
in(a*b) = max(in(a),in(b))
(3.3b) (3.3c)
i n ( a ) < i n ( b ) i m p l i e s a*b = b a*b = a*c and i n ( a ) = i n ( b ) = i n ( c ) i m p l i e s b = c I t f o l l o w s t h a t t h e element c d e f i n e d i n l . l ( b ) ( 2 ) i s unique.
t h i s b y a-b and extend t h e d e f i n i t i o n o f Note t h a t i n ( a - b ) = i n ( a ) f o r a For i
E
I l e t H ( i ) = {a
E
>
-
t o a-a = e.
b.
H:in(a) = i]
L e t K = {iE I : ( H ( i ) l = l}. P r o o f s o f a l l these r e s u l t s can be f o u n d i n Zimmermann [5].
(3.3d)
We s h a l l denote
144
A.M. Frieze
Given a f l o w augmenting path P and XB,XF and 6 as d e f i n e d i n Lemma 2.5 we l o o k i n t h i s case a t the much more s t r a i g h t f o r w a r d way o f updating t h e f l o w : SIMPLE UPDATE Let
f(a) = f(a)*e
a
E
XF
= f(a)-e
a
E
XB
= f(a)
a C P
We assume t h a t we s t a r t t h e a l g o r i t h m w i t h f ( a ) = e f o r a r A.
Now
does n o t i n f a c t guarantee t h a t f i s a flow, l e t alone a c y c l i c .
SIVPLE UPDATE
We n e x t d e f i n e
a quasi-flow f : A + H t o be one t h a t s a t i s f i e s 1.2a and in(f(a)) 6 in(f)
where i n ( f ) = i n ( v a l ( f ) )
f(v:V) = f(V:v) for a l l v
E
(3.4a) (3.4b)
V such t h a t i n ( f ( v : V ) ) = i n ( f ) o r i n ( f ( V : v ) ) ) = i n ( f ) .
f(s:V) = f ( V : t )
(3.4c)
I t i s easy t o prove Lemma 3.3.
I f f i s a q u a s i - f l o w then a f t e r SIMPLE UPDATE f i s a l s o a q u a s i - f l o w .
(Some proofs w i l l be o m i t t e d because they a r e obvious o r a s i m i l a r r e s u l t has been proved i n Hamacher.
Indeed Hamacher used SIYPLE UPDATE b u t assumed t h a t
H ( i ) had i t s own i d e n t i t y ei and l e t a-a = ei f o r a
H(i).
This means t h a t f
remains a f l o w b u t a t t h e 'expense' o f i n t r o d u c i n g ei). Thus from now on f l o w augmenting oaths a r e d e f i n e d i n terms o f quasi-flows, Lanma 3.3.
I f f i s a q u a s i - f l o w and i f G ( f ) has no f l o w augmenting paths then
t h e r e e x i s t s a c u t X:? Lemna 3.4.
such t h a t v a l ( f ) = c ( X : j ) .
L e t f be a q u a s i - f l o w .
Then t h e r e e x i s t s an a c y c l i c f l o w f " such
that val(f) = val(f"). Proof. -
F i r s t d e f i n e f ' by i f ( f ( a ) d dorn(f)) o r ( i n ( f )
f'(a) = f(a) = e (we recognise i n ( f )
E
K and f ( a ) = v a l ( f ) )
otherwise E
K by v a l ( f ) # e and v a l ( f ) * v a l ( f ) = v a l ( f ) ) .
I t i s easy t o see t h a t f ' i s a f l o w because o f 3.4b.
However f ' may n o t be a c y c l i c .
Note t h a t v a l ( f ' ) = v a l ( f ) .
Algebraic flows
I f in(f)
E
145
K f i n d an s - t path Q i n D ( f ) and l e t f " be t h e P-flow w i t h path Q and
value v a l ( f ) .
Such a path e x i s t s by 3.4b and 3 . 4 ~ .
Otherwise i f D ( f ' ) has a c y c l e C l e t f"(a)-e f o r a
C.
E
e
= m i n ( f ' ( a ) : a E C).
Replace f " ( a ) by
One can show f a i r l y e a s i l y t h a t f ' remains a f l o w and t h a t We continue u n t i l we o b t a i n an a c y c l i c f l o w f " .
v a l ( f ' ) i s unchanged.
We can again use t h e O i n i c a l g o r i t h m t o search f o r f l o w augmenting paths and again because a f t e r augmentation along a path
P, one forward a r c o f P becomes
s a t u r a t e d o r one backward a r c o f P becomes f l o w l e s s , t h e a l g o r i t h m w i l l run i n We are thus l e d t o c l a i m t h e f o l l o w i n g r e s u l t :
0 ( l V l 4 ) time. Theorem 3.1.
The maximum v a l u e o f an a c y c l i c f l o w i s equal t o t h e minimum cap-
a c i t y o f a c u t i f t h e d-monoid i s weakly c a n c e l l a t i v e . Other a l g o r i t h m s e.g.
Malhotra, Kumar and Maheshwari [4]
use augmenting paths i n a
l e s s d i r e c t manner and i t i s worth checking t h a t they do n o t c r e a t e problems: these a l g o r i t h m s proceed i n a sequence o f stages. f i n d a flow
7
The aim o f each stage i s t o
i n the l a y e r e d subgraph LG(f) = (V,E(f))
s - t paths i n D ( f ) .
The f l o w
f
made up o f t h e s h o r t e s t
i s chosen t o s a t u r a t e each s - t path i n L G ( f ) .
These a l g o r i t h m s have s t r a i g h t f o r w a r d a l g e b r a i c analogues where we add and subt r a c t and compare as if H was t h e s e t of r e a l s (we never need t o compute a-b where a
i
b).
f,
Having computed
a new f l o w f ' i s computed by
f ' ( a ) = f(a)*f(a)
a
E
EF
(3.5a)
f'(a) = f(a)-f(a)
a
E
EB
(3.5b)
We need t o check t h a t 3.4 h o l d s f o r f ' .
We note f i r s t t h a t i t can e a s i l y be
shown t h a t i n t h e a l g e b r a i c analogue o f t h e a l g o r i t h m o f [4]
that f' satisfies
I t f o l l o w s from V : s = t : V = 0 and t h e d e f i n i t i o n o f E ( f ) t h a t f '
3 . 4 ~ i n LF(g).
s a t i s f i e s 3 . 4 ~i n G also, and t h a t f'(s:V)
= f(s:v)*i(s:V)
(3.6)
We can consider two cases: Case 1: i n ( f ' )
>
in(f).
By considering o n l y those arcs a
E
E ( f ) f o r which i n
( f ( a ) ) = i n ( f ) we see t h a t they must b e forward a r c s and these a r e t h e o n l y arcs t h a t need be considered i n confirming 3.4a and 3.4b, which f o l l o w s as f i s a f l o w .
Note t h a t t h i s n e c e s s a r i l y includes t h e case i n ( f ' ) Case 2: i = i n ( f ' ) = i n ( f u .
E
K.
I n t h i s case H ( i ) i s e i t h e r an ordered group o r
t h e p o s i t i v e cone o f an ordered group
[g
and by consider'ing t h e same s e t o f arcs
146
A.M. Frieze
as i n the f i r s t case we can reduce t o t h e group case which i s e s s e n t i a l l y the same as the r e a l case. I t i s suggested t h a t one works w i t h q u a s i - f l o w s u n t i l no more f l o w augmenting
paths can be found.
Only then do we reduce t h e q u a s i - f l o w t o an a c y c l i c flow.
I t o n l y remains t o check t h a t we can do t h i s i n O(lVllAl) time.
We o u t l i n e next
how t h i s can be done. We use d e p t h - f i r s t search on D ( f ) , s t a c k i n g v e r t i c e s as they a r e v i s i t e d and removing them f r a n t h e s t a c k a f t e r a l l neighbours o f a v e r t e x have been v i s i t e d . I f t h e n e x t neighbour of t h e v e r t e x c u r r e n t l y b e i n g v i s i t e d i s on the stack then a c y c l e has been found.
I n O ( l V 1 ) time we can examine the cycle. reduce the f l o w
i n it, remove one ( o r more) a r c s from D(f)
and r e s t a r t t h e search a t t h e t a i l o f
t h e f i r s t a r c ( i n t h e o r d e r i n which used i n t h e search) removed.
We c o n t i n u e
u n t i l no more cycles a r e found i n t h i s manner and t h e search f i n i s h e s .
To bound t h e t o t a l t i m e taken we a p p o r t i o n t h e work done i n t o work done ( i ) between f i n d i n g cycles and r e s t a r t i n g t h e search, ( i i ) t r a v e r s i n g arcs between f i n d i n g cycles t h a t do n o t l i e on t h e n e x t c y c l e found and ( i i i ) t r a v e r s ng arc between f i n d i n g cycles t h a t l i e on t h e n e x t c y c l e found. For each c y c l e found t h e time spent doing ( i ) and ( i i i ) i s O( I V l ) and as no more than
A
cycles can be found, because we d e l e t e a t l e a s t one a r c a f t e r f n d i ng
one.
REFERENCES
ti1
D i n i c , E.A., A l g o r i t h m f o r s o l u t i o n o f a problem o f maximum f l o w i n a network with power e s t i m a t i o n , S o v i e t y Mathematics Doklady 11 (1970) 12771280.
t21
Ford, L.F., and Fulkerson, D . R . , Press, Princeton, 1962).
c3-J
Hamacher, H., Maximal a l g e b r a i c f l o w s : a l g o r i t h m s and examples, i n : Pape, U. (ed.), D i s c r e t e S t r u c t u r e s and Algorithms (Hansser, Munich, 1980) 153-166.
c41
Kumar, M.P., and Maheshwari, S . N . , An algorithm f o r Malhotra, V.M., f i n d i n g maximun f l o w s i n networks, I n f o r m a t i o n Processing L e t t e r s 7 (1978) 277-278.
M
Zimmermann, U., Linear and combinatorial o p t i m i z a t i o n i n ordered a l g e b r a i c s t r u c t u r e s , Annals o f D i s c r e t e Mathematics 10 (North-Holland P u b l i s h i n g Co., Amsterdam, 1981).
Flows i n networks ( P r i n c e t o n U n i v e r s i t y
O(l V I 3 )
Annals of Discrete Mathematics 19 (1984) 147-164 0 Elsevier Science Publishers B.V. (North-Holland)
147
OF RECENT RESULTS
LINEAR ALGEBRA I N DIOIDS: A SURVEY
M. Gondran
M. Minoux
D i r e c t i o n des Etudes e t Recherches EDF 1 avenue du General de G a u l l e 921 41 C1 amart FRANCE
C e n t r e N a t i o n a l d ' E t u d e s des T e l ~ c m u n i c a t i o n sPAA/TIM 38-40 r u e du General L e c l e r c 92131 I s s y l e s Moulineaux FRANCE
T h i s paper i s i n t e n d e d as a survey o f a whole s e t o f r e c e n t r e s u l t s c o n c e r n i n g some v e r y g e n e r a l a l g e b r a i c s t r u c t u r e s c a l l e d d i d i d s . It i s shown t h a t t h e most i m p o r t a n t concepts and p r o p e r t i e s o f c l a s s i c a l l i n e a r a l g e b r a (such as: s o l u t i o n o f l i n e a r and n o n l i n e a r e q u a t i o n s and systems, l i n e a r dependence and independence, d e t e r m i n a n t s , eigenvalues and eigenvectors) may be extended, i n some way, t o dioi'ds. The u s e f u l ness and a p p l i c a b i l i t y o f t h i s new t h e o r e t i c a l framework i s i l l u s t r a t e d by means o f a few t y p i c a l examples o f problems which, once f o r m u l a t e d i n t h e a p p r o p r i a t e a l g e b r a i c s t r u c t u r e , can b e g i v e n n a t u r a l and i l l u m i n a t i n g i n t e r p r e t a t i o n s : p a t h problems i n graphs, h i e r a r c h i c a l c l u s t e r i n g , p r e f e r e n c e a n a l y s i s problems.
1.
INTRODIJCTION
C l a s s i c a l a l g e b r a i c s t r u c t u r e s , such as f i e l d s and l a t t i c e s , appear, a t f i r s t s i g h t , t o be unrelated.
However, b o t h may be c o n s i d e r e d as s p e c i a l i n s t a n c e s o f
more g e n e r a l a l g e b r a i c s t r u c t u r e s c a l l e d : dio'ids. I n t h i s paper, we survey t h e m a i n r e s u l t s o b t a i n e d , o v e r t h e p a s t few y e a r s , i n t h e s t u d y o f dioi'ds,
by which i t i s shown t h a t t h e m o s t i m p o r t a n t concepts and
p r o p e r t i e s o f c l a s s i c a l l i n e a r a l g e b r a may be extended t o dio'ids:
solution o f
l i n e a r and n o n l i n e a r equations, l i n e a r dependence and independencc d e t e r m i n a n t s , e i g e n v a l u e s and e i g e n v e c t o r s . I n S e c t i o n 2 , we i n t r o d u c e t h e m a i n concepts and d e f i n i t i o n s .
The s o l u t i o n of
l i n e a r e q u a t i o n s and systems i s s t u d i e d i n S e c t i o n 3 and t h e g e n e r a l i z a t i o n t o n o n l i n e a r e q u a t i o n s i s discussed i n S e c t i o n 4.
S e c t i o n 5 i s devoted t o problems
o f l i n e a r dependence and independence and S e c t i o n 6 t o e i g e n v a l u e problems and t h e i r applications.
2
THE DIOIDS
A d i o ' i d (S,
a,@)i s
a s e t S w i t h two i n t e r n a l c o m p o s i t i o n laws @ and
6
M. Gondrnn and M. Minoux
148
such t h a t : the o p e r a t i o n @ ('ladd") g i v e s t h e s e t S a s t r u c t u r e o f
(A1 1
comnutative mono'id (closure, commutativity, a s s o c i a t i v i t y ) w i t h n e u t r a l element
E;
the operation @ ("multiply") gives the s e t S a structure
o f monoi'd ( c l o s u r e , a s s o c i a t i v i t y ) , w i t h n e u t r a l element e ( u n i t ) ; moreover
E
6
i s absorbing ( a
E
(A21
= ~ , v aQ S ) and
Q i s r i g h t and l e f t d i s t r i b u t i v e w i t h r e s p e c t t o @ ;
t h e preorder r e l i t i o n
( r e f l e x i v i t y , t r a n s i t i v i t y ) induced
by @ ( c a n o n i c a l p r e o r d e r i n g ) , and d e f i n e d by: a S b w X e S : a = b i s a p a r t i a l ordering, i . e . a
3
b and b
satisfies:
a+a
-
Algebraic s t r u c t u r e s s a t i s f y i n g ( A l )
@ c
= b (antisymnetry).
( A 3 ) are u s u a l l y r e f e r r e d t o as semi-rings
Shimbel 1954, Cuninghame-Green
and have been s t u d i e d by many authors (see e.g.
1960, 1962, Y o e l i 1961, G i f f l e r 1963, Cruon and Herve 1965, Peteanu 1967, Robert and Ferland 1968, Carre 1971, e t c . ) .
However, s i n c e t h e term "semi-ring"
naturally
suggeststhat "almost a l l the p r o p e r t i e s o f a r i n g a r e f u l f i l l e d " , we f i n d i t a more n a t u r a l and convenient terminology t o r e s t r i c t t h i s term t o t r i p l e s
(S,
0 ,@ )
f o r which t h e @ o p e r a t i o n i s c a n c e l l a t i v e (hence can be symmetrized)
and thus isomorphic t o t h e p o s i t i v e cone o f a r i n g . new term a p p l i c a b l e t o more general s t r u c t u r e s .
T h i s e x p l a i n s t h e use o f a
The name 01010 i t s e l f was f i r s t
suggested by K u n t a a n n (1972). Remark Since a @
E
= a M a f S ) t h i s i m p l i e s , by axiom ( A 3 ) , t h a t :
a b E Thus,
E
&a's)
i s t h e unique l e a s t element o f S .
As a consequence, suppose we have an
equation o f t h e form: a @ b t h i s implies and b = -
> a and
E
=
~
a b, and s i n c e b i s antisymmetric, t h i s i m p l i e s a =
E
E.
Note t h a t axiom ( A 3 ) may be unnecessary f o r t h e study o f c e r t a i n classes o f problems.
This axian i s nevertheless i m p o r t a n t t o prove uniqueness o f s o l u t i o n s
f o r epuations i n dio'ids. The s t r u c t u r e s
(R+U {+-I,
max, min),
(RU I + - } ,
min, + ) , ([O,l],
max, x ) ,
Linear algebra in dioids @?,
+,
x ) f o r i n s t a n c e , a r e dio’ids.
Gondran
3
-
149
F o r a d e t a i l e d r e v i e w o f such examples, c f .
Minoux 1979 Ch. 3 and Zimmerman 1981.
SOLVING LINEAR EQUATIONS AND SYSTEHS I N DIOIDS
L e t (S, @ t h e form
, @)
be a
dio’id and
suppose we have t o s o l v e a l i n e a r e q u a t i o n o f x = a
0
x @ b
(1)
(where a,b E S a r e g i v e n ) . We n o t e t h a t ( 1 ) reduces t o f i n d i n g a f i x e d p o i n t f o r t h e ( l i n e a r ) mapping: rdx : f ( x ) = a @ x @ b. A p p l y i n g t o ( 1 ) t h e s u c c e s s i v e a p p r o x i m a t i o n scheme: xo =
(2)
E
Xk+l = a
@
@
’k
(3)
l e a d s by i n d u c t i o n t o : x ~ =+ ( e~ @ a @ a’
w h e r e v k : ak = a @ a @
...
@
...
@ ak) @ b
@ a (k times).
Convergence o f ( 2 ) - ( 3 ) i s t h u s s t r o n g l y r e l a t e d t o t h e convergence o f : a(k) = e
0
a
0
For m o s t examples o f p r a c t i c a l imoortance, t o p o l o g i c a l p r o p e r t i e s on dio’ids: sufficient.
a*
0
... 0
ak .
i t i s n o t necessary t o i n t r o d u c e
f i n i t e convergence ( d i s c r e t e t o p o l o g y ) w i l l be
Thus we a r e l e d t o :
Definition 1 = a(p)
An element a e S i s c a l l e d p - r e g u l a r i f :
We say t h a t an element a E S i s r e g u l a r i f t h e r e e x i s t s a p such t h a t a i s pr e g u 1a r . The d e f i n i t i o n above a l s o i m p l i e s :
= a(’)
(Ur
>
0).
A s p e c i a l case f o r p - r e g u l a r elements a r e p - n i l p o t e n t elements i . e . such t h a t ap = E . Assuming p - n i l o p t e n c y i s s t r o n g e r t h a n p - r e g u l a r i t y b u t sometimes necessary when o t h e r p r o p e r t i e s (such as c o m m u t a t i v i t y o f @ ) a r e l a c k i n g .
T h i s i s t h e case,
f o r i n s t a n c e , f o r t h e g e n e r a l i z e d p a t h a l g e b r a s s t u d i e d b y Minoux 1976.
M. Gondran and M. Minoux
150
Property 1 For each p - r e g u l a r e l a n e n t a r S, t h e r e e x i s t s a * € S c a l l e d quasi-inverse o f a and such t h a t : a* = l i m a(‘) k-w
= ,(PI
= a(P+l)
...
Property 2 Let a e S be p - r e g u l a r w i t h quasi-inverse a*, and consider t h e f o l l o w i n g l i n e a r equation : x = a @
(4)
b
x @
then :
(i)t h e successive approximation scheme ( 2 ) - ( 3 ) converges i n a t most p t 1 steps t o : a* @ b s o l u t i o n o f ( 4 ) ( i i ) moreover, a* @ b i s t h e unique minimum s o l u t i o n o f ( 4 ) .
As a consequence o f Property 2 a* i s recognized as t h e (unique) minimum s o l u t i o n o f b o t h equations : x = a
6
x @ e and : x = x @ a
0
e.
Example 1 Suppose t h a t ( S ,
0 , 0 )i s
a d i o i d i n which @ and @ a r e idempotent.
Then
any element i s 1 - r e g u l a r since: a(’)=,@
a
0
0
a 2 = e e a
a = e
0
a=a(’).
This applies, i n p a r t i c u l a r , t o a l l d i o i d s which a r e d i s t r i b u t i v e l a t t i c e s .
Example 2 I n t h e case o f t h e d i o i d
(R,
Min, + ) (where
E
=
i s 0-regular and t h e quasi-inverse i s : a* = e. n o t r e g u l a r s i n c e : a ( k ) = Min {O, a, Za,
...
+-
and e = 0) any element a a 0
However, i f a
ka) = ka and a ( k )
<
0, then a i s
+ -m
when k
+ t-.
Property 2 can be extended t o systems o f l i n e a r equations i n t h e f o l l o w i n g way. L e t (5,
0 ,0 )be
a dio’id
and (Mn(S),
@
, 0 )t h e
d i o i d o f n x n square
m a t r i c e s on S. Consider t h e l i n e a r system over M,(S): X = A @
where A and
B a r e given.
X @ B
(5)
151
Linear algebra in dioids
Then we have:
Property 2 ' I f A has a q u a s i - i n v e r s e A*, (i)
x
(ii)
Moreover, A* @
=A*
@
then:
B i s a solution o f (5). B i s t h e minimum s o l u t i o n o f ( 5 ) .
I n p a r t i c u l a r i t has been shown b y many a u t h o r s t h a t a g r e a t number o f pathf i n d i n g problems i n graphs amount t o s o l v i n g such systems on a p p r o p r i a t e d i d i d s . Consider a graph G = [XI
U]
and a s s o c i a t e t o each a r c ( i , j )
4
U o f G an element
L e t A = ( a . .) be t h e g e n e r a l i z e d adjacency m a t r i x o f t h e graph
sij E S.
1J
d e f i n e d by:
-E
sij
a i j-
we n o t e : p =
r.
= { jE X / ( i , j )
. . 1 ...,i ) 9
(i1,i2,
E
if (i,j) E U otherwise
E U] ( t h e s e t o f successors o f i ) and f o r any p a t h
we d e f i n e t h e w e i g h t w(p) by:
The f o l l o w i n g s t a t e s t h e c o n d i t i o n s under which A i s r e g u l a r and g i v e s t h e minimum s o l u t i o n o f t h e system: X = A
0
X @ A
(6)
Theorem 1 (Gondran 1975, Minoux 1976) Suppose t h a t one o f t h e f o l l o w i n g assumptions i s s a t i s f i e d . (a)
a l l t h e elementary c i r c u i t s i n G have p - r e g u l a r w e i g h t and e i t h e r p = 0 o r Q i s commutative
(b)
a l l t h e elementary c i r c u i t s i n G have p - n i l p o t e n t weight.
Then m a t r i x A i s r e g u l a r , w i t h q u a s i - i n v e r s e A*,
(i) At = A @ A* = A* (ii)
(At)ij
=
6
and we have:
A i s t h e minimum s o l u t i o n o f ( 6 )
z ~ ( p1 J. . )where t h e sum extends o v e r a l l t h e paths uij frm i t o j
i n G. ( i i ) shows t h a t many p a t h problems can be reduced t o computing At o r a row ( o r a column) o f At which i s e q u i v a l e n t t o s o l v i n g a l i n e a r system i n an a p p r o p r i a t e dio'id
( c f . Table 1 ) .
As a consequence, t h e main a l g o r i t h m s f o r s o l v i n g p a t h
M. Gondran and M.Minoux
152
problems i n graphs may be viewed as extensions o f well-known a l g o r i t h m s o f c l a s s i c a l l i n e a r algebra.
For i n s t a n c e t h e f o l l o w i n g a l g o r i t h m g e n e r a l i z e s
F l o y d ' s a l g o r i t h m f o r canputing a l l s h o r t e s t paths i n a graph:
Connectivity
t0,1}
max
Path enumeration
P(X*)
U
Mu1t i - c r i t e r i a problems
P(RP)
active vectors i n t h e union
Maximal capacity
Ti
I
k - t h Shortest Path
1
1
R U {+-I
=
cone o f
m in
k s m a l l e s t terms o f two v e c t o r s
iik
I
a c t i v e vectors i n t h e Sum
Maximal r e l i a b i l i t y
ta
I
0 -s a < 13
R
Path numbering Markov chains
o r IN
{ a I O < a d l 3
Network r e l i a b i l i t y Regular language generation (Kleene)
+ k s m a l l e s t terms o f sums o f couples
polynomials w i t h variables s e t o f words
X
t
X
t
X
symmetrical difference
I Boolean
1
max
I
" 1
concatenation
Gauss-Jordan a l g o r i t h m . Computation o f the m a t r i x A+
from 1
n
* a
akk
F o r aij
i f i j f r o m l G n
+
aij
@ aik
@
tt
@ akj
A t the end, the o u t p u t m a t r i x i s A'. @are o(1).
I
X
Table 1
For K -
1
I
min
sequence o f the ordered sequence sequence o f the elements o f R w i t h n - s m a l l e s t terms n - s m a l l e s t terms o f two sequences o f sums o f couples amplitude Q
n-optimal paths
1
l a t i n multiply
max
Shortest path
1
m in
The complexity i s O(n3), assuming@ and
I
I
Linear algebra in dioids
153
I n t h e p a r t i c u l a r case where 3 i s a t o t a l o r d e r r e l a t i o n o v e r S w i t h e as t h e l a r g e s t element, we g e t t h e f o l l o w i n g g e n e r a l i z a t i o n o f D i j k s t r a ' s a l g o r i t h m ( c f . Gondran 1975):
Greedy a l g o r i t h m {Computation o f t h e f i r s t row o f A+)
...,n},
a)
S={2,3,
b)
For a l l i e ni+n. 1
c)
t
n1=e,
n i = = E i i 2 2 n n ;
j = l , k = l
rJ. n S
nj @ aji
D e f i n e j E S by TI. = J S + S - j , k + k t 1.
iEs
ni
I f k = n, end { t h e v e c t o r TI i s t h e f i r s t row o f At}, -
e l s e go t o b ) .
The c o m p l e x i t y i s O(n2). For f u r t h e r d e t a i l s about a l g o r i t h m s , see Gondran & Minoux 1979 Chapter 3. We end up t h i s s e c t i o n by m e n t i o n i n g a r e c e n t r e s u l t about e l i m i n a n t s ( K . A b d a l i and D. Saunders).
Given a m a t r i x A E Mn(S), t h e e l i m i n a n t o f A, denoted by \ A ( ,
i s t h e element o f S d e f i n e d i n t h e f o l l o w i n g way: - F o r n = 1 and 2, t h e e l i m i n a n t can be computed e x p l i c i t l y by: la1 = a
-
For n
and
= d + c a * b
3, t h e v a l u e i s s p e c i f i e d i n
terns o f a smaller order eliminant:
where
a ~ j +, 1
al 1 b.. = 'J
l,
1.
ai+l ,j+l
x = A @ x@b where b and x a r e column v e c t o r s . except t h e
ith e n t r y
Denoting b y ei t h e row w i t h a l l e n t r i e s €
equal t o e, we can t h e n s t a t e :
P r o p e r t y 3 ( K . A b d a l i , D. Saunders 1983) The s o l u t i o n o f ( 7 ) i s g i v e n by
(7)
M. Condran and M. Minoux
154
1
x.
4
:I
=
SOLVING NONLINEAR EQUATIONS IN DIOIDS
We now turn to show how t h e concept of p-regularity can be used t o s o l v e nonlinear equations in dio'ids. Suppose we want t o s o l v e the nonlinear (quadratic) equation: x = a @ x2 @ e For a
E
S, d e f i n e
a (k)2 = e @ a @ 2a2 @ 5a3 Q ( t h i s i s the formal developnent o f : e -
...
@ vkak
Je) 2a
where Vk:
and where f o r w
E.
( t h e so-called Catalan numbers)
t N
)k(l:
vk =
N,
va = a
0
...
a @
@ a
(V
times)
Then we have:
Property 4 (Gondran 1979) For each p-regular ejement, a of a) defined by:
E
S, t h e r e e x i s t s a*/'
(PI2 a*/'
=
Tim a
= a
( c a l l e d : quasisquare-root
(P+1)2 -= a
...
k-
As a consequence of the existence of quasi-square-roots, proved :
t h e following can be
Property 5 (Gondran 1979) l o ) I f a i s r e g u l a r , a*" 2')
If b and a
6
i s t h e minimum s o l u t i o n of (9).
c a r e r e g u l a r and i f @ i s carmutative then:
(b* @ c ) @ [(b*'
@ a @ c)*/']
x = a @ x2 @ b Q x @ c
e x i s t s and i s a s o l u t i o n o f :
155
Linear algebra in dioids (moreover, i t i s c o n j e c t u r e d t h a t i t i s t h e u n i q u e minimum s o l u t i o n o f ( 1 0 ) ) More g e n e r a l l y , c o n s i d e r a n o n l i n e a r ( p o l y n o m i a l ) e q u a t i o n o f t h e form:
0
x = f(x) = a
0
xn
e
As i n t h e q u a d r a t i c case, f o r each p - r e g u l a r element a d e f i n e a*/n (quasi-nth
(11) &
S, i t i s p o s s i b l e t o
r o o t o f a ) , minimum s o l u t i o n o f ( 1 1 ) by: a*/n = , ( ~ ) n = a ( P + l ) n
...
where, Yk:
Q u a s i nth r o o t s may be used t o s o l v e polynomial e q u a t i o n s i n die-ids, more g e n e r a l than (11).
I n p a r t i c u l a r , i t i s p o s s i b l e t o show t h a t , i f b and a @ cn-' a r e
r e g u l a r , and i f @ i s commutative, then: (b* @ c ) @ [(b*n
@ a @ cn-l)*'']
e x i s t s , and i s a s o l u t i o n o f : x = a @ xn @ b Z (J
5
L I N E A R DEPENDENCE AND INCEPENDENCE I N D I O I D S .
I n t h e f o l l o w i n g , we c o n s i d e r t h e d i o ' i d (Mn(S), on S w i t h zero:
z
x @ c .
BIDETERMINANTS
0 ,0 )o f
n x n square m a t r i c e s
=
*"]and
E....E
u n i t element: E = [ : e . : j
We f i r s t g e n e r a l i z e t h e concept o f d e t e r m i n a n t f o r a m a t r i x A = ( a . . ) E M n ( S ) . 1J
LetG,
(resp. : 8,) be t h e s e t o f a l l odd ( r e s p : even) p e r m u t a t i o n s o f
{l,Z,.
.. ,n}.
of
the product:
U)
For any g i v e n p e r m u t a t i o n
'A(')
0
E dl
= a ~ , o ( ~@ ) a2,u(2)
u G 2 we @
* * *
n o t e wA(u) ( t h e " w e i g h t "
@ an,u(n)*
Definition 2
I;;;!
F o r A E Mn(S) we c a l l b i d e t e r m i n a n t o f A t h e p a i r A(A) =
where
M. Gondran and M. Minoux
156
@ A2(A)=
Note t h a t t h e permanent o f A i s perm (A) = nl(A)
uA(u). C ul"a 2
d e f i n i t i o n o f b i d e t e r m i n a n t f i r s t appears i n Kuntzmann (1972).
The
A number o f w e l l -
known p r o p e r t i e s i n c l a s s i c a l l i n e a r a l g e b r a r e a d i l y extend t o b i d e t e n i n a n t s i n general dio'ids such as: lo)
i f A has a column ( o r a row) w i t h a l l elements = A&A) =
al(A)
2')
E,
then
E
I f a column ( o r a row) o f A i s a l i n e a r combination o f o t h e r columns ( o t h e r rows) then: al(A)
= n2(A) ( i n c l a s s i c a l l i n e a r algebra,
i m p l i e s d e t ( A ) = 0 s i n c e d e t ( A ) = Al(A) I n o r d e r t o extend 2')s
-
t h i s obviously
h2(A)).
we now i n t r o d u c e a more general d e f i n i t i o n o f l i n e a r
dependance:
D e f i n i t i o n 3 (Gondran and Minoux 1978) p n-vectors A' A2,. J1 c { l , ... ,p;, (Vj E
J1uJ 2
. . ,Ap
i n Sn a r e s a i d t o be l i n e a r l y dependent i f f t h e r e e x i s t s
J 2 c il,. . . ,p l ( J , n
# 0) such t h a t :
I f no such J1 , J 2 , )
z
JeJl
e x i s t , A1 ,A2..
J2 = 13). and A . # E J x 0 AJ = j ~ JX . @ AJ J 2 J
(12)
.Ap a r e l i n e a r l y independent.
Now, we s t a t e t h e main r e s u l t s r e l a t i n g b o t h n o t i o n s o f dependence and bidetermi nant:
Theorem 2 (Gondran and Minoux 1978) Suppose t h a t t h e columns o f A a r e l i n e a r l y dependent.
Then al(A)
= a2(A) under
each o f the f o l l o w i n g assumptions: (i)
@ and @ a r e c a n c e l l a t i v e
(ii)
a @ b = a o r b (Ya,b € 5 ) and
(iii)
a @ b = a or b
a @ b = i n f (a,b)
I
6
i s cancellative
(Va, b E S )
and t h e A . i n (12) s a t i s f y : A . J J
> perm ( A ) ( V j ) .
The converse o f the above r e s u l t can be proved i n t h e f o l l o w i n g case:
Theorem 3 (Gondran and Minoux 1978) We assume t h a t , Va, b
r S a @ b
= a
or b and
@ i s invertible.
Linear algebra in dioids
Then, i f A r M n ( S ) i s such t h a t al(A)
157
= a2(A) t h e columns ( a n d t h e rows) o f A a r e
1 i n e a r l y dependent. I n t h e case o f d i d i d s which a r e d i s t r i b u t i v e l a t t i c e s ,
nl(A)
however, t h e c o n d i t i o n
i s g e n e r a l l y n o t s u f f i c i e n t f o r g e t t i n g a dependence r e l a t i o n on
= A2(A)
t h e columns o f A.
1; :; lj
Consider, f o r i n s t a n c e , t h e m a t r i x :
(IR'U
i n t h e dio'id
{+=I, Max, M i n )
We check t h a t : A (A) = w ( U ) = M i n {11,14,101
=
10
a2(A) = wA(u2) = M i n {12,15,10)
=
10.
1
Thus, nl(A)
A 1
= a2(A) = perm (A) = 10, b u t no dependance r e l a t i o n between t h e
columns ( o r the rows) o f A can b e found w i t h A ~ , A ~ , x z~ 10.
I n view o f t h i s c o u n t e r example, t h e c o n d i t i o n s f o r a m a t r i x t o b e s i n g u l a r (columns l i n e a r l y dependent) i n l a t t i c e - d i o i d s have t o b e g i v e n a s l i g h t l y d i f f e r e n t form. We f i r s t d e f i n e t h e s k e l e t o n o f a m a t r i x A, as t h e 0-1 m a t r i x S(A) = (sij) sij
= 1 i f aij
where:
>
perm (A)
s . . = 0 otherwise
75 we say t h a t a 0-1 n x n m a t r i x B = ( b . .) i s p a r t l y - b a l a n c e d i f and o n l y i f t h e 1J
s e t o f i t s columns J may be p a r t i t i o n e d i n t o J, and J 2 such t h a t :
( b a l a n c e d m a t r i c e s have been s t u d i e d b y Berge 1972).
Then we have:
Theorem 3 ' (Minoux 1982) Assume t h a t a @ b = a o r b and a @ b = i n f (a,b).
ThenA i s s i n g u l a r i f and
o n l y i f S(A) i s p a r t l y balanced. Theorem 3' above a l l o w s t o g i v e a new c h a r a c t e r i z a t i o n o f balanced m a t r i c e s of Berge (1972) i n terms o f l i n e a r dependence and independence i n t h e d i o ' i d ( { O , l l ,
M. Gondran and M. Minoux
158 Max, Min)
.
L e t A be a 0-1 m a t r i x , I and J the s e t o f i t s rows and columns. For K c J and K L c I , we denote by AL t h e submatrix d e f i n e d by t h e subset o f columns ( r e s p o f rows) K (resp. : L ) . For any K c J ,
& ( K ) denotes t h e subset o f rows i E I i n
which t h e r e e x i s t a t l e a s t two t e r n s equal t o 1 and belonging t o columns i n
K.
Then we can s t a t e :
Corol l a r y 1 The f o l l o w i n g c o n d i t i o n s a r e e q u i v a l e n t and c h a r a c t e r i z e a balanced m a t r i x A: (i)
Every subset K c J can be p a r t i t i o n n e d i n t o K, and K2 i n such a way t h a t :
(ii)
4Kc
J, L
= 6 ( K ) t h e submatrix
K AL has i t s columns dependent i n t h e dioi'd
( t O , l I , Max, Min) (iii) For any 0-1 v e c t o r b t h e l i n e a r program: z = Max c x subject t o Ax < b x,o has an optimal i n t e g e r s o l u t i o n f o r a l l c . Condition ( i ) corresponds t o t h e d e f i n i t i o n , and c o n d i t i o n ( i i i ) has been given by Berge (1972).
Condition ( i i ) i s t h e new c h a r a c t e r i z a t i o n i n terms o f l i n e a r
dependence and independence i n dio'ids, which can be recognized as a formal analogue t o a well-known c h a r a c t e r i z a t i o n of unimodular m a t r i c e s due t o GhouilaHouri (1962).
6 A
EIGENVP.LUE PROBLEMS AND APPLICATIONS S i s c a l l e d an eigenvalue o f AcMn(S) i f and o n l y i f t h e r e e x i s t s V
Sn
(eigenvector) such t h a t : A@v = x k ' v . There i s a s t r o n g r e l a t i o n between eigenvalues and l i n e a r dependence i n general d i d i d s as shown by:
Theorem 4 (Gondran and Minoux 1978) i s eigenvalue o f Ae Mn(S) i f and o n l y i f t h e 2n x 2n m a t r i x
Linear algebra in dioids
' e
E
159
' e
E
has i t s columns dependent. By considering h as a v a r i a b l e , each term o f t h e bideterminant o f A ( h ) may be
considered as a polynomial i n A. Pl(A) then
P(A) =
]:l[
Thus i f we note
= Al(A(h))
and P2(h) = A2(A(h))
w i l l be c a l l e d t h e c h a r a c t e r i s t i c b i p o l y n m i a l o f A.
A f i r s t important property o f t h e c h a r a c t e r i s t i c bipolynomial i s t h e generalizat i o n t o dio'ids
o f the Caley-Hamilton theorem which reads:
Theorem 5 (Stranbing 1983, Gondran 1983) The m a t r i x A i t s e l f solves the c h a r a c t e r i s t i c equation P1(A) = P2(A). On t h e o t h e r hand, combining Theorem 2 and Theorem 3 leads t o t h e f o l l o w i n g g e n e r a l i z a t i o n o f a c l a s s i c a l r e s u l t i n o r d i n a r y l i n e a r algebra:
Theorem 6 L e t @ be such t h a t a @ b = a o r b and
6
invertible.
Then, h i s eigenvalue
o f A EMn(S) i f and o n l y i f h i s s o l u t i o n o f the c h a r a c t e r i s t i c equation: P1(X) = P2(X). Other c o n d i t i o n s f o r the existence o f eigenvalues and eigenvectors have been given by Gondran and Minoux (1977) such as:
Theorem 7 If a @ b = a (i)
or b,
i f @ i s idempotent and commutative, then:
A* (quasi i n v e r s e o f A) e x i s t s ;
M. Gondrun and M. Minoux
160 (ii)
every >
t
5 i s an eigenvalue of A;
( i i i ) J ( h ) ( t h e s e t of a l l eigenvectors f o r h ) i s t h e moduloid generated by those 6 1 @ ui vectors of the form where ui = (
[ATi
'A(')
denotes t h e i t h column o f A*,
and C i i i s the set of a l l c i r c u i t s origina-
ting a t i in t h e graph associated w i t h A ) . As an i l l u s t r a t i o n , we g i v e below a number o f examples where a p p l i c a t i o n of t h e
above r e s u l t s may lead t o some natural and illuminating i n t e r p r e t a t i o n s i n terms of eigenvalues and eigenvectors in dio'ids. 6.1
Jobshop scheduling
( Cuninghame-Green 1960, 1962)
The determination of the steady s t a t e behaviour of a set of machines (processing jobs with precedence c o n s t r a i n t s only) reduces t o finding an eigenvector i n t h e dioid (R, Max, +) ("schedule algebra") 6.2
Routing problems
The determination of a minimum r a t i o (cost/time) c i r c u i t i n a graph ( c f . Dantzig B l a t t n e r & Rao 1967) i s equivalent t o finding the eigenvalue and t h e associated eigenvector f o r t h e c o s t matrix i n the dioid ( R U {+-I, Min, + ) .
6.3
Hierarch i cal c 1us t e r i ng
Let A be the distance matrix of n o b j e c t s t o be c l a s s i f i e d . ( c f . Gondran 1977) t h a t i n the d i o i d ( R U {+-I, Min, Max):
.
Then i t can be shown
each level of the c l a s s i f i c a t i o n (simple-linkage c l u s t e r i n g ) corresponds t o a n
eigenvalue of A;
.
the p a r t i t i o n of t h e n o b j e c t s obtained a t any given level X , corresponds t o a
generator of the set 6.4
J (? ) .
Preferences analysis (Gondran 1979a)
Let A = ( a . .) be a preferences matrix: a i j i s equal, f o r example, t o t h e number 1J
of judges who prefer i t o j . Now, l e t us i n t e r p r e t eigenvalues and eigenvectors of A in some dio'ids. I f t h e dio'id i s (R', +, x ) , the eigenvector associated w i t h the l a r g e s t eigenvalue gives an average order, and we f i n d again the well known method of Berge 1958. If t h e dioid i s (R'U !+-I, max, x ) , the matrix A admits a unique eigenvalue which corresponds t o a c i r c u i t yo o f G such t h a t :
Linear algebra in dioids 1
1
m
n(v,) x
= W(Y0)
161
= max W ( Y ) Y
where n(Y) and w(y) a r e r e s p e c t i v e l y t h e number o f a r c s and t h e p r o d u c t o f t h e a r c s v a l u a t i o n s o f t h e c i r c u i t Y.
T h i s c i r c u i t determines t h e s e t o f o b j e c t s f o r
which t h e consensus i s t h e w o r s t . When G i s s t r o n g l y connected, we o b t a i n A by a v a r i a n t i n O(nm) o f an a l g o r i t h m o f KARP ( c f f o r i n s t a n c e Gondran Minoux 1979, Chap. 3 ) .
I f t h e d i o i d i s (R'
u
(+-I, max, min) t h e eigenvalues and t h e e i g e n v e c t o r s o f
t h e u n i q u e base a s s o c i a t e d w i t h each e i g e n v a l u e d e f i n e a f a m i l y o f p r e o r d e r s whose e q u i v a l e n c e c l a s s e s f i t i n t o each o t h e r .
ACKNOWLEDGEMENTS We thank t h e r e f e r e e s f o r t h e i r c o n s t r u c t i v e comments which h e l p e d improve t h e f i r s t v e r s i o n o f t h i s paper.
REFERENCES
[l] A b d a l i , K.S., Saunders, D.B., T r a n s i t i v e c l o s u r e and r e l a t e d s e m i r i n g p r o p e r t i e s v i a e l i m nants" (1983) To appear. [2] Berge, C.,
La t h g o r i e des graphes e t ses a p p l i c a t i o n s (Dunod, P a r i s ) .
[3]
Berge, C.,
Balanced M a t r i c e s , Mathematical Programming 2, 1 (1972) 19-31.
[4]
Carre, B.A., An Algebra f o r network r o u t i n g problems, 7 (1971) 273-294.
[5]
Cruon, R., Herve Ph. Quelques probl&nes r e l a t i f s 3 une s t r u c t u r e a l g 6 b r i q u e e t a son a p p l i c a t i o n au problgme c e n t r a l de l'ordannancement, Revue F r . Rech. Op. 34, (1965) 3-19.
[6]
Cuninghame-Green, R.A., Process s y n c h r o n i s a t i o n i n a s t e e l w o r k s - a problem o f f e a s i b i l i t y , in:Banbury and M a i t l a n d ( e d s . ) , Proc. 2nd I n t . Conf. on O p e r a t i o n a l Research, ( E n g l i s h U n i v e r s i t y Press, 1960) 323-328.
J. I n s t . Maths. A p p l i c s
[7] Cuninghame-Green, R.A., D e s c r i b i n g i n d u s t r i a l processes w i t h i n t e r f e r e n c e and a p p r o x i m a t i n g t h e i r s t e a d y - s t a t e b e h a v i o u r , O p e r a t i o n a l Research Q u a r t . 13, 1 (1962) 95-100. [8]
Cuninghame-Green, R.A., Minimax Algebra: L e c t u r e Notes i n Economics and Mathematical Systems ( S p r i n g e r Verlag, 1979).
[9]
D a n t z i g , G.B., B l a t t n e r , W.D., and Rao, M.R., F i n d i n g a c y c l e i n a g r a p h w i t h minimum c o s t t o t i m e r a t i o w i t h a p p l i c a t i o n t o a s h i p r o u t i n g problem", i n : T h g o r i e des graphes, Proc. o f t h e I n t . Symp., Rome, I t a l y , (Dunod, P a r i s 1967)
M. Gondran and M. Minoux
162 77-83.
[lq
Ghouila-Houri , A . , C a r a c t g r i s a t i o n des m a t r i c e s totalement unimodulaires, C.R.A.S. P a r i s , tome 254 (1962) 1192.
[ll] G i f f l e r , B., Scheduling general p r o d u c t i o n systems u s i n g schedule algebra, Naval Research L o g i s t i c s Q u a r t e r l y , v o l . 10, no. 3 (1963).
[lq
Gondran, M., Path algebra and alqorithms, i n : Combinatorial Programing, (B. Roy Ed.), Reidel (1975).
[13]
Gondran, M., L ' a l g o r i t h m e g l o u t o n dans l e s algebres de c h m i n s , B u l l e t i n de l a D i r e c t i o n Etudes e t Recherches, EDF, S e r i e C, 1, (1975a) 25-32.
[14]
Gondran, M., Eigenvalues and eigenvectors i n h i e r a r c h i c a l c l a s s i f i c a t i o n , i n : Barra, J.R., e t a1 (Eds.), Recent Developments i n S t a t i s t i c s (North Holland Publishing Company, 1977) 775-781.
[15]
Gondran, M., Les Clements p-re'guliers dans l e s d i d i d e s , D i s c r e t e Mathematics, 25, (1979) 33-39.
[16]
Gondran, M., Ualeurs propres e t vecteurs propres en analyse des preferences, Note EDF HI-3199 (1979a). Gondran, M.,
Le the'orsme de Cayley-Hamilton dans l e s dio'ides, note EDF (1983)
[l8]
Gondran, M., Minoux, M. , Ualeurs propres e t vecteurs propres dans l e s s m i modules e t l e u r i n t e r p r e t a t i o n en t h e o r i e des graphes, B u l l e t i n de l a D i r e c t i o n Etudes e t Recherches, EDF, S e r i e C, 2, (1977) 25-41.
[19]
Gondran, M., Minoux, M. , L'independance l i n e a i r e dans l e s dio'ides, B u l l e t i n de l a D i r e c t i o n Etudes e t Recherches, EDF, S e r i e C, 1, (1978) 67-90.
[20]
Gondran, M.,
[Zl]
Johnson, S.C., 241-243.
Minoux, M.,
Graphes e t Algorithmes ( E y r o l l e s , P a r i s , 1979).
H i e r a r c h i c a l c l u s t e r i n g schmes, P s y c h m e t r i c a 32, (1967)
[Z!] Kuntnann, J . , Theorie des reseaux graphes (Dunod, P a r i s , 1972). [23]
Minoux, M . , S t r u c t u r e s algebriques generalisees des p r o b l m e s de cheminement dans l e s graphes: theoremes, algorithmes e t a p p l i c a t i o n s , Revue Fr. Automatique, Infonnatique, Rech. Op., Vol. 10, 6, (1976) 33-62.
[24]
Minoux, M., Linear dependence and independence i n l a t t i c e d i o i d s , Note I n t e r n e CNET ( 1982)-
[Zq
Peteanu. V., An algebra o f the optimal path i n networks, Mathematica 9, (1967) 335-342.
[26]
Robert, P., Ferland, J., G e n e r a l i s a t i o n de 1 ' a l g o r i t h m e de Warshall, Revue Fr. I n f o m a t i q u e Rech. Op. 2 (1968) 71-85.
[27]
Shimbel, A,, S t r u c t u r e i n communication nets, Proc. Symp. on I n f o r m a t i o n Networks, P o l y t e c h n i c I n s t i t u t e o f Brooklyn. (1954) 119-203.
[28]
Stambing, H., A combinatorial p r o o f o f the Cayley-Hamilton theorem, D i s c r e t e Mathematics 43 (1983) 273-279.
[29]
Yoeli, M.,
A note on a g e n e r a l i z a t i o n o f boolean m a t r i x theory, h e r . Math.
Linear algebra in dioids
Monthly 68 (1961) 552-557. [30] Zimmermann, U., Linear and combinatorial optimization i n ordered algebraic s t r u c t u r e s , Annals of Discrete Mathematics 10 (North Holland, 1981).
163
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 165-182 0 Elsevier Science Publishers B.V. (North-Holland)
165
ALGEBRAIC FLOWS AND TIME-COST TRADEOFF PROBLEMS
H.W. Hamacher and S. T u f e k c i Department o f I n d u s t r i a l and Systems E n g i n e e r i n g University o f Florida, Gai n e s v i 11e, F l o r i d a 32611 U.S.A. I n t h i s paper we i n t r o d u c e a p r o j e c t c r a s h i n g model where t h e problem i s f o r m u l a t e d as an a l g e b r a i c o p t i m i z a t i o n model. By e x p l o i t i n g t h e u n d e r l y i n g network s t r u c t u r e o f t h e problem, t h e model i s t r a n s f o r m e d i n t o a sequence o f a l g e b r a i c network f l o w problems. An e f f i c i e n t a l g e b r a i c maximal f l o w a l g o r i t h m i s implemented t o o b t a i n t h e a l g e b r a i c m i n i m a l c u t s a t each s t e p t o d e t e r m i n e t h e a c t i v i t i e s t o b e m o d i f i e d . Different selections o f algebraic structures y i e l d d i f f e r e n t o b j e c t i v e f u n c t i o n s which have i n t e r e s t i n g meanings i n r e a l l i f e situations.
1
INTRODUCTION
The c l a s s i c a l t i m e - c o s t t r a d e o f f problem (CTCTP) i s a w e l l s t r u c t u r e d l i n e a r programming problem.
T h i s problem has been s t u d i e d b y s e v e r a l r e s e a r c h e r s [I, 4,
5, 9, 10, 11, 12, 13, 14, 151.
I n a l l t h e s e s t u d i e s , t h e u n d e r l y i n g network
s t r u c t u r e o f t h e model i s e x p l o i t e d .
F u l k e r s o n [4]
and K e l l e y [8] f o r m u l a t e d t h e
problem as a l i n e a r p r o g r a m i n g problem where t h e d u a l o f t h e problem possesses a network f l o w s t r u c t u r e .
P h i l l i p s and Dessouky [12]
f o r m u l a t e d t h e problem as a
network f l o w problem where a t each i t e r a t i o n a minimal c u t i s sought t o d e t e r m i n e t h e a c t i v i t i e s t o b e crashed.
T u f e k c i [15]
i n d i c a t e d t h a t i n t h e f l o w network
suggested by P h i l l i p s and Dessouky, t h e l o c a t i o n o f a minimal c u t can e a s i l y be o b t a i n e d by u s i n g a l a b e l i n g a l g o r i t h m .
T h i s a l g o r i t h m u t i l i z e s t h e maximum f l o w
v a l u e s o b t a i n e d i n t h e p r e v i o u s s t e p as a s t a r t i n g f e a s i b l e f l o w i n t h e succeeding step.
A l l t h e s e a l g o r i t h m s a s s p e a s i n g l e l i n e a r o b j e c t i v e f u n c t i o n which r e p r e s e n t s t h e t o t a l a d d i t i o n a l d i r e c t c o s t based on a g i v e n s e t o f a c t i v i t y d u r a t i o n s . Moore, e t a l . ,
[lo]
suggested t h a t i n many r e a l l i f e p r o j e c t s , m i n i m i z a t i o n o f
t h e a d d i t i o n a l d i r e c t c o s t may n o t n e c e s s a r i l y r e f l e c t t h e t r u e o b j e c t i v e o f t h e management.
F u r t h e r , t h e y c l a i m t h a t t h e management i s g e n e r a l l y f a c e d w i t h
m u l t i p l e objectives.
They i n t u r n propose a goal programming approach f o r a
mu1 t i - c r i t e r i a p r o j e c t c r a s h i n g model. I n t h i s paper we show t h a t t h e c l a s s i c a l TCTP as w e l l as c e r t a i n m u l t i - o b j e c t i v e
H. W.Hamacher and S. Tufekci
I66
TCTP can be t r e a t e d w i t h i n a u n i f i e d framework, i f t h e problem i s modeled as an a l g e b r a i c o p t i m i z a t i o n problem.
By t a k i n g t h e u n d e r l y i n g network s t r u c t u r e o f
t h e model i n t o c o n s i d e r a t i o n the problem i s converted i n t o a sequence o f a l g e b r a i c network f l o w problems.
Recent a l g o r i t h m i c developments i n a l g e b r a i c f l o w s and
a l g e b r a i c minimal c u t s [6,
71
enable us t o s o l v e t h i s problem v e r y e f f i c i e n t l y .
I n s e c t i o n two we i n t r o d u c e t h e generalized TCTP w i t h a l g e b r a i c o b j e c t i v e function.
We a l s o show t h a t the c l a s s i c a l TCTP and the m u l t i o b j e c t i v e TCTP a r e
s p e c i a l cases o f t h i s g e n e r a l i z e d problem.
Section t h r e e i n t r o d u c e s t h e a l g o r i t h m
f o r the a l g e b r a i c time-cost t r a d e o f f problem.
An example problem i s provided i n
I n s e c t i o n f i v e we prove t h e v a l i d i t y o f t h e presented a l g o r i t h m .
section four.
Section s i x concludes t h i s work.
2
TIWE-COST TRADEOFF PROBLEM MITH ALGEBRAIC OBJECTIVE FUNCTION
I n what f o l l o w s we assume t h a t G i s an a c y c l i c a c t i v i t y - o n - a r c p r o j e c t network w i t h node set ties.
N, r e p r e s e n t i n g t h e events and a r c s e t A, r e p r e s e n t i n g t h e a c t i v i -
For convenience we assume t h a t node one represents t h e beginning o f the
p r o j e c t and node n represents t h e end o f the p r o j e c t . we associate two numbers aij
and bij
(aij
6 bij)
normal d u r a t i o n o f t h e a c t i v i t y , r e s p e c t i v e l y .
With each a c t i v i t y
(i,j)E
A
c a l l e d the crash d u r a t i o n and For g i v e n d u r a t i o n s dij,
(i,j) E A
we can f i n d the d u r a t i o n o f the p r o j e c t , T(d) by u s i n g a standard CPM technique
[81. I f T i s a g i v e n a l l o w a b l e p r o j e c t d u r a t i o n , then a c t i v i t y d u r a t i o n s d = (dij), ( i , j ) E A are c a l l e d a f e a s i b l e s o l u t i o n w i t h r e s p e c t t o time T, i f aij 6 dij 4 b i j f o r a l l (i,j) E A and T(d) 6 T. s e t w i t h respect t o time .T, i.e., F(T) = Idij:aij I f we d e f i n e d . . = bij, 1J
duration.
6 dij
V(i,j),
6
bij,
By F(T) we denote t h e f e a s i b l e
( i , j ) E A , T(d) c< T I .
then T(d) = Tn i s c a l l e d t h e normal p r o j e c t
Similarly, f o r d.. = a
V(i,j), T(d) = T C d e f i n e s t h e crash d u r a t i o n ij’ For an a r b i t r a r y p r o j e c t d u r a t i o n T, T C s. T < Tn some a c t i v i t i e s IJ
o f the p r o j e c t .
must be crashed t o achieve the d e s i r e d p r o j e c t l e n g t h . some a c t i v i t y d u r a t i o n s from dij
= bij
to dij
r e q u i r e s a d d i t i o n a l resources, and money.
<
bij.
That i s , we have t o change I n t h e TCTP t h i s crashing
Thus, t h e TCTP i s d e f i n e d as f i n d i n g
t h a t s e t of a c t i v i t y d u r a t i o n s d E F(T), which y i e l d s t h e minimal c o s t . I n our approach the c o s t s are elements o f an ordered s e t H provided w i t h an a l g e b r a i c s t r u c t u r e (H,*,&).
By t a k i n g t h e c o s t elements f r a n such a s e t we g e t
a u n i f i e d treatment o f d i f f e r e n t o b j e c t i v e f u n c t i o n s based on t h e choice o f (H,*,,c).
The p r a c t i c a l importance o f t h i s approach w i l l be made c l e a r e r i n
section four.
167
Algebraic flowsand time-cost tradeoff problems D e f i n i t i o n 1.
(H,*,$)
i s c a l l e d a t o t a l l y o r d e r e d commutative group (TOCG) i f f
a 6 b "a*c Note t h a t s i n c e a*b = a*c -b=c a
6
(H.2) i s t o t a l l y o r d e r e d
(2.1)
(H,*) i s a c o m n u t a t i v e group
(2.2)
b*c ( c o m p a t i b i l i t y r u l e )
V a,b,c
E
(2.3)
(H,*) i s a group, t h e c a n c e l l a t i o n r u l e h o l d s ; i . e . , Y a,b,c 0 H . We denote w i t h H, t h e s e t o f a l l elements a
Q
H with
>, E .
H = LRm, s e t o f m-component v e c t o r s o v e r R ,
Example 1.
*
i s t h e componentwise
26
a d d i t i o n , and 4 i s t h e l e x i c o g r a p h i c a l o r d e r i n g o f IRm, ( t h a t i s , a = b o r ai [-
Example 2.
<
H =
bi f o r i = m i n { j : a j # b j l ,
R, *
Y
+,be
= (R t o H =
b
RT.
i s t h e m u l t i p l i c a t i o n , and 6 i s t h e n a t u r a l o r d e r i n g o f r e a l s .
n o t a TOCG ( s i n c e 2.3 i s n o t s a t i s f i e d ) . Note t h a t t h i s system i s -
H
H.
R, t h e n (H,*,<)
I f we change
becomes a TOCG.
I n o r d e r t o f i n d a measure f o r t h e c o s t o f c r a s h i n g a c t i v i t i e s , we want t o compose t h e m o u n t (bij Cij
6
H.
-
d . . ) e R t , by which an a c t i v i t y ( i , j )
i s crashed, w i t h t h e c o s t
1J
To f a c i l i t a t e t h i s we i n t r o d u c e an e x t e r n a l c o m p o s i t i o n 0 : IR
x
H
-f
H.
Now, t h e a l g e b r a i c TCTP can be f o r m u l a t e d as f o l l o w s : f o r any g i v e n T w i t h T' 4 T 6 T
n solve
(ATCTP)
min{(i:j)rA
-
(bij
dij)u
cijldaF(T)l.
I n o r d e r t o s o l v e t h i s problem i n t h i s g e n e r a l form we need s e v e r a l axioms about t h e external composition El. (2.4.a)
a U ( B 0 a ) = (a.B)Oa (a+B)
aa
= (am)
aa(a*b) =
(am) *
with
= -a, (2.4.d),
(2.4.b)
(BW)
(mob)
Y
a , M ,
a,beH
(2.4.c)
E
(2.4.d)
lna = a
(2.4.e)
Ooa =
By u s i n g (2.4.b)
*
(2.2.d)
and t h e c a n c e l l a t i o n r u l e i t i s
easy t o show t h a t ( - a ) o a = -(am) Moreover, we need
(2.4.f)
H W.Harnacher and S.Tufekci
168
ir
<
6
saOC 6
a 6 b -aoa I f we r e s t r i c t t h e elements
2
6
EM.,
4 a,BER,
nab,
4 a&+,a,lxH
e @ t o a subring ( R , + , - )
r e a l s , and
=
*
H = R,
o f the f i e l d o f r e a l s then
H).
s t a n d i n g we denote t h i s s t r u c t u r e s i m p l y by
R
(2.5.b)
a module o v e r R (whenever t h e r e i s no misunder-
we c a l l t h e s t r u c t u r e (R,O,H,*,s)
Example 3.
(2.5.a)
CaH,.
i s the a d d i t i o n o f r e a l s , 4 i s t h e n a t u r a l o r d e r i n g o f
i s t h e m u l t i p l i c a t i o n of r e a l s .
The c o r r e s p o n d i n g ATCTP becomes t h e c l a s s i c a l TCTP (CTCTP) w i t h s i n g l e l i n e a r o b j e c t i v e f u n c t i o n and l i n e a r c o n s t r a i n t s . and K e l l e y [8], and T u f e k c i
[la
As f i r s t i n d i c a t e d by F u l k e r s o n [4]
and l a t e r by M o r l o c k and Neumann Dl],
P h i l l i p s and Dessouky e2],
t h e d u a l o f t h i s problem possesses a f l o w network s t r u c t u r e .
In
F u l k e r s o n ' s and K e l l e y ' s f o r m u l a t i o n s t h e dual problem becomes a minimum c o s t f l o w problem, whereas i n P h i l l i p s and Dessouky's and T u f e k c i ' s work t h e problem s o l v e d i s a minimum c u t problem.
= N,
F o r a g i v e n f l o w network G(N,A) and X
(x,R)
=
($,X)
= {(i,j)
((i,j)
let
2
= N\X and
: iaX, jeR, ( i , j )
E
A1
and :
ief,
jcX,
(i,j) € A } .
L e t t h e source and s i n k nodes b e denoted by 1, and n, r e s p e c t i v e l y .
n
6.
f
then the s e t ( X J )
U(x,X)
i s called a cut.
If 1
~l
X and
A t each i t e r a t i o n o f t h e
a l g o r i t h m t h e d u r a t i o n s a r e decreased a l o n g a c u t w h i c h r e q u i r e s minimum a d d i t i o n a l cost.
Example 4.
R = ZZ = s e t of i n t e g e r s
g r o u p of m-component v e c t o r s o v e r R w i t h l e x i c o g r a p h i c a l
(H,*,<)
ordering
a: s c a l a r
multiplication.
The c o r r e s p o n d i n g ATCTP i s c a l l e d a l e x i c o g r a p h i c a l TCTP (LTCTP). t h e c o s t element c . . e H a r e v e c t o r s 1J
I n t h i s case
Algebraic flows and time-cost tradeoff problems
169
The f o l l o w i n g i s a nonexhaustive l i s t of p o s s i b l e l i n e a r o b j e c t i v e f u n c t i o n s
.. .k.
which may b e i n c l u d e d as t h e p t h component o f t h e LTCTP, p = 1 ,2,. 1.
2.
c ( i , j ) = c!., t h e i n c r e m e n t a l d i r e c t c o s t of r e d u c i n g a c t i v i t y ( i , j ) by one P 1.J u n i t . The corresponding o b j e c t i v e f u n c t i o n p r o v i d e s t h e t o t a l a d d i t i o n a l d i r e c t c o s t over t h e normal d i r e c t c o s t f o r a g i v e n schedule i d . ) . iJ c ( i , j ) = 1, t h e corresponding o b j e c t i v e f u n c t i o n p r o v i d e s t h e t o t a l amount P o f r e d u c t i o n on a l l a c t i v i t i e s . T h i s o b j e c t i v e f u n c t i o n ensures t h e s e l e c t i o n o f a l e a s t number o f a c t i v i t i e s t o be crashed f o r t h e same c o s t i f used i n conjunction w i t h t h e o b j e c t i v e f u n c t i o n defined i n ( 1 ) . i m p o r t a n t f r o m t h e c o n t r o l p o i n t o f view.
T h i s may b e e x t r e m e l y
I t p r o v i d e s a schedule which
r e q u i r e s a s m a l l e r number o f a c t i v i t i e s t o be m o n i t o r e d under a c r a s h program.
3.
( i , j ) = P . ., where Pij i n d i c a t e s t h e p r e f e r e n c e ( r a n k i n g ) o f a c t i v i t i e s t o P 1J b e crashed. T h i s o b j e c t i v e f u n c t i o n p r o v i d e s p r e f e r r e d a c t i v i t i e s t o be c
crashed ahead o f o t h e r n o t so d e s i r a b l e a c t i v i t i e s .
4.
( i , j ) = r . . where r . i s t h e amount o f a r e s o u r c e consumed by a u n i t ij P 1J r e d u c t i o n i n a c t i v i t y ( i , j ) which i s n o t i n c l u d e d i n o t h e r o b j e c t i v e f u n c t i o n s . c
To i n t r o d u c e t h e d i f f e r e n c e between CTCTP and LTCTP we p r e s e n t t h e p r o j e c t n e t work i n F i g u r e 1.
I n t h i s F i g u r e c1 ( i , j )
= a d d i t i o n a l incremental d i r e c t cost
per u n i t o f reduction i n a c t i v i t y duration, c2 ( i , j ) ranking o f a c t i v i t y ( i , j ) . f o u r t e e n have l e n g t h 35. cut (X,j)
1 and c
3 (i,j)
= preference
Assume t h a t i n t h i s network a l l t h e paths a r e o f equal
l e n g t h and thus a r e a l l c r i t i c a l . units.
=
That i s , a l l t h e paths from node one t o node
Now assume t h a t t h e d e s i r e d p r o j e c t l e n g t h i s 27 t i m e
T h e r e f o r e t h e CTCTP w i l l proceed as f o l l o w s : f i r s t t h e a c t i v i t i e s on t h e w i l l be m o d i f i e d b y s i x u n i t s , where X = 11) and
=
N\X.
Note t h a t
a l a b e l i n g a l g o r i t h m w i l l always p r o v i d e a m i n i m a l c u t w i t h t h e s m a l l e s t number o f nodes i n X .
A f t e r t h i s c r a s h i n g , t h e p r o j e c t l e n g t h i s reduced t o 29.
second i t e r a t i o n t h e CTCTP w i l l s e l e c t X = il, 2, 3, 4, 5, 6 , 7 ? and Now a l l t h e a c t i v i t i e s on
(X,f) w i l l
?
be crashed by two more t i m e u n i t s .
t h i s s t e p t h e p r o j e c t d u r a t i o n i s 27 and t h e a l g o r i t h m stops. d i r e c t c o s t r e q u i r e d f o r t h i s schedule i s 6(1+1+1+1+1+1)
t
I n the = N\X.
After
The a d d i t i o n a l
2(1+1+1+1+1+1) = 48.
The t o t a l amount o f t i m e r e d u c t i o n s on a l l t h e a c t i v i t i e s i s 6 ( 6 )
+
6 ( 2 ) = 48.
H. W. Hamacher and S. Tufekci
1 70
The amount o f p r i o r i t y consumed by the crashed a c t i v i t i e s i s 6(3t3t2+2+1+1)
t
2(4+4+6+6+2+2) = 120.
Figure 1.
An example p r o j e c t network. b..
1J
-
ai
,
( V a l u a t i o n of arcs:
r c l ( i J), c 2 ( i , j ) ,c3(i ,j)]
Now consider the same problem w i t h l e x i c o g r a p h i c a l o b j e c t i v e f u n c t i o n w i t h ck ( i , j ) ,
k = 1, 2, 3, as d e f i n e d over each a r c .
w i l l s e l e c t (X,f) w i t h
2
= I14) and
X = N\X as t h e lexmin cut.
I n the n e x t step, LTCTP w i l l s e l e c t
f
= {13,
141 and X
t i e s (11, 13) and (12, 13) w i l l be reduced by two time u n i t s . LTCTP w i l l s e l e c t
I
Hence a c t i v i t y
Now t h e p r o j e c t d u r a t i o n i s reduced
(13, 14) w i l l be reduced by f i v e time u n i t s . t o 30.
I n t h e f i r s t i t e r a t i o n , LTCTP
=
N\g and a c t i v i -
I n the t h i r d step
= {il,13, 141 and X = N\? and a c t i v i t i e s (8, l l ) , (9, 11),
(10, 11) and (12, 13) w i l l be reduced by one t i m e u n i t .
A t t h i s p o i n t the
p r o j e c t d u r a t i o n i s reduced t o 27 and t h e a l g o r i t h m w i l l stop.
Note t h a t by
u s i n g LTCTP we have the otpimal value o f t h e f i r s t component o f t h e v e c t o r valued o b j e c t i v e f u n c t i o n as 6(5)
+
2(3t3)
+ 2(2)
+
1(1+1+1+3) = 48, t h e same as the
CTCTP.
The second component i s l ( 6 )
CTCTP.
F i n a l l y , the t h i r d component i s t h e t o t a l amount o f p r i o r i t y consumed by
t 4(1) = 14 as compared t o 48 i n
t h i s crash schedule i s g i v e n by 5(1) t 2 ( 2 + 2 ) + 1(3+3+3+2) = 24 which i s a l s o less than t h e CTCTP r e s u l t .
ALGEBRAIC FLOWS AND AN ALGORITHM FOR SOLVING THE ALGEBRAIC TIME-COST TRADEOFF PROBLEM
3
I n t h i s s e c t i o n we present an a l g o r i t h m f o r s o l v i n g t h e a l g e b r a i c time-cost t r a d e o f f problem by g e n e r a l i z i n g an a l g o r i t h m o f Tufekci [15] concept o f a l g e b r a i c minimal c u t s as discussed i n Hamacher [6,
and by u s i n g t h e
71.
Algebraic flows and time-cost tradeoff problems
171
F i r s t we summarize some r e s u l t s of t h e a l g e b r a i c f l o w t h e o r y : l e t II, u: A two f u n c t i o n s ( c a l l e d
lower and
-+
H be
upper c a p a c i t y f u n c t i o n s , r e s p e c t i v e l y ) a s s i g n i n g
t o each ( i , j ) € A elements a ( i , j ) , u ( i , j ) E H. I n what f o l l o w s t h e o p e r a t i o n " - ' I w i l l r e p r e s e n t t h e i n v e r s e o f t h e group o p e r a t i o n * (see 2.2.d), i.e., a-b = a*(-!-). A ( f e a s i b l e ) a l g e b r a i c f l o w ( w i t h r e s p e c t t o L and u ) i s a f u n c t i o n f : A
-+
H
satisfying: L(i,j) 6 f(i,j)
B
W (i.j)
u(i,j)
E
A
and f(x,N) (Here f ( x , N ) =
( X , h of t h e a l g e b r a i c f l o w . f(X,f)
-
f(f,X)
-
f(N,x) =
f(x,y)
v
i f x = 1
-v
if x = n
(
0
x EN
otherwise
*
and f ( N , x ) =
(YJkA Note h e r e t h a t s i n c e (H,*)
f(y,x).)
v i s va l e d t h e
9
i s cancellative, the required
= 0 which i s necessary i n t h e case o f semigroups w i t h o u t c a n c e l -
l a t i v e law, can be r e p l a c e d by t h e c o n s e r v a t i o n l a w i n ( 3 . 2 ) . Analogous t o t h e case o f t h e c l a s s i c a l network f l o w t h e o r y (e.g.,
[2])
71
we can p r o v e [6,
Ford, F u l k e r s o n
the following result:
A l g e b r a i c max f l o w - m i n c u t theorem.
v i s t h e v a l u e o f a maximal a l g e b r a i c f l o w i f
and o n l y i f t h e r e e x i s t s a s u b s e t X o f t h e node s e t N w i t h 1
E
X and n
E
f:
= N\X
such t h a t
v
=
* u(x,y) (X,Y)E(X,f)
- *
II(y,x) (Y,X)dX,X)
.
I n short max v =
We c a l l such a c u t
m i n - IU(X,X) lsX,nrX
(X,A)u(f,X)
-
II(A,x)I.
an a l g e b r a i c minimal c u t .
I n t h e a p p l i c a t i o n o f t h e a l g e b r a i c f l o w t h e o r y t o t h e t i m e - c o s t t r a d e o f f problems we a r e m a i n l y i n t e r e s t e d i n i d e n t i f y i n g an a l g e b r a i c minimal c u t .
Such a c u t
(and s i m u l t a n e o u s l y a maximal a l g e b r a i c f l o w ) can be found b y t h e f o l l o w i n g a l g o r i t h m which i s a s t r a i g h t f o r w a r d g e n e r a l i z a t i o n o f Ford and F u l k e r s o n ' s [2] l a b e l i n g a l g o r i t h m f o r c l a s s i c a l network f l o w s . Maximum a l g e b r d i c f l o w a l g o r i t h m . ___ Start:
1).
A
-+
H l o w e r and upper c a p a c i t y , r e s p e c t i v e l y .
f: A
-f
H a f e a s i b l e a l g e b r a i c f l o w w i t h v a l u e v.
k,u:
S t a r t i n g f r o m node 1 s u c c e s s i v e l y l a b e l nodes y f r o m a l r e a d y l a b e l i y nodes
H. W.Hamacher and S. Tufekci
172 x if
2).
(x,y) E. A and f ( x , y )
< u(xly)
("forward arcs"),
(y,x) E A and f ( y , x )
> e(y,x)
("backward a r c s " )
or if
If i n t h i s l a b e l l i n g process n is l a b e l l e d t h e n go t o s t e p f o u r .
Otherwise
go t o s t e p t h r e e .
3).
D e f i n e X t o b e t h e s e t o f l a b e l l e d nodes and
Node n cannot b e l a b e l l e d . t h e s e t o f u n l a b e l l e d nodes.
Now,
(X,x)u(R,X)
x
i s an a l g e b r a i c minimal c u t
(and f i s a n a l g e b r a i c maximal f l o w ) .
4).
Use t h e l a b e l s t o i d e n t i f y an augmenting p a t h P f r o m 1 t o n. 61 = miniu(x,y)
-
f(x,y)
62 = m i n [ f ( x , y )
-
n(x,y)
1 I
(x,y)
forward arc i n P j
(x,y)
backward a r c i n P }
Define,
63 = 1 n i n { 6 ~ , 6 ~ j ,
and change f by,
f(x,y)
=
1
f(x,y)
*
h 3 , i f (x,y)
f(x,y)
-
A3,
d3,
P
backward a r c i n P
, otherwise.
f(x,y)
Set v = v
i f (x,y)
forward arc i n
go t o s t e p one.
The presented l a b e l i n g a l g o r i t h m i s o n l y one p o s s i b i l i t y t o s o l v e a l g e b r a i c f l o w problems.
[7],
One c o u l d a l s o use g e n e r a l i z a t i o n s o f more e f f i c i e n t a l g o r i t h m s [3],
b u t a p r e s e n t a t i o n o f t h e s e a l g o r i t h m s i s beyond t h e scope o f t h i s paper. The i d e a o f t h e subsequen-
An example o f t h i s a l g o r i t h m w i l l be performed l a t e r .
t l y d e s c r i b e d a l g o r i t h m f o r s o l v i n g t h e a l g e b r a i c t i m e - c o s t t r a d e o f f problem i s
t o s o l v e a sequence of a l g e b r a i c maximum f l o w problems.
The r e s u l t i n g a l g e b r a i c
minimum c u t s a r e used t o change t h e a c t i v i t y t i m e s d. ..
Following t h e idea o f
1J
T u f e k c i [15]
t h e a l g e b r a i c maximum f l o w f a t t h e end o f i t e r a t i o n i i s used as
s t a r t i n g f l o w i n t h e beginning o f t h e n e x t i t e r a t i o n i t 1 . A l g o r i t h m f o r t h e a l g e b r a i c TCTOP.
I n what f o l l o w s we assume t h a t t h e r e a d e r i s
f a m i l i a r w i t h t h e CPM method f o r p r o j e c t networks.
L e t Ei and Li r e p r e s e n t t h e
e a r l i e s t r e a l i z a t i o n t i m e and l a t e s t r e a l i z a t i o n t i m e o f e v e n t i, r e s p e c t i v e l y . Then t h e s l a c k s S . . f o r each a c t i v i t y ( i , j ) E A a r e d e f i n e d b y Sij 1J
(see F o r d and F u l k e r s o n , [3]). Start: -
= L. J A c t i v i t y ( i , j ) i s c r i t i c a l i f f S . . = 0. 1J
d.. = b.. 1J
f(i,j)
1J
=
E
V
( i , j ) r A.
M l a r g e element o f H, e.g.,
M =
* ( i ,j )EA
c(i,j)
- E. 1
d..
1J
Algebraic flows and time-cost traa'eoff problems
173
1 ) . Use t h e CPM method t o compute f o r each a c t i v i t y ( i , j ) t h e s l a c k s Sij l e n g t h o f a l o n g e s t p a t h w i t h r e s p e c t t o t h e d u r a t i o n s dij.
(STOP).
t h a n o r equal t o t h e d e s i r e d p r o j e c t l e n g t h , 2).
and t h e
If T i s less
Otherwise go t o s t e p 2.
Define, u(i,j):
=
and L(i,j):
IE c(i,j)
i f d.. > a.
M
i f dij
= a
i f Sij
>
IJ
c(i,j)
=
ij
and Sij
= 0
and S . . = 0 ij 1J
0
i f d.. < b.. 1J 1J i f dij = b . .
1J
3 ) . Use t h e c u r r e n t a l g e b r a i c f l o w f ( i , j ) ,
Y ( i , j ) E A as f e a s i b l e s t a r t i n g f l o w
f o r f i n d i n g an a l g e b r a i c maximum f l o w f ' ( i , j ) c o r r e s p o n d i n g a l g e b r a i c minimal c u t
4).
If v ' a
M
then
(STOP).
(X,!)
w i t h f l o w v a l u e v ' and a
(J ( x , X ) .
The t o t a l c o m p l e t i o n t i m e cannot be d i m i n i s h e d w i t h -
o u t v i o l a t i n g t h e c r a s h d u r a t i o n o f a t l e a s t one a c t i v i t y , i.e., If v' <
M t h e n denote, A1: = { ( i , j ) 6 ( X , i )
5).
A2: = { ( i , j ) E
(R,X)
A3: = { ( i , j )
(X,R)
~1
I
Sij
= 0, d . . > a . . )
I I
Sij
= 0 and dij
Sij
>
1J
1J
<
b..) 1J
03.
Define, A1:
= min{dij
-
minIbij
-
A *: =
a.. 1J dij
A ~ =: minIS..
1J
A : = min(Al,A2,A3)
6).
T = Tc.
I I I
(i,j)
>
0.
Q
All
(i,j) E Apl ( i , j ) e A33
(3.6) and s e t
Redefine, [d:: dij:
-
A i f ( i , j ) E A1
d . . t A if ( i , j ) E A2
=
I d ij f(i,j)
= f'(i,j),
(3.7)
otherwise
v
(i,j)
E
A
T : = T - A . I f T i s l e s s t h a n o r equal t o t h e d e s i r e d p r o j e c t l e n g t h ,
Otherwise go t o s t e p one.
(STOP).
H.W.Hamcher and S. Tufekci
174
We note here t h a t f o r R = Z t h e a l g o r i t h m solves a t most Tn
-
f l o w problems and performs t h e same number of CPM a l g o r i t h m s .
Tc a l g e b r a i c maxThe complexity o f
t h e CPM a l g o r i t h m f o r an n node a c y c l i c network i s O(n2) and t h e complexity o f t h e best algebraic max-flow problem i s O(n3) (see [7] ) . Therefore t h e o v e r a l l complexi t y o f t h e proposed a l g o r i t h m i s O((T,
-
Tc)n3).
The v a l i d i t y o f t h e a l g o r i t h m i s
proved i n Section 5.
4 AN EXAPPLE - THE LEXICOGRAPHICAL TCTP Here we implement t h e a l g o r i t h m provided i n t h e previous s e c t i o n t o t h e a l g e b r a i c s t r u c t u r e d e f i n e d i n Example 4 of Section 2. Consider t h e p r o j e c t network g i v e n i n F i g u r e 2.
The c o s t v e c t o r c ( i , j )
i s repre-
sented as a column v e c t o r over each a r c .
The numbers b e f o r e and a f t e r c(i,j) represent t h e crash d u r a t i o n and normal d u r a t i o n o f t h a t a c t i v i t y , r e s p e c t i v e l y .
Note t h a t t h e f i r s t component o f t h e c o s t v e c t o r represents incremental d i r e c t costs.
The second component i s 1 f o r each a c t i v i t y i n d i c a t i n g t h e d e s i r e t o
minimize t h e c o n t r o l on t h e crashed a c t i v i t i e s .
c(i,j)
L a s t l y , t h e t h i r d component o f
represents t h e p r i o r i t y r a n k i n g o f each a c t i v i t y .
Note t h a t an a c t i v i t y
w i t h smaller r a n k i n g i s p r e f e r a b l e t o an a c t i v i t y w i t h higher ranking.
L e t Ei,
and Li f o r each node i E N represent t h e e a r l i e s t r e a l i z a t i o n t i m e and l a t e s t r e a l i z a t i o n time o f event i, determined by CPM method, r e s p e c t i v e l y .
F i g u r e 2 . An example p r o j e c t network f o r LTCTOP. aij, Start:
d.. = b. 1J
1J’
f = -
( V a l u a t i o n o f arcs:
g(i,j),bij)
0
Applying the CPM technique we g e t t h e l a b e l s as shown i n F i g u r e 3.
Algebraic flows and time-cost tradeoff problems
F i g u r e 3. Label (Ei,Li)
on each node by CPM.
175
(Valuation o f arcs:
d . . = b .) 1J iJ The a c t i v i t y s l a c k s may be found by u s i n g Sij = LJ. - Ei - d i j . T h i s y i e l d s S45 = 8, S58 = 10, S48 = 20 and o t h e r Sij = 0. The corresponding f l o w network and t h e upper a r c c a p a c i t i e s a r e d e p i c t e d i n F i g u r e 4 below. are L(i,j) =
0for
F i g u r e 4.
(The l o w e r c a p a c i t i e s
a l l (i,j)).
I n i t i a l Flow Network f o r LTCTOP.
Since t h e c u r r e n t f l o w i s f
E
0,we
(Arc valuations: l ( i , j ) )
can l a b e l t h e nodes 1, 2 , 5, 7, 8 and i d e n t i f y
t h e augmenting p a t h P = 11, 2 , 5, 7, 81. Ey(x,y)
Set f(1,2)
= f(2,5)
-
f(x,y)l
H. W.Hamacher and S. Tufekci
176
The n e x t augmenting p a t h w i l l be P = (1, 3, 5, 7, 8 } w i t h E = 5, = l e x m i n { g ( x , y ) -3
-
f(x,y)}
=
(X,Y)EP
Set f(1,3)
= f(3,5)
=
[I], [I, 1,I]!-[
The t h i r d augmenting p a t h i s P = {l,3, 6, 7, 81 w i t h E = Ll = l e x m i n -3
Set f(1,3)
=
I] 11, f(3,6)
=
f(6,7)
=
f(7,8)
=
[I.
=
Next f l o w augmenting p a t h i s P = (1, 4, 6, 7, 81
D u r i n g t h e f o l l o w i n g l a b e l l i n g a l l nodes g e t l a b e l e d e x c e p t node 8. lexmax i s a t hand w i t h
I![
, R
=
a c t i v i t y (7,8) by mint8-3,10,201
=
= 5.
{8}, and X
=
Thus a
N\x ( s e e F i g u r e 5 ) .
Now t h e p r o j e c t d u r a t i o n i s 21.
CPM method t h e new s l a c k v a l u e s a r e o b t a i n e d as f o l l o w s : S45
=
8, S58
Crash
By u s i n g =
5, S48 =I5
and o t h e r S . . = 0. 1J
The c o r r e s p o n d i n g f l o w network f o r t h i s i t e r a t i o n w i t h updated f l o w bounds i s d e p i c t e d i n F i g u r e 5 below.
Note t h a t t h e lexmax f l o w o f t h e l a s t i t e r a t i o n i s
used as a f e a s i b l e l e x f l o w f o r t h i s i t e r a t i o n . C o n t i n u i n g w i t h l a b e l l i n g we o b t a i n t h e p a t h P = 11, 4, 6, 7, 8 } w i t h
Algebraic flows and time-cost tradeoff problems
Figure 5
Maximal l e x f l o w i n i t e r a t i o n 1 w i t h updated f l o w bounds. (Arc v a l u a t i o n & ( i , j ) ,
For each ( i , j ) E P s e t f ( i , j )
f(4,6)
=
11,
f(6,7)
=
= f(i,j)
I]
and
t
!(i,j),
u(i,j))
s3. Now -f(1,4)
f(7,8)
=
r:].
=
Next a t t e m p t of l a b e l l i n g s t o p s s h o r t of l a b e l l i n g node 8. t h e nodes i n
177
1 a r e 7 and 8. A = Al
Thus X = 11, 2, 3, 4, 5, 6,},
= min{d57 = min(5-2,
-
a57' d67
8-5,
-
a67' '58'
When l a b e l l i n g s t o p s
1
= {7,
8},
'48'
5, 151 = 3.
S i n c e t h e d e s i r e d p r o j e c t l e n g t h i s 19 reduce t h e p r o j e c t l e n g t h by 2 more u n i t s by r e d u c i n g a c t i v i t i e s (5,7) d67 = 8
-
2 = 6.
and (6,7) by two u n i t s .
Set d57 = 5 - 2 = 3 and
Since t h e d e s i r e d p r o j e c t l e n g t h T = 19 i s achieved, t h e
algorithm terminates.
I f we were t o c o n t i n u e c r a s h i n g t h e n we should have
crashed t h e two a c t i v i t i e s above by t h r e e t i m e u n i t s .
I n such a case, t h e bounds
on t h e network must be updated and t h e l a b e l i n g a l g o r i t h m must c o n t i n u e .
5
VALIDITY OF
THE ALGORITHN
We prove t h e v a l i d i t y of t h e a l g o r i t h m by i n d u c t i o n on t h e number o f i t e r a t i o n s . F o r e v e r y p r o j e c t t i m e T and a c t i v i t y d u r a t i o n s d G(T) = { ( i , j )
I
Sij
=
ij
we denote
0).
(5.1)
R W. Hamacher and S. Tufekci
118
G(T) contains a l l c r i t i c a l paths w i t h r e s p e c t t o p r o j e c t t i m e T, i.e.,
a l l paths
P satisfying
1
d(P) =
(5.2)
d 1J .. = T
( i ,j )eP S t a r t = I t e r a t i o n 0: L e t T = Tn be t h e normal p r o j e c t time.
Obviously d .
ij
= bij
m i n i m i zes t h e o b j e c t i v e f u n c t i o n
* (i,j)EA I t e r a t i o n I: L e t T = T~
-
( b . .-d. . ) 0 c 1J
1J
6, 6 s u f f i c i e n t l y small.
I n order t o achieve a p r o j e c t time of Tn G(Tn) by 6 time u n i t s .
ij
-
6 we have t o crash a l l paths P i n
This can be done by f i n d i n g an a r b i t r a r y c u t ( X , j )
and crash a l l a c t i v i t y d u r a t i o n s by 6, i.e.,
G(Tn)
in
by d e f i n i n g
* C... Therefore a c u t The c o s t increase i s 6 o c ( X , R ) where c(X,R) = (i,j)e(X,i) IJ w i t h minimal value c(X,x) w i l l y i e l d a minimal c o s t increase. Such a c u t can be found by applying a maximal a l g e b r a i c flow a l g o r i t h m t o the lower and upper capacities I.(i,j) "6 sufficiently
minimal c u t ( X , x )
= 0 and u ( i , j )
E
1J
s m a l l " means t h a t d . .
1J
-
6 >, a.
1.j
Note t h a t
f o r a l l ( i , j ) E (X,X).
I f the
c o n t a i n s an a r c ( i , j ) w i t h d . - = a . . then c(X,?) > M and a l l 1J
c u t s i n G(T) have a v a l u e >c M. (i,j)
= c . . Y ( i , j ) f G(T), r e s p e c t i v e l y .
1J
Then we can f i n d a p a t h P w i t h dij
P which shows t h a t Tn = TC and t h e a l g o r i t h m stops.
= aij
for a l l
On t h e o t h e r hand i t
should be guaranteed t h a t no p a t h becomes c r i t i c a l which i s n o t contained i n G(Tn).
0<
Hence 6 6 min{S. . I S > 01. Therefore t h e a l g o r i t h m y i e l d s f o r a l l S w i t h IJ i j where c. i s d e f i n e d by ( 3 . 6 ) , optimal a c t i v i t y d u r a t i o n s d . ..
6 4 A,
1J
Iteration i
+
I t e r a t i o n ( i t l ) : Let T
<
Tn be a p r o j e c t time f o r which optimal
a c t i v i t y d u r a t i o n s d . . have been found by t h e a l g o r i t h m o f S e c t i o n 3. 1J
Consider a p r o j e c t time d(P) = T > T - 6 .
T
-
6,
A l l paths P i n G(T) s a t i s f y
6 s u f f i c i e n t l y small.
Therefore we have t o crash a t l e a s t one a c t i v i t y f o r each o f
d ! . .c< T - 6 . Again, t h e 1J ( i .J )Q problem i s t o f i n d a way o f c r a s h i n g which w i l l y i e l d a minimum c o s t increase i n
these c r i t i c a l paths i n o r d e r t o achieve d ' ( P ) =
the objective function. 6 c A3 = T
-
2
I f we choose d(P)
P n o n c r i t i c a l paths w i t h r e s p e c t t o T
(5.4)
(or e q u i v a l e n t l y , a3 = m i n I S - .IS.. > O } , as defined i n (3.6)), then t h e r e i s no 1 3 13 need t o crash d . f o r a r c s ( i , j ) which a r e n o t contained i n G(T). iJ
Algebraic flows and time-cost tradeoff problems
Ifwe f i n d i n G(T) a c u t (X,R)
such t h a t dij
-
6 3 aij
V(i,j)
179 E
(X,f)
then the
a c t i v i t y d u r a t i o n s d ! . defined by (5.3) w i l l y i e l d a p r o j e c t t i m e o f T ( d ! . ) 6 T 1J
S i n c e p a t h s i n G(T) can use a r c s of t h e c u t (X,R) can even become l e s s t h a n T
Example:
= (IR,+,c),
(H,*,&)
- 6.
1J
-
more t h a n once t h e l e n g t h d ' ( P )
6 y i e l d i n g an u n n e c e s s a r i l y h i g h c o s t i n c r e a s e :
T = 10, 6 = 1, G(T) c o n t a i n s t h e p a t h
P
= (1, 2, 5 ,
3, 4, 6 )
10 = T
dij
d(P)
d;j
d ' ( P ) = 8<9= 10 6
-
O b v i o u s l y we can add 1 u n i t o f t i m e t o t h e a c t i v i t y d u r a t i o n o f a c t i v i t y (5,3)
if d5,3 < b5,3. On t h e o t h e r hand i f d g Y 3 = b5,3 i n c r e a s i n g a c t i v i t y (5,3) above b g Y 3 w i l l n o t produce any s a v i n g s . T h e r e f o r e a c u t w i t h minimum v a l u e u(X,R)
-
k(R,X)
=
*
u(i,j)
(i,j)G(X,R)
* a(i,j) ( i ,j)e(R,x)
-
(5.5)
where u(i,j)
L(i,j)
y i e l d s a minimal c o s t i n c r e a s e .
=
=
f
I
c..
i f dij
>
aij
M
i f dij
= aij
cij
i f dij
<
E
i f dij
= bij
'J
b.. lJ
(5.7)
3
Note t h a t t h i s d e f i n i t i o n i s c o m p a t i b l e w i t h
(3.4) and (3.5) where we used t h e whole a c t i v i t y network as domain s e t . v a l u e u(X,R)
T
-
k(?,X)
>- M, t h e n by t h e same argumentation as i n t h e case above,
= TC, and t h e a l g o r i t h m s t o p s .
get d'(P) 4 T all 0
T -
4
6
6 A,
-
Otherwise we change dij
6 f o r a l l paths P i n G(T).
a c c o r d i n g t o (3.7) and
I f A i s computed by ( 3 . 6 ) ,
then f o r
d ! . i s t h e r e f o r e an o p t i m a l s o l u t i o n w i t h r e s p e c t t o p r o j e c t t i m e 1J
6.
I f the
H. W. Hamach er and S. Tufekci
180
Note f i n a l l y ,
t h a t a l l minimal c u t s (X,x)
a r e f o u n d by computing a maximal f l o w f .
S i n c e t h e c a p a c i t i e s change between two c o n s e c u t i v e i t e r a t i o n s o n l y on a r c s o f t h e c u t , and s i n c e f ( i , j )
= u(i,j)
Y (i,j) E
(X,f)
and f ( i , j )
= f.(i,j)
W (i,j) E
(y,X),
t h i s f l o w w i l l be f e a s i b l e i n t h e n e x t i t e r a t i o n and can t h e r e f o r e be used as s t a r t i n g f l o w i n t h e subsequent i t e r a t i o n .
6
CnNCLUSION
An a l g e b r a i c t i m e - c o s t t r a d e o f f a l g o r i t h m i s d e s c r i b e d i n t h i s paper. shown t h a t d i f f e r e n t o b j e c t i v e f u n c t i o n s (e.g.,
I t has been
sum o b j e c t i v e , and l e x i c o g r a p h i c a l
o b j e c t i v e ) can be handled by c o n v e r t i n g t h e c o r r e s p o n d i n g a l g e b r a i c o p t i m i z a t i o n model i n t o an a l g e b r a i c network f l o w problem.
Once t h e problem i s c o n v e r t e d i n t o
a n a l g e b r a i c f l o w problem, a n e f f i c i e n t F o r d and F u l k e r s o n [2]
type labeling
a l g o r i t h m may be employed t o d e t e r m i n e t h e a l g e b r a i c minimum c u t s . By f o r m u l a t i n g t h e problem as a l e x i c o g r a p h i c a l TCTP, t h e l e x i c o g r a p h i c a l t i m e c o s t t r a d e o f f a l g o r i t h m enables t h e p r o j e c t manager t o s e l e c t t h o s e c r i t i c a l a c t i v i t i e s f o r crashing which l e x i c o g r a p h i c a l l y optimize m u l t i p l e o b j e c t i v e functions. Selecting a smallest s e t o f a c t i v i t i e s f o r achieving t h e desired p r o j e c t d u r a t i o n a t a minimal d i r e c t c o s t g i v e s t h e manager a g r e a t e r f l e x i b i l i t y on e x e r c i s i n g b e t t e r c o n t r o l o f t h o s e a c t i v i t i e s which need c l o s e m o n i t o r i n g because o f c r a s h schedule.
ACKNOWLEDGEMENT The a u t h o r s w i s h t o express t h e i r a p p r e c i a t i o n t o t h e r e f e r e e s f o r many h e l p f u l comments c o n c e r n i n g t h e f i r s t d r a f t o f o u r p a p e r .
REFERENCES
[l] Elmaghraby, S.E., The d e t e r m i n a t i o n o f o p t i m a l a c t i v i t y d u r a t i o n i n p r o j e c t scheduling, J o u r n a l o f I n d u s t r i a l E n g i n e e r i n g , Vol. 19, No. 1, ( J a n u a r y 1968) 48-51. [2]
Ford, L . R . , and F u l k e r s o n , D.R., F l o w i n Networks, ( P r i n c e t o n U n i v e r s i t y Press, P r i n c e t o n , New J e r s e y 1962)
.
[3]
F r i e z e , A.M.,
[4]
Fulkerson, D . R . ,
A l g e b r a i c f l o w s , Annals o f D i s c r e t e A p p l . Math.,
c u r r e n t volume.
A Network f l o w c o m p u t a t i o n f o r p r o j e c t c o s t curves, Managemert
Algebraic flows and time-cost tradeoff problems
181
Science, V o l . 21, No. 6, ( F e b r u a r y 1975) 718-722. c51
Goyal, S.K., A n o t e on ' A s i m p l e CPM t i m e - c o s t t r a d e o f f a l g o r i t h m ' , Management Science, Vol. 21, No. 6, (February 1975) 718-722.
FI
Hamacher,, H., D e t e r m i n i n g minimal c u t s w i t h a minimal number o f a r c s , Networks (1982) 493-504.
171
Hamacher, H. , Flows i n Regular M a t r o i d s , Mathematical Systems i n Economics, Vol. 69, (Oelgeschlager, Gunn and Hain, Cambridge, Mass., 1981). K e l l e y , J . E . , C r i t i c a l p a t h p l a n n i n g and s c h e d u l i n g : mathematical b a s i s , Operations Research, Vol. 9, No. 3, (May-June 1961) 296-320. Lamberson, L.R., and Hocking, R.R., Optimal t i m e compression i n p r o j e c t scheduling, Management Science, V o l . 16, No. 10, (June 1970) 8597-B606. Moore, L.J., T a y l o r , B.W., 111, Clayton, E.R., and Lee, S.M., A n a l y s i s o f m u l t i - c r i t e r i a p r o j e c t c r a s h i n g model, A I I E Transactions, (June 1978) 163169. Morlock, M., and Neumann, K. , E i n V e r f a h r e n z u r M i n i m i e r u n g d e r Kosten e i n e s P r o j e k t e s b e i vorgegebener P r o j e k t d a u e r , Angew. I n f . , Vol. 4, (1973) 135-140. P h i l l i p s , Jr.,S., and Dessouky, M.I., S o l v i n g t h e p r o j e c t t i m e / c o s t t r a d e o f f problem u s i n g t h e minimal c u t concept, Management Science, V o l . 24, No. 4, (December 1977) 393-400. Prager, W., A s t r u c t u r a l method o f computing p r o j e c t c o s t polygons, Management Science, V o l . 9, No. 3, ( A p r i l 1963) 394-404. Siemens, N., A s i m p l e CPM t i m e - c o s t t r a d e o f f a l g o r i t h m , Management Science, Vol. 17, No. 6, (February 1971) B354-8363. Tufekci, S., A f l o w p r e s e r v i n g a l g o r i t h m f o r t i m e - c o s t t r a d e o f f problem, A111 T r a n s a c t i o n s , Vol. 12, No. 3, (1982).
p6]
Zimmermann, U., L i n e a r and c o m b i n a t o r i a l o p t i m i z a t i o n i n o r d e r e d a l g e b r a i c s t r u c t u r e s , Annals o f D i s c r e t e Mathematics 10 ( N o r t h H o l l a n d Co., 1981).
This Page Intentionally Left Blank
Annals of Discrete Mathematics 19 (1984) 183-200 0 Elsevier Science Publishers B.V. (North-Holland)
183
RANKING THE CUTS AND CUT-SETS OF A NETWORK
H.W. Hamacher M. Queyranne J.-C. P i c a r d Department of I n d u s t r i a l Dept. des Sciences A d m i n i s t r a t i v e s F a c u l t y o f Commerce and Systems Engineering Universitt! d u Qudbec % P o n t f e a l U n i v e r s i t y o f B r . Columbia University o f Florida M o n t d a l - Quebec H3C 3P8 Vancouver, V6T 1W5 Canada Canada Gainesvi 11e, FL 32611 U.S.A.
Given a graph G=(V,A) a & i s a s e t X,$) o f a r c s w i t h ? t a r t f o r a l l (x,y)c(X,X). A i n g p o i n t i n X and t e r m i n a l p o i n t i n c u t - s e t i s a c u t which does n o t i n c l u d e a n o t h e r c u t . We d i s cuss t h e problem o f r a n k i n g c u t s and c u t - s e t s i n G, i.e., t h e problem o f f i n d i n g t h e K b e s t c u t s and c u t - s e t s , where t h e v a l u e s o f t h e c u t s a r e elements o f a t o t a l l y o r d e r e d semigroup. We r e s e n t an O(K,n*) a l g o r i t h m f o r r a n k i n g t h e c u t s a x O(mK-P.n3) a l g o r i t h m f o r r a n k i n g t h e c u t - s e t s .
6
1.
INTRODUCTION
Consider a f i n i t e , d i r e c t e d graph G = (V,A) where V = { v ~ , v ~ , . . . , v ~ , v ~ +i s~ ~t h e s e t o f nodes, and A = {a,,
...,}a,
F o r convenience we o f t e n
i s t h e s e t o f arcs.
denote a r c s by a = (x,y) where x = t ( a ) , and y = h ( a ) a r e t h e tfl,
and
head o f
a,
respectively. I n G we d i s t i n g u i s h two nodes s,teV.
t = v
n+l '
Then an ( s , t ) - c u t ,
W.1.o.g.
we assume i n t h e f o l l o w i n g s = v
o r s i m p l y a c u t (X,$) (X,$)
0'
i s a s e t o f arcs
:= { a e A l t ( a ) E X , h ( a ) d }
(1.1)
induced by a s e t X o f nodes such t h a t sex, t t x :=
v-x.
A cut-set i s a minimal ( m i n i m a l i t y w i t h respect t o s e t inclusion) cut.
w i t h C t h e s e t o f a l l c u t s and w i t h I ) t h e s e t o f a l l c u t - s e t s . I) S C
(see F i g u r e 1,a).
subset o f t h e nodes, i . e . ,
We denote
I n general
Moreover c u t s C E C can be induced by more t h a n one C = (X,X)
= (X',x')
f o r X # X ' (see F i g u r e 1,b). 1
1
F i g u r e 1: a )
(X,$)
(XI,!)
w i t h X = {s,2}
satisfies: C E C but C 9
6 C w i t h X = {s,1,2,4}
# {s,1,2,4,5}
I);
= X'
b)
C = (X,X)
=
H. W. Hamacher el al.
184
two c u t s ( X , x )
We d i s t i n g u i s h c u t s by t h e i r i n d u c i n g s e t s , i . e . , d i f f e r e n t i f f X # X ' (though t h e arc sets (X,x)
I n F i g u r e l,b
(X,R)
and ( X ' , x ' )
and ( X ' , x ' )
are
m i g h t be t h e same).
are d i f f e r e n t cuts.
H, where H i s some s e t , t o t a l l y o r d e r e d by an t h e n c ( D ) i s a l s o d e f i n e d f o r a l l c u t - s e t s D e D and we can
I f we d e f i n e a f u n c t i o n c : C
o r d e r r e l a t i o n 4,
and ( X , X ' )
-t
c o n s i d e r t h e f o l l o w i n g problems: K Best Cut Problem:
(K-CP)
F i n d t h e K b e s t c u t s C1,
c(C1) 6
K Best Cut-Set Problem: (K-CSP)
\<
c(D1) 4
... \<
...,Ck
E
W C E C , C # C1, i = 1 ,..., K
c ( C k ) \< c(C)
F i n d t h e K b e s t c u t - s e t s D1,
... \<
C, i . e . ,
...,Dk € 2 7 ,
i.e.,
W DeD,D#Di,i
c ( D k ) 6 C(D)
= 1 , ...,K.
I n t h e f o l l o w i n g we d i s c u s s some examples where (K-CP) o r (K-CSP) can o c c u r .
Example 1:
L e t H = RI, c(c): =
i .e.,
I:
c:A
+
IR,
and d e f i n e
w c
c(a)
EC.
a d F o r K = 1 t h i s problem i s w e l l s o l v e d b y means o f network f l o w t h e o r y : i n t e r p r e t
s and t as s i n k and source, r e s p e c t i v e l y , and s o l v e a maximal f l o w problem w i t h capacity f u n c t i o n c.
From t h e c l a s s i c a l max f l o w
f o r t h e maximal f l o w v a l u e v
-
min c u t theorem [3]
we g e t
*
max'
vmax = m i n c(D) = m i n c ( C ) D d CEC T h a t means f o r K = 1 we do n o t have
Note t h a t a minimal c u t i s always a c u t - s e t .
t o w o r r y about t h e d i f f e r e n c e s between c u t s and c u t - s e t s , whereas f o r K have t o c o n s i d e r t h e s e d i f f e r e n c e s c a r e f u l l y .
1 we
>
Each maximal f l o w a l g o r i t h m
i d e n t i f i e s a minimal c u t o r c u t - s e t as soon as t h e maximal f l o w i s found and t h e e f f o r t t o s o l v e (1-CP) and (1-CSP) i s t h e r e f o r e O ( n 3 ) p6]. Many problems, t h e o r e t i c a l as w e l l as p r a c t i c a l ones, can be modeled by t h i s s p e c i a l case o f (1-CP), e.g.,
t i m e / c o s t t r a d e o f f problems p9, 241, b o o l e a n o p t i -
m i z a t i o n problems p5, 221, i n t e g e r programs [21], F o r an o v e r v i e w o f a p p l i c a t i o n s see [20].
o r s c h e d u l i n g problems [23].
In each o f t h e s e a p p l i c a t i o n s one
m i g h t be i n t e r e s t e d i n g e t t i n g i n f o r m a t i o n a b o u t t h e second, t h i r d , cut.
...,
k t h best
F o r i n s t a n c e , t h e f a i l u r e o f some a r c s m i g h t l e a d t o t h e i n a v a i l a b i l i t y o f
t h e minimal c u t .
O r t h e i n f o r m a t i o n a b o u t t h e v a l u e d i f f e r e n c e s c ( D ~ + ~- )c(Di)
Ranking the cuts and cut-sets of a network
185
may s u p p o r t d e c i s i o n s t o defend t h e minimal o r t h e b e s t k c u t s i n m i l i t a r y o r game s i t u a t i o n s . I f G i s a p l a n a r graph t h e n K-CSP can be s o l v e d by f i n d i n g t h e K s h o r t e s t paths
i n t h e d u a l graph G*
Example 2 :
[5].
N o t i c e t h a t K-CP cannot be s o l v e d by t h i s approach.
I f t h e e v a l u a t i o n o f c u t s i s depending on more t h a n one c r i t e r i o n we
can r a n k t h e c u t s i n t h e f o l l o w i n g way: f i r s t criterion.
f i r s t , rank t h e cuts according t o t h e
Secondly, rank c u t s h a v i n g t h e same v a l u e h t h r e s p e c t t o t h e
f i r s t c r i t e r i o n a c c o r d i n g t o t h e second c r i t e r i o n , e t c . . can b e modeled as f o l l o w s :
..., c,(a)).
a vector c ( a ) = (cl(a),
This ranking o f cuts
g i v e n a f u n c t i o n 5:A + I R T a s s i g n i n g t o each a r c a E A Find a ranking o f t h e cuts C
E
C where
and where t h e o r d e r i n g c(Ci) 6 C ( C ~ + ~i s) d e s c r i b e d by t h e l e x i c o g r a p h i c a l o r d e r ing.
(i.e.,
i = minIjl1
5 6
= (xl,
...,
j 6 m, x j
..., y),
xm) \< (yl,
=
y
<=>
y or -x = -
xi < y.1 f o r
# yjI).
For e v e r y a p p l i c a t i o n mentioned i n Example 1 more t h a n one c r i t e r i o n can be involved i n the evaluation o f cuts.
The problem o f f i n d i n g minimal c u t s w i t h a
minimal number o f a r c s [ll] and t h e l e x i c o g r a p h i c a l t i m e / c o s t t r a d e o f f [13] problem a r e problems o f t h i s t y p e which have been s t u d i e d as y e t .
Example 3.
L e t c:A + I R and d e f i n e c ( C ) = max c ( a ) . a d
A p p l i c a t i o n s o f t h i s problem a r i s e i f one asks f o r b o t t l e n e c k s i n c u t problems. I f c(x,y) i s , f o r i n s t a n c e , t h e f l o w o f evacuees d u r i n g a b u i l d i n g e v a c u a t i o n t h e b e s t c u t w i t h r e s p e c t t o t h i s e v a l u a t i o n a l l o w s an easy c o n t r o l o f t h e f l o w
(e.g.,
by m o n i t o r s ) .
F u r t h e r a p p l i c a t i o n s i n c l u d e boolean o p t i m i z a t i o n problems
w i t h rnax o b j e c t i v e , b o t t l e n e c k s c h e d u l i n g problems, e t c . . The examples discussed so f a r have i n common t h a t t h e e v a l u a t i o n s o f t h e c u t s a r e separable f u n c t i o n s , t h a t means t h e v a l u e of a c u t can be found by a c o m b i n a t i o n o f t h e values d e f i n e d on t h e a r c s a
E
A.
I n S e c t i o n 2 we w i l l s p e c i f y t h e c u t e v a l u a t i o n and d i s c u s s t h e s o l u t i o n o f (K-CP) and (K-CSP) f o r K = 1 u s i n g a l g e b r a i c f l o w t h e o r y .
I n S e c t i o n 3 an a l g o r i t h m o f
H. W. Hamacher et al.
186
p7,
Murty and Lawler
181 w i l l be a p p l i e d t o solve (K-CP) by an O(K.n4) algorithm.
Then we consider (K-CSP) where we present an O(mK-'.n3)
a l g o r i t h m and show t h a t
t h e problem o f f i n d i n g a K - t h s m a l l e s t c u t - s e t i s NP-hard.
2.
SPECIFICATION OF CUT EVALUATIONS AND SOLUTION FOR K = 1
I n order t o s p e c i f y the e v a l u a t i o n o f t h e c u t s C E C we i n t r o d u c e a f u n c t i o n c:A
+
H where (HI*,&)
i s an ordered semigroup.
O p t i m i z a t i o n problems i n semi-
groups were f i r s t considered by Burkard [l]. Since then many papers have appeared d e a l i n g w i t h combinatorial o p t i m i z a t i o n problems i n semigroups. overview the reader i s r e f e r r e d t o
[Z, 251.
For an
The d e f i n i t i o n s and r e s u l t s o f t h i s
s e c t i o n a r e from [9, 101 and w i l l be summarized t o have t h e paper s e l f - c o n t a i n e d . Def:
(H,*,G)
i s an ordered semigroup i f
(2.1)
(H,4) i s a t o t a l l y ordered set,
(2.2)
(H,*)
i s a commutative semigroup w i t h n e u t r a l element 0,
and (2.3)
a d
6 =>a* y 6 6
*
W a,B
Y
y
e H.
I n a d d i t i o n we assume t h e v a l i d i t y o f t h e reduction r u l e :
(2.4)
a c< $ => 3 y e H : a*y = 6 W a,B E H
and the (2.5)
weak c a n c e l l a t i o n r u l e a
*
$ = n
*
y
-i>
6[
= y Or a
Moreover we extend H by a symbol
-
c(C) =
*
8 = a]
satisfying a
We r e q u i r e t h a t c(x,y) a 0 f o r a l l (x,y) o f any c u t C E C by
(2.6)
*
e A.
-
W
cH.
a,B,y
and a
*
- -*
V a E H. Then we can d e f i n e t h e e v a l u a t i o n <
=
=
m
c(a)
a6C where
*
a€H '
a = a1
*
a2
* ... *
a
q
f o r a l l H ' = { a l , ...,a
9
c H.
I t i s easy t o see t h a t Examples 1-3 can be t r e a t e d i n t h e framework o f (2.1)-(2.6).
( 2 . 1 ) ensures t h a t (K-CP) and (K-CSP) a r e w e l l posed. a l l o w us t o s o l v e (1-CP), i.e.,
Properties (2.2)
i n an analogous way as we solved (1-CP) i n Example 1 o f Section 1 a t a l g e b r a i c flows i n G.
-
(2.5)
the problem o f f i n d i n g an a l g e b r a i c minimal c u t ,
-
by l o o k i n g
Ranking the cuts and cut-sets of a network L e t c:A
Def:
-t
Then f : A
187
W a E A. H be a f u n c t i o n w i t h c ( a ) 5 0 H i s c a l l e d a l g e b r a i c f l o w i f i t s a t i s f i e s t h e f o l l o w i n g two
+
properties: (2.7) 0
\i
f ( a ) 6 c(a)
V e s E
w xcv
= f(X,X)
( 2 . 8 ) f(X,R)
*
where f ( P , Q ) =
f(a)
P,Q E V .
for
a 4 P ,Q) I n t h i s f o r m u l a t i o n we assume t h e e x i s t e n c e o f an a r c ( t , s ) return arc
-
the so-called
I f we denote w i t h F t h e s e t o f
and c a l l f ( t , s ) t h e v a l u e o f f l o w f .
a l l a l g e b r a i c flows,
-
t h e n t h e f o l l o w i n g r e s u l t [9,
101 h o l d s :
A l g e b r a i c Max Flow-Min Cut Theorem max f ( t , s ) faF
= min c(C) = m i n
c a
*
c(a)
CeC a r c
It i s p o s s i b l e t o g e n e r a l i z e t h e w e l l known max f l o w a l g o r i t h m s t o a l g e b r a i c
flows:
i n t h i s way we g e t a n O(m2.n) l a b e l i n g a l g o r i t h m g e n e r a l i z i n g Edmonds'
and K a r p ' s a l g o r i t h m [6] and O(m.nz) and O(n3) l a y e r e d graph a l g o r i t h m s g e n e r a l i z i n g t h e a l g o r i t h m s of D i n i c [4]
I n a l l procedures i t s h o u l d
and Karzonov p 6 ] .
be n o t e d t h a t elementary o p e r a t i o n s i n c l u d e b i n a r y o p e r a t i o n s a comparisons w i t h r e s p e c t t o t h e o r d e r i n g
<
i d e n t i f i e d by t h e s e a l g o r i t h m s i s a c u t - s e t .
i n H.
*
6 i n H and
Moreover t h e minimal c u t
T h e r e f o r e t h e p r e c e d i n g approach
s o l v e s (1-CP) as w e l l as (1-CSP).
3.
AN 0 ( ~ . n 4 ) ALGORITHM FOR FINDING
THE K BEST CUTS IN A NETWORK
R e c a l l t h a t (K-CP) ranks t h e c u t s o f a network by c o n s i d e r i n g two ( o r more) p o s s i b l e d i f f e r e n t r e p r e s e n t a t i o n s (X,f) d i f f e r e n t cuts.
That i s (X,,R,)
and ( X ' , x ' )
w i t h X1 = {s,1,2,4)
o f F i g u r e 1 and ( X i , i i ) w i t h X1 = Is,1,2,4,5)
set
c
= (xl
,i)lequals
o f a cut C
E
C as two
i s a b e s t c u t i n t h e network
i s a 2nd b e s t c u t though t h e a r c
( x i $1;).
F o l l o w i n g Hammer (Ivanescu) p 5 ] ,
and P i c a r d and R a t l i f f [21]
we i n t r o d u c e now a
b i n a r y q u a d r a t i c a l g e b r a i c program which i s e q u i v a l e n t t o t h e problem o f f i n d i n g a best cut.
With each c u t (X,x) we a s s o c i a t e a c h a r a c t e r i s t i c v e c t o r
2 = ( Z . l i = 1, 1
...,n ) f 1
where i f node v -
8
X
R W.Hamocher et al.
I88
Note t h a t t h e r e i s no need t o s p e c i f y Boolean v a r i a b l e s f o r s = vo and t = Vn+l since vo
x
X, v
E f o r a l l cuts ( X , j ) . n+l c h a r a c t e r i s t i c vectors o f c u t s (X,X).
E
Thus Zo = 1 and Zn+l = 0 f o r a l l
Next we d e f i n e an e x t e r n a l o p e r a t i o n between a b i n a r y v a r i a b l e Z element a i n t h e semigroup
and an
E
{O,l}
-+
H i s equivalent
H by
O D a = 0 (3.2) 1 o a = a With (3.2) the problem o f f i n d i n g a b e s t c u t w i t h respect t o c:A
t o f i n d i n g an optimal s o l u t i o n o f t h e f o l l o w i n g B i n a r y Q u a d r a t i c A l g e b r a i c Problem
( 5QAp1
s.t. Z E 6 := { Z 6 I0,ll
n+2 : Zo = 1, Zn+,
= 01.
I n the f o l l o w i n g we w i l l have t o solve (3.3) under t h e a d d i t i o n a l c o n s t r a i n t s t h a t some v a r i a b l e s are f i x e d t o 0 o r 1 whereas o t h e r v a r i a b l e s a r e f r e e .
In
order t o see t h a t t h i s problem can be solved by f i n d i n g a best c u t i n a m o d i f i e d network we f i r s t r e w r i t e (3.3).
Define
1
c..
1J
if (vi,vj)
E
A
=
tj i,j = 0
if (vi,vj)
#
,..., n t l .
A.
Then t h e o b j e c t i v e f u n c t i o n o f (3.3) becomes
n+l n+l
(3.4)
*
*
(zi(l-zj))
i 3
Cij.
i=O j=O
We p a r t i t i o n N = i O , l ,
..., n,nt13
i n t o N = NoCJ
the sets of i n d i c e s i n N where the v a r i a b l e s Zi free, respectively. Then we w r i t e (3.4)
NIU
N'.
Here N,
N1. and N ' a r e
are f i x e d t o 0, f i x e d t o
, and
Ranking the cuts and cut-sets of a network n t l n+l J=fi
*
*
(zi.(l-zj)) 0
j=O
*
*
c 1. .J
(l-zj)
u c 1J ..
zi
oc.. 1J
* *
ieN' jeNO
189
The f i r s t p a r t o f t h e r i g h t - h a n d s i d e i s a c o n s t a n t and can be d i s r e g a r d e d i n t h e minimization.
The second p a r t can be i n t e r p r e t e d as t h e v a l u e o f a minimal c u t
i n a network which i s d e r i v e d f r o m G as f o l l o w s .
(3.5)
F o r a l l ?.
E
N ' do:
Set CSL = C(s,v,)
*
=
I f (s,va) 6 A and
Cia.
ieNl
Csa. > 0, t h e n add ( s , v a ) t o A. Set CLt
= C(V,,t)
*
=
6 A and
I f (v,,t)
Caj.
&No CLt
(3.6)
>
0, t h e n add (v,.t)
O m i t a l l v Q w i t h II
If ( s , t )
E
E
NoU N1 -
I s , t } and t h e a r c s i n c i d e n t t o such nodes.
A, t h e n d e l e t e a r c ( s , t ) f r o m G.
F o r each c h a r a c t e r i s t i c v e c t o r
*
t o A.
(zs(l-zL))D
WN' =
csa
*
=
1a s s o c i a t e d *
a€"
*
aeN ' i e N =
*
w i t h a c u t d n t h i s network we g e t
((l-ZaP ( l - Z R ) 0 Cia
*
ieN1
Cia)
(by the d e f i n i t i o n o f El)
1
*
ieNl LeN'
(1-Za)
17 Cia ( b y t h e c o m m u t a t i v i t y o f * )
H. W. Hamacher et al.
I90 and, analogously,
Hence the b i n a r y q u a d r a t i c a l g e b r a i c problem w i t h f i x e d v a r i a b l e s can be solved by f i n d i n g an a l g e b r a i c minimal c u t i n a m o d i f i e d network. (H,*,<)
= (R,+,e)
An example f o r
i s worked o u t i n F i g u r e 2.
1
1 1 F i g u r e 2:
F i n d i n g the best c u t i n the network o f F i g u r e 1 w i t h f i x e d v a r i a b l e s Z1 = 1, Z2 = 0 i n t h e characteristic vector
N0 =
cs3
{2,t}, = 1,
cs4
C3t = 9, Cqt Minimal c u t
N
1
=
Z.
{ ~ , lN } ’ ,= {3,4,5,6}
cs5
=
0,
= 0, CS6 = 1
=
0, Cgt = 0, Cst = 9 Therefore t h e
( I s ) , {3,4,5,6,tI).
optimal s o l u t i o n o f t h e f i x e d v a r i a b l e BQAP i s
z
= (1,0,0,0,0,0).
I n order t o solve (K-CP) we apply a technique developed by Murty p8] f o r assignment problems and formulated by Lawler c7] f o r a r b i t r a r y combinatorial optimizat i o n problems. We assume t h a t we have computed t h e k-1 b e s t s o l u t i o n s t h a t the f e a s i b l e s e t B o f ( 3 . 3 ) i s p a r t i t i o n e d i n t o
(3.7) where (3.8 (3.9 Init
B =
{Z1 ,...)-Zk-l
Bl ,k-1
.. . lJ BLYK-’
I 1 ,...,-Z k - l
(k 4 K) and
191
Ranking the cuts and cut-sets of a network s o l u t i o n i s t h e best, say
LJ’k-l, o f
the solutions Z
i,k-1
o f problems (3.3) w i t h
...,
B r e p l a c e d by BiSk-’ f o r i = 1, L. D e l e t e BJyk-T f r o m t h e p a r t i t i o n . L e t F = N ( ~ j ’ k - 1 TJ,k‘ ) denote t h e s e t o f f r e e v a r i a b l e s . I f F has p 3 1
u
-
elements, say F = {xl,.
,xp},
add p subsets B(l),...,B(p)
t o t h e p a r t i t i o n , as
f o l 1ows :
Z J Y k - l = 0 then x1
if -
Compute t h e b e s t s o l u t i o n i n each of t h e p newly c r e a t e d s e t s and r e a r r a n g e t h e p a r t i t i o n as (Bi’k-l:
i = l,...,L)
where t h e new v a l u e o f L i s L-l+p.
I n each i t e r a t i o n o f t h e r e s u l t i n g a l g o r i t h m we add a t most n s e t s Bi2k.
An
o p t i m a l s o l u t i o n o f t h e corresponding b i n a r y q u a d r a t i c a l g e b r a i c problem i s f o u n d by a p p l y i n g a maximal a l g e b r a i c f l o w a l g o r i t h m t o t h e m o d i f i e d network which has O ( n ) nodes.
T h e r e f o r e each i t e r a t i o n r e q u i r e s O(n4) elementary o p e r a t i o n s
and t h e c o m p l e x i t y o f t h e proposed a l g o r i t h m i s O(K.n4).
An example f i n d i n g t h e
4 b e s t c u t s i n t h e graph o f F i g u r e 1 i s worked o u t i n F i g u r e 3.
FINDING THE K BEST CUT-SETS Consider a t f i r s t t h e problem o f f i n d i n g two d i s t i n c t c u t - s e t s D1 and D2 such t h a t c(D1) 6 c ( D 2 ) and c(D2) 6 c(D) f o r a l l c u t - s e t s D d i s t i n c t f r o m D1 and D2. Since D1 does n o t c o n t a i n any c u t t h e r e must e x i s t a
E
D1 such t h a t a 9 D2.
Arc
a can be excluded f r o m any c u t - s e t w i t h f i n i t e c a p a c i t y by changing i t s c a p a c i t y to
-.
For a € D1, l e t D(a) denote a minimal a l g e b r a i c c u t w i t h r e s p e c t t o t h e
capacities
e
i
z1 =z2=1 Z3=l
z1=1 z2.0
s
s = {S,1,21 T = {t,3,4}
= Is,l) T = {2,tI
C(X4,X4)
Z ] =z2=1 Z3=O Z4=0
= 11
x4 = I S , l I
S = { S ,1,2,4,5)
T={t,3) c(Xi,iii)
= 3
2nd-best c u t zg=o z6=1
S= ( ~ , 1 , 2 , 5 } T= { t ,3,4 1 c ( X * , i8)=5 X ={~,1,2,5) 8
T= t,3,4,5
c ( xg ,i9) = I 2 xg={s,l ,2,8
I
zg=1
S={s,l,2,4,5,61 T= t,3
c ( X7,R7)=1 1
X7= Is,] ,2,4,5,6
B *2,B6,3,B
y 4
S={s,1,2,4,6] T=( t,3,51 C(xgyX6) = 11 X6={ s ,1,2,4,6)
( a l l var. f i x e d )
1
( a l l variables fixed) ( a l l variables fixed) F i g u r e 3:
t4
z1 =Z2=Z4=1 Z3=Zs=O
X ~ = { S , 1,2,4,5)
4th-best c u t
,,
W
F i n d i n g t h e f o u r b e s t c u t s i n t h e network o f F i g u r e 1
R
.F $:
P
3
!$
2 4
R
Ranking the cuts and cut-sets of a network
193
1
(4.1
Since t h e graph G = (V,A)
a E D1
such t h a t c,(D(a))
finite
-
D # D1,
i s n o t changed by (4.1),
D(a) i s a c u t - s e t .
c a ( D ( a ) ) f o r a l l a E D, and assume c,(D(a))
o t h e r w i s e t h e g i v e n network has a s i n g l e c u t - s e t . t h e r e e x i s t s , as n o t e d above, a E D1
c a ( D ( a ) ) > c,(D(a))
= c ( D ( a ) ) (because
second-best c u t - s e t .
a
-
D.
Choos? is
For every c u t - s e t
S i n c e a $ D, c(D) = ca(D) >/
D ( a ) ) and t h i s shows t h a t D ( B ) i s a
T h i s approach r e q u i r e s s o l v i n g a t most O(m) minimum
a l g e b r a i c c u t problems i n networks o f t h e same s i z e as G, and r e s u l t s i n an O(mn3) a l g o r i t h m . I n o r d e r t o improve t h e c o m p l e x i t y o f t h i s a l g o r i t h m we analyze t h e s i t u a t i o n i n which we f i n d a minimal a l g e b r a i c c u t D ( a ) w i t h r e s p e c t t o t h e c a p a c i t y f u n c t i o n
Suppose f i s a maximal a l g e b r a i c f l o w w i t h r e s p e c t t o c a p a c i t y c. f e a s i b l e w i t h r e s p e c t t o ca.
Obviously f i s
I n o r d e r t o f i n d D ( a ) we apply, f o r i n s t a n c e , a n
a l g e b r a i c l a b e l i n g a l g o r i t h m t o f and (G,ca), i.e., we i d e n t i f y s u c c e s s i v e l y R augmenting elementary paths p', ...,p f r o m s t o t where f o r a l l i = l , . . . , ~ (x,y)
(4.2)
(y,x)
forward a r c i n p
i
=>
f(x,y)
i
backward a r c i n p =>f(y,x)
<
ca(x,y)
> 0
Claim: A l l augmenting p a t h s c o n t a i n a r c a and do n o t c o n t a i n any
(4.3)
o t h e r a r c a ' e D1 , a ' # a.
Proof:
S i n c e f i s a maximal a l g e b r a i c f l o w i n (G,c),
f ( a ' ) = c(a') = ca(a') f o r
a l l a ' E D1, a ' # a. Hence a ' cannot be a f o r w a r d a r c i n some augmenting p a t h .
Ifa ' # a were a backward a r c o f an augmenting p a t h P t h e n h ( a ' ) labeled.
T h i s i s o n l y p o s s i b l e i f a r c a precedes a r c a ' i n P.
E
j1had been
Since P does n o t
c o n t a i n o t h e r f o r w a r d a r c s i n D1 than a and s i n c e t h e t e r m i n a l node o f P i s t
E
1, P would c o n t a i n a r c a f o l l o w i n g a r c a ' .
twice i n P
-
T h a t means t h a t a r c a would o c c u r
a c o n t r a d i c t i o n t o t h e d e f i n i t i o n o f an elementary path.
F i n a l l y , s i n c e D1 i s a c u t , any p a t h has t o c o n t a i n a t l e a s t one a r c o f D1, i . e . , a E P f o r a l l augmenting paths P. By (4.3) we can w r i t e each pi as
H.w.Hamacher et a[.
194
p
(4.4)
i
i
= (P,J’YSP
i Y
1
i i where x = t ( a ) , y = h(a), and p, and p are augmenting paths from s t o x and from Y y t o to, r e s p e c t i v e l y . Paths p i and pi can now be found independent from each o t h e r i n m o d i f i e d networks Y Gx and Gy. The node s e t o f G, is V x = tXIU{rt)} and t h e a r c s e t is Ax = Ca r A : t ( a )
E
X1} where we r e d e f i n e h(a) = t f o r a l l a € A x w i t h h ( a ) f X1.
A ) where V = {I, U { s l l and Ay = { a E A : h ( a ) E. Y’ Y Y where t ( a ) = s f o r a l l a E A w i t h t ( a ) E. X1 (see F i g u r e 4 ) . Y Analogously, Gy = ( V
F i g u r e 4:
2,)
Construction o f G, ( f o r x = v1 o r x = v2) and G ( f o r x = v3 o r v = v4) Y
By the c o n s t r u c t i o n o f Gx and Gy each augmenting p a t h p
i corresponds t o augmenting paths (px,x,t)
i = (px,x,y,py) i i i n (G,ca)
i n (Gx,ca) and (s,y,py)
i Conversely, each p a i r o f augmenting paths (p,,x,t)
i
i n (G ,c ) . Y a
i n (Gx,ca) and (s,y,py)
i ( G ,c ).corresponds t o an augmenting p a t h pi = (p,,x,y,p;). Y a i amount o f flow which can be sent along (px,x,t) and (s.y,p’), Y i i i E = min(rx.c:) can be sent along p
cl
i
in
and ci is t h e Y r e s p e c t i v e l y , then
If
.
Using an i n d u c t i v e argument we can t h e r e f o r e f i n d t h e value f a ( t , s ) o f a maximal a l g e b r a i c f l o w i n (G,ca) by computing maximal f l o w values f x ( t , s )
i n (Gx,ca) and
Ranking the cuts and cut-sets of a network fy(t,s)
i n (Gy,ca),
195
and = min(fx(t,s),f Y (t,s)).
fa(t,s)
(4.5)
The advantage o f t h i s procedure i s t h a t we can use f x ( t , s ) f o r a p o s s i b l e o t h e r a r c a ' E D,, a"
E
a ' # a, w i t h t f a ' ) = x and f (t,s) Y If
f o r a possibly e x i s t i n g arc
D1, a" f a, w i t h h ( a " ) = y.
t ( D 1 ) = {x E. X1 : x = t ( a ) f o r some a
h(D1) = { y e
x,
v
x E t(D,),
and f (t,s), Y
V y E h(D1),
In t h i s way we i d e n t i f y B by
Y a E D ] , by (4.5).
I
f a ( t y s ) = min{fa(t,s)
(4.8)
D1l
: y = h(a) f o r some a E D1}
then we have t o compute a l l values f,(t,s), i n order t o compute fa(t,s),
E
a E DII,
Then we can f i n d the 2nd best c u t - s e t by s o l v i n g an a d d i t i o n a l maximal a l g e b r a i c f l o w problem i n (G,cz). An a l t e r n a t i v e approach can use the a l g e b r a i c minimal cuts (X,R) o r (Y,p) i d e n t i f i e d w h i l e computing f x ( t , s ) and f ( t , s ) (where x = t ( i ) , y = h ( a ) ) . Y Following (4.5) we consider the f o l l o w i n g case a n a l y s i s .
Case 1:
fg(t,s) = fX(t,s), i.e.,
fx(t,s)
(X,x) corresponding a l g e b r a i c minimal c u t - s e t i n G,,
= c(X,R).
Define
x,
(4.9)
=
x, R,
=
RU
x1
Then the d e f i n i t i o n o f G, y i e l d s c(X2,12) = c(X,R) = f x ( t , s )
That i s , D2 = (X2,X,)
= fg(t,s).
i s a 2nd best cut-set. Case 2:
f-(t,s) a
= f (t,s)
set i n Gy, (4.10)
Y
i.e.,
< f
X
(t,s),
fy(t,s)
xp
=
(Y,p) corresponding a l g e b r a i c minimal cutDefine
= c(Y,Y).
vux,, x,
=
8.
Then, again, we conclude from t h e d e f i n i t i o n o f G Y c(X2,X2) = c(Y,p) = f (t,s) = f - ( t , s ) , i.e., D2 = (X2,R2) Y a i s a 2nd best cut-set.
196
H. W. Hamacher et al.
Since we can d e f i n e a 2nd b e s t c u t - s e t by (4.9) o r (4.10) we g e t t h e f o l l o w i n g result. (4.11)
I f t h e network G contains two o r more cut-sets, then t h e r e
Theorem:
e x i s t two best c u t - s e t s D1 = (X,,X,)
x1 n R,
crossing ( i . e . ,
=
(I o r ji,n
and D2 =
x2
=
(X2,f2)
t h a t are non-
0).
I n both a l t e r n a t i v e s we solve a t most It(Dl) U h(D1)l 6 n a l g e b r a i c f l o w problems t o f i n d a 2nd best c u t - s e t .
Hence t h i s procedure i s o f o r d e r O(n'+) compared w i t h
O(m.n3) = O(n5) of t h e f i r s t v e r s i o n . D1 = [(~,3),(2,3),(1,6)1, fs(t,s)
= ft(t,s)
f2(t,s)
=
f3(t,s)
= 9,
=
(Example see F i g u r e 5 ) .
h!D1) = ~ ~ , 2 , 1 1t,( D 1 ) = I 3 9 6 t I
m
5, f 1 ( t , s ) = 5 =
9
= minIf,(t,s),
f3(t,s)1 = 9
f(2,3)(t,s)
= minIf2(t,s),
f3(t,s)}
= 5
f(1,6)(t3s)
= minIfl(t,s),
fg(t,s)]
=
f
(t,s)
fg(t,s)
(5-3)
i
Hence
= (2,3) o r
a
= (1,6)
A minimal c u t - s e t i n (G,ca) F i W e 5:
5
i s i n b o t h cases D2 = I ( s , l ) , ( s , 3 ) 3
F i n d i n g t h e 2nd b e s t c u t - s e t i n t h e network o f F i g u r e 1.
In the f o l l o w i n g we show how t o g e n e r a l i z e t h e c a p a c i t y m o d i f i c a t i o n (4.1) t o t h e case o f f i n d i n g t h e K b e s t c u t - s e t s . Assume t h a t we have found K-1 best c u t - s e t s D1,...,DK-l {Dl
,. . .
I.
and l e t DK = 2)
Any c u t D E DK must be such t h a t , f o r each i = 1,.
e x i s t s an arc ai
E
Di
-
D, f o r otherwise D would n o t be minimal.
of arcs a minimal covering o f D1
,..., DK- 1 i f Rn Di
#
and i f no proper subset o f R s a t i s f i e s t h i s p r o p e r t y .
..,K-1
there
We c a l l a s e t R
(I f o r a l l i = 1
,...,K-1
There e x i s t a f i n i t e number number, say L, o f such minimal coverings. C l e a r l y L 4 6 mK-'. so we now assume t h a t we have a l i s t R1,R 2,...,RL o f a l l such minimal coverings. L e t D
Dn
(tl
Kj
such t h a t R . = 0, f o r j = 1, ..., L. K J I C l e a r l y OK = U DK,. although t h e DK. a r e i n general n o t d s j o i n t . L e t D K be a j=l J J j
denote t h e s e t of a l l c u t - s e t s D E D I
197
Ranking the cuts and cut-sets of a network minimum c u t - s e t i n DK,.
Then a K-th b e s t c u t - s e t DK i s s i m p l y a b e s t c u t - s e t
,...,
D F i n d i n t DK amounts t o f i n d i n g a minimal a l g e b r a i c c u t among OK ,D 1 Kp KL. T h i s can be achieved by f i n d i n g a m i n i s e t t h a t does n o t c o n t a i n any a r c i n R j* ma1 a l g e b r a i c c u t - s e t i n a network (G,cR.) where J (4.12)
Hence a K-th b e s t c u t - s e t can be found by s o l v i n g a t most 0 ( m K - l ) minimum
. . ,DK-l
a l g e b r a i c c u t - s e t problems, p r o v i d e d D1,.
are available.
This r e s u l t s i n
a 0(mK-l n 3 ) a l g o r i t h m f o r f i n d i n g t h e K b e s t c u t - s e t s i n a network w i t h n nodes and m a r c s . Note t h a t t h e above a l g o r i t h m , f o r f i x e d K, i s polynomial i n m and n.
However,
i t appears q u i t e i m p r a c t i c a l f o r l a r g e v a l u e s o f K, as i t i s e x p o n e n t i a l i n K. It
is unknown whether an a l g o r i t h m polynomial i n m, n
erroneous [14].
exists f o r finding
Note a l s o t h a t t h e O(K.n4) a l g o r i t h m proposed i n [12]
K best cut-sets.
is
A polynomial a l g o r i t h m i n m, n, and K would be a v a i l a b l e p r o v -
i d e d we can s o l v e t h e f o l l o w i n g problem: F i n d a b e s t c u t - s e t c o n t a i n i n g a g i v e n s e t I o f arcs. We now p r o v e t h a t t h e problem o f f i n d i n g Dl,..-,DKml
- is
2
K-th b e s t c u t - s e t
-
w i t h o u t knowing
That i s , an a l g o r i t h m p o l y -
= (IR,+,<).
NP--hard, even i f (H,*,<)
nomial i n m, n and log K e x i s t s f o r t h i s problem i f and o n l y i f
P
= NP.
L e t us
f i r s t f o r m u l a t e i t as a d e c i s i o n problem (see [ 8 ] ) :
K-TH SMALLEST CUT-SET
I'nstance: a d i r e c t e d graph G = (",A),
c a p a c i t y c ( a ) e 2'
f o r each a E A, p o s i t i v e
i n t e g e r s K and B. Q u e s t i o n : a r e t h e r e K o r more d i s t i n c t c u t - s e t s D As o t h e r k-th b e s t problems ([8]),
C_
A w i t h c a p a c i t y c ( D ) < B?
t h i s problem i s n o t known t o be i n NP.
(4.13)
Theorem:
Proof:
Use r e d u c t i o n f r o m t h e f o l l o w i n g NP-hard problem.
K - t h s m a l l e s t c u t i s NP-hard.
K-TH LARGEST SUBSET
Instance: a f i n i t e s e t U, w e i g h t w(u) B 2
+
f o r each u
E
U, p o s i t i v e i n t e g e r s K
198
H. W.Hamacher et al.
and L. Question: are t h e r e K o r more d i s t i n c t subsets U ' C U w i t h w ( U ' ) 3 L? To an instance(U,w,K,L)
o f K-TH LARGEST SUBSET a s s o c i a t e t h e f o l l o w i n g instance
o f K-TH SMALLEST CUT:
v
=
uU I s , t l
A = {(s,u)
:
6 U)
(we assume s,t IJ E
l+w(u) c ( a ) = Il
6 = I U I + w(U)
Ulu I ( u , t )
:
U
Q
Ul
f o r a = (s,u) f o r a = (u,t)
-
L.
There i s a one-to-one correspondence between subsets U ' and c u t - s e t s D = (S,T) d e f i n e d by S =
U'u { s l , w i t h c(S,T)
=
Ill1 +
w(U)
-
w(U'), and t h e r e s u l t f o l l o w s .
Note t h a t t h e r e i s a l s o a one-to-one correspondence between c u t - s e t s and c u t s i n t h e network used i n t h e above p r o o f . SMALLEST CUT problem i s a l s o NP-hard.
I t f o l l o w s t h a t t h e corresponding K-TH
I n c o n t r a s t w i t h the case o f cut-sets,
however, an a l g o r i t h m polynomial i n m,n and
K i s known f o r f i n d i n g t h e K-th best
c u t s i n a network, as was demonstrated i n Section 3 o f t h i s paper.
REFERENCES: Burkard, R.E., Kombinatorische Optimierung i n Halbgruppen in:Bulirsch, R . , O e t t l i , !4. and S t o e r , J. (eds.), Lecture Notes i n Mathematics 477 (Springer Verlag, B e r l i n , 1975). Burkard, R.E. and Zimnermann, U., Combinatorial O p t i m i z a t i o n i n L i n e a r l y Ordered Semimodules: A Survey, i n : Korte, B. (ed.), Modern Applied Mathematics : O p t i m i z a t i o n and Operations Research (Amsterdam, North-Hol land, 1982) 391-436. Flows i n Networks, (Princeton U n i v e r s i t y Ford, L.R. and Fulkerson, D.R., Press, Princeton, New Jersey, 1962). A l g o r i t h m f o r s o l u t i o n o f a problem o f maximum f l o w i n a Dinic, E.A., rietwork with power e s t i m a t i o n , S o v i e t Math. Dokl. 11 (1970) 1277-1280. Domschke, W. and Engele, G. , M o g l i c h k e i t e n der Transformation eines VerkehrF netzes i n e i n dazu uales Netz zum Zweck von Kapazitatsuntersuchungen, Angewandte I n f o r m a t i k 10 ( 1 978) 432-437. Edmonds, J. and Karp, R.M., T h e o r e t i c a l improvement i n a l g o r i t h m i c e f f i c i e n c y f o r network f l o w problems, Journal o f t h e A.C.M. 19 (1972) 248264.
Ranking the cuts and cut-sets of a network
[7]
Gabow, H.N., Two algorithms f o r generating weighted spanning t r e e s i n order, S I A M J. Comput. (1977) 139-150.
[8]
Garey, M.R. and Johnson, D.S., Computers and I n t r a c t a b i l i t y : A Guide t o t h e theory o f NP-completeness, (Freeman, San Francisco, 1979).
[9]
Hamacher, H., Maximal a l g e b r a i c flows: algorithms and examples, i n : Pape, U. (ed.), D i s c r e t e S t r u c t u r e s and Algorithms, (Hanser, Munchen-Wien, 1980) 153-166. Hamacher, H., Flows i n r e g u l a r matroids, Math. Systems i n Economics 69 (1 981 ) Oel geschl ager , Gunn & Hai n , Cambridge
.
Hamacher, H., Determining minimal c u t s w i t h a minimal number o f arcs, Networks 12 (1982) 493-504. Hamacher, H.W., An O(K.n') a l g o r i t h m f o r f i n d i n g t h e K b e s t c u t s i n a network, Operations Research L e t t e r s 1,5 (1982) 186-189. Hamacher, H. and Tufekci, S., Lexicographical time-cost t r a d e o f f problems, Methods o f Operations Research, 45 (1983) 257-268. Hamacher, H.W., Picard, J.C. and Queyranne, M., c u t s i n a network, Technical Note (1983).
On f i n d i n g t h e K b e s t
Hammer (Ivanescu), P.L., Some network f l o w problems solved w i t h pseudoBoolean programming, Oper. Res. 13 (1965) 388-399. Determining the maximal f l o w i n a network by t h e method o f Karzanov, A.V., preflows, S o v i e t Math. Dokl. 15 (1974) 434-437. Lawler, E.L., A procedure f o r computing t h e K b e s t s o l u t i o n t o d i s c r e t e o p t i m i z a t i o n problems and i t s a p p l i c a t i o n t o t h e s h o r t e s t path problem, Management Science 18 (1972) 401-405. Murty, K.G., An a l g o r i t h m f o r r a n k i n g a l l t h e assignments i n i n c r e a s i n g o r d e r o f cost, Operations Research 16 (1968) 682-687. P h i l l i p s , S. and Dessouky, M.I., S o l v i n g t h e p r o j e c t time/cost t r a d e o f f problem u s i n g t h e minimal c u t concept, Management Science 4 (1977) 393-400. Picard, J.C. and Queyranne, M., Selected a p p l i c a t i o n s o f maximum flows and minimum c u t s i n networks, INFOR (1982). Picard, J.C. and R a t l i f f , H.D., A graph t h e o r e t i c equivalence f o r i n t e g e r programs, Operations Research 21 (1973) 261 -269. Picard, J . C . and R a t l i f f , H.D., 5 (1975) 357-370.
Minimum cuts and r e l a t e d problems, Networks
Sidney, J.B., Decomposition algorithms f o r single-machine sequencing w i t h precedence r e l a t i o n s and d e f e r r a l costs, Operations Research 22 (1975) 283298. [24]
Tufekci, S. , A f l o w preserving a l g o r i t h m f o r time-cost t r a d e o f f problem, IIE Transactions, v o l . 14, # 2 (1982) 109-113.
199
200 cZ5]
H. W.Hamacher et al. Zimnermann, U, Linear and combinatorial o p t i m i z a t i o n in ordered a l g e b r a i c structures, Annals of D i s c r e t e Mathematics 10 (1981).
Annals of Discrete Mathematics 19 (1984) 201-214 0 Elsevier Science Publishers B.V. (North-Holland)
201
SHORTEST PATHS I N SIGNED GRAPHS
P. Hansen I n s t i t u t d’Economie S c i e n t i f i q u e e t de G e s t i o n , Lille, France, and F a c u l t e U n i v e r s i t a i r e C a t h o l i q u e de Mons, Belgium.
A l a b e l l i n g a l g o r i t h m i s proposed t o determine t h e s h o r t e s t signed paths between one v e r t e x and a l l o t h e r s i n a weighted signed graph. I t can be implemented t o t a k e O(mlog l o g D/d) t i m e and O(n + m + D/d) space where D and d denote t h e l a r t h e l a r g e s t and s m a l l e s t w e i g h t s o f t h e a r c s , r e s p e c t i v e l y . The case where t h e a d d i t i o n a l r e q u i r e m e n t t h a t t h e paths b e elementary i s imposed, which i s NP-complete, i s - t a c k l e d through d e c m p o s i t i o n and branch and bound. A p p l i c a t i o n s a r e made t o problems o f b a l a n c e i n s m a l l groups, t r a n s i e n t behaviour o f complex s o c i e t a l systems and s i g n s o l v a b i l i t y of l i n e a r q u a l i t a t i v e systems o f equations.
1.
INTRODUCTION
L e t G = (X,U)(’)
denote a weighted signed g m p h i . e . a graph t o each a r c (xk,xl)eU
o f which b o t h a w e i g h t dkl
E
Rf and a s i g n S k l
E
{+,-I a r e assigned.
s i g n o f a p a t h as t h e p r o d u c t o f t h e s i g n s o f i t s a r c s .
Define t h e
The p r e s e n t paper i s
devoted t o t h e problem o f d e t e r m i n i n g s h o r t e s t signed paths between one v e r t e x and a l l o t h e r s , and i t s a p p l i c a t i o n s .
A l a b e l l i n g a l g o r i t h m f o r t h e g e n e r a l case i s proposed i n S e c t i o n 2; i t i s shown t h a t i t can be implemented so as t o have O(m l o g l o g D/d) t i m e a n d O(n t m
+
D/d) space c o m p l e x i t y , where n =
l a r g e s t and s m a l l e s t w e i g h t of t h e a r c s of
1x1, m
=
( U I , D and d denote t h e
U, r e s p e c t i v e l y .
The more d i f f i c u l t problem r a i s e d by t h e a d d i t i o n a l r e q u i r e m e n t t h a t t h e paths be elementary, i . e . t h a t no path does c o n t a i n more t h a n once t h e same v e r t e x , i s examined i n S e c t i o n 3.
I t i s noted t h a t t h i s problem i s NP-complete and an
a l g o r i t h m u s i n g decomposition and branch-and-bound i s proposed t o s o l v e i t . A p p l i c a t i o n s a r e t a k e n up i n S e c t i o n 4; t o problems of balance i n s m a l l groups, as presented by C a r t w r i g h t and Harary [4],
t o t h e t r a n s i e n t behaviour o f
( l ) We f o l l o w t h e t e r m i n o l o g y and n o t a t i o n s o f Berge [3].
202
P Harisen
s o c i e t a l systems, as modelized by Roberts [24],
and t o the problem o f s i g n -
s o l v a b i l i t y o f l i n e a r q u a l i t a t i v e systems o f equations.
An a l g o r i t h m implement-
i n g t h e necessary and s u f f i c i e n t c o n d i t i o n s f o r s i g n - s o l v a b i l i t y o f t h e Bassett Maybee and Q u i r k theorem [l] i s given f o r t h e l a t t e r case; i t embeds a polynomial a l g o r i t h m f o r t h e r e c o g n i t i o n o f s t r o n g l y s i g n s o l v a b l e systems. Conclusions a r e drawn i n s e c t i o n 5.
2.
THE DOUBLE-LABEL ALGORITHM
I n the f o l l o w i n g a l g o r i t h m , two l a b e l s if
and A - a r e assigned t o each v e r t e x j X, hence i t s name; these l a b e l s a r e i n t e r p r e t e d , a t a c u r r e n t i t e r a t i o n , 3
x. E J as t h e normalized l e n g t h s o f the s h o r t e s t p o s i t i v e and negative paths from
x1 t o x . y e t found. The a l g o r i t h m i s s i m i l a r i n s p i r i t t o t h a t o f D i j k s t r a 116.1 J and makes use o f buckets as i n Denardo and Fox 1151. I t s r u l e s are as f o l l o w s : a ) InitiaZisation a.1) Determine D = max k 9 1 1 (xk , X i d = min S1
dkl
and
\ ( Xk SX1)EU d k l
-
+
+
a . 2 ) Set a1 = 0, A. = = f o r j = 2,3 ,..., n; a = f o r j = i,2 J j + - = 0 f o r j = 1,2 + n; T = T = (1,2 nl. pj = p j
,...,
,...,
b) Selection of vertices
I
b.1) L e t a = Min {LA;] if
= u go t o d ) .
j E T+,
1A;J
I 1=
LXil, k
S- = {k
1
[Ail, k E T - 1
b.2) Set T+:= T+ \ S + ,
j
E
T-);
Otherwise l e t
S+ = {k
=
I
E T'l
T-:= T-
\ S-;
i f T+ u T- = @ go t o d ) .
if A t
,Ak+ + dkl/d
+
++
s e t A1 = ak
dk,/d
and p:
= k+
,..+,n;
203
Shortest paths in signed graphs t
c.2) Ik E S- : V 1 E T i f X1 > X i t d V 1 E T-
1
kl
d)
(x,,x,)
E
/d s e t x1 =
(xk,xl)E
i f X i > h i t dkl/d go t o b ) . Final ZabeZs.
I
t
i-
U,
ski
X i t dkl/d
=
-
+
and p1 = k-;
U, sk, = t set
= X i t dk,/d
and p i = k-;
+
S e t A t := A . x d and A - : = A T x d, j = 1,2 J J j~ t - - + P r i n t t h e xj, hj, p . and p i f o r j = 1,2 n. J
,...,n
,...
The s i g n e d s h o r t e s t paths a r e found through backwards r e c u r s i o n w i t h t h e p o i n t e r s
p i , p: t a k i n g s i g n s i n t o account. Note t h a t t h e i m p l i c i t assumption i s made J t h a t an empty p a t h has p o n ' t i v e s i g n . Note a l s o t h a t 0, computed i n s t e p a ) i s n o t used f u r t h e r i n t h e s e t o f r u l e s j u s t s t a t e d ; i t i s however necessary t o know t h i s v a l u e , and t h a t o f r D / d l , f o r t h e a s y m p t o t i c a l l y most e f f i c i e n t implementation o f the a l g o r i t h m , as d i s c u s s e d below.
An example o f t h e use o f
t h e a1 g o r i thm, on t h e graph o f f i g u r e 1, i s summarized i n t a b l e 1.
204
A; O
P. Hansen
Aj
x; a
a
A;
A; a
r
A; r
- x -2
A1
a
a
a
0:
a
a
A;
A;
A;
a
a
1 1 1 1 1
hi
a
={l} a {21 I31 10/3 0 10/3 E4,53 10/3 I61
0 4 / 3 = a 0 4 / 3 2 = 0 4 / 3 2 = 0 4/3 2 13/3 0 4/3 2 13/3
4 4
16/3
P;
P i
Pi
-
-
-
-
-
p1
p2
p3
p4
p5
p6
0
0
0
0
0
0
0
P;
Pj
0
0
0
1
+
0
1 + 1 + 1+ 1+
4 4 44-
0 0 0
Lengths
0
Pi
a
0:
3 3 3
a
13/3 13/3 13/3
0
0
0
0
0 0 0
2-
0 0 22-
0 0
5+
0
13
12
16
a 9 1 3
0 0
0
0
0 2-
0 0
0 0 1 + 0 0 1 + 3+ 5- I + 3+ 5- I + 3+ 5- 1+
a
7/3 7/3 7/3 7/3
s+
sfl I41 I51 I2361
I31 @
0
0 2 + 0 2+ 3+ 2+ 3+ 2+ 3+
:
4
6
3
7
10
T a b l e 1. R e s o l u t i o n o f t h e example o f f i g u r e 1 by t h e d o u b l e - l a b e l a l g o r i t h m .
L e t us now prove t h e a l g o r i t h m ' s c o r r e c t n e s s : 7;zz JaZueS of the labeZs A t and A T given b y the double label algorithm J m e equcl t o the l u n g ~ h so f the shortest positive and negative paths from x to
Yheorsr-r 2 .
1
x . for, uEi j fro1" 1 t o n. J P r o o f . The p r o o f i s by i n d u c t i o n on t h e number o f i t e r a t i o n s o f s t e p b ) . L e t us f i r s t n o t e t h a t , f r o m t h e r u l e s d e f i n i n g T+ and T-, l a b e l s x t o r :x such t h a t J J lit1 o r l<:l = A a t a g i v e n i t e r a t i o n a r e n o t m o d i f i e d a t any subsequent J + A = 0, which a l l o w s us i t e r a t i o n . Moreover, a t t h e f i r s t i t e r a t i o n o n l y LA L)
A=
1
t o begin t h e induction.
-
L e t us assume t h a t t h e l a b e l s o f v e r t i c e s s e l e c t e d
up t o i t e r a t i o n t - 1 a r e e q u a l t o t h e l e n g t h s o f t h e c o r r e s p o n d i n g s i g n e d s h o r t e s t paths ( a f t e r m u l t i p l i c a t i o n by d ) and c o n s i d e r t h o s e o f i t e r a t i o n t.
205
Shortest paths in signed graphs
Assume, by contradiction, one such l a b e l , say
t x., J
i s l a r g e r than t h e lenoth of
the s h o r t e s t positive path from x , to x . divided by d; l e t Pt denote t h i s path, J
l ( P t ) i t s length, xk t h e predecessor o f x x1 t h e vertex w i t h a label associated j' with Pt previously selected in s t e p b ) c l o s e s t t o x under t h a t condition and xr j
t h e follower of x1 on P t .
t
From s t e p c ) , x1 = xk implies ?, x d g l ( P + ) , so j x1 # xk. Now the subpath of Pt from xr t o x - has length a t l e a s t d and from J s t e p b ) the label of xr on Pt ( h i o r 1;) i s such t h a t LA> (orLAJ) 4 x, hence
1 ( P + ) 2 (1 - + 1 ) x d contradicting again h jt x d by induction.
Remark 1 .
1 (P').
The proof then follows
Beineke and Harary [Z] have introduced t h e concept of marked graphs,
i . e . graphs i n which each vertex xk has a s i g n s k e { + , - I . Let us consider a signed and marked graph and look a t the nroblem of finding signed paths from x 1 to a l l x . , the sign o f a path being the product of t h e signs of both i t s J arcs and i t s v e r t i c e s (including end v e r t i c e s ) . This problem can be reduced to the previous one by the following transformations, which leave the signs of a l l
paths unchanged: I f s 1 = - s e t s 1 = t and reverse t h e signs of a l l a r c s with x 1 as i n i t i a l vertex ; b ) For a l l x . such t h a t s = - s e t s = + and reverse the signs of a l l a r c s with J j j x as t e r n i n a l vertex; j c ) Erase a l l signs of v e r t i c e s . a)
Remark 2. structures.
The double-label algorithm can be implemented w i t h various data For sparse graphs and D/d moderate, asjm