Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier ยต v w for each arc v w . For every unit of flow entering the arc, ยต v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi
โฆ LIBER โฆ
Fast and simple approximation schemes for generalized flow
โ Scribed by Lisa K. Fleischer; Kevin D. Wayne
- Book ID
- 106276156
- Publisher
- Springer-Verlag
- Year
- 2002
- Tongue
- English
- Weight
- 217 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Combinatorial Approximation Algorithms f
โ
Jeffrey D Oldham
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 226 KB
Simple approximation scheme for the Ande
โ
G. Zwicknagl; V. Zevin; P. Fulde
๐
Article
๐
1991
๐
Springer
๐
English
โ 33 KB
A simple scheme for generating general c
โ
A.A Amsden; C.W Hirt
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 654 KB
A simple scheme for generating nonisospe
โ
Wen-Xiu Ma
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 375 KB
On some Approximation Schemes for Steady
โ
M. Bause, J. G. Heywood, A. Novotny, M. Padula
๐
Article
๐
2003
๐
Springer
๐
English
โ 360 KB
New Approximation Schemes for General Va
โ
Muhammad Aslam Noor
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 88 KB
In this paper, we suggest and consider a class of new three-step approximation schemes for general variational inequalities. Our results include Ishikawa and Mann iterations as special cases. We also study the convergence criteria of these schemes.