Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Althaus, Ernst
Mehlhorn, Kurt

dblp
dblp



BibTeX cite key*:

althaus-mehlhorn98

Title

Title*:

Maximum Network Flow with Floating Point Arithmetic

Journal

Journal Title*:

Information Processing Letters

Journal's URL:


Download URL
for the article:

http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V0F-3TP137J-1-6&_cdi=5645&_user=43521&_orig=browse&_coverDate=05%2F15%2F1998&_sk=999339996&view=c&wchp=dGLzVzz-zSkzV&md5=17c3790dbda005248c45d3174921510f&ie=/sdarticle.pdf

Language:

English

Publisher

Publisher's
Name:


Publisher's URL:


Publisher's
Address:


ISSN:

0020-0190

Vol, No, pp, Date

Volume*:

66

Number:

3

Publishing Date:

1998

Pages*:

109-113

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

We discuss the implementation of network flow algorithms in floating point arithmetic. We give an example to illustrate the difficulties that may arise when floating point arithmetic is used without care. We describe an iterative improvement scheme that can be put around any network flow algorithm for integer capacities. The scheme carefully scales the capacities such that all integers arising can be handled exactly using floating point arithmetic. Let n and m be the number of nodes and edges of the network, respectively. For m less-than-or-equals, slant109 and with double precision floating point arithmetic, the number of iterations is always bounded by three, and the relative error in the flow value is at most 2−19. For m less-than-or-equals, slant106 and with double precision arithmetic, the relative error after the first iteration is bounded by 10−3.

URL for the Abstract:


Categories,
Keywords:

Algorithms, Floating point arithmetic, Network flow

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Intranet

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

Expert

Appearance:

MPG publications list, university publications list, working group publication list, Fachbeirat


BibTeX Entry:

@ARTICLE{althaus-mehlhorn98,
AUTHOR = {Althaus, Ernst and Mehlhorn, Kurt},
TITLE = {Maximum Network Flow with Floating Point Arithmetic},
JOURNAL = {Information Processing Letters},
YEAR = {1998},
NUMBER = {3},
VOLUME = {66},
PAGES = {109--113},
ISBN = {0020-0190},
}


Entry last modified by Anja Becker, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Evelyn Haak
Created
08/14/1998 10:57:13 AM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Anja Becker
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm
Edit Dates
04.01.2008 11:15:49
28.08.2006 14:49:35
28.08.2006 14:45:51
30.03.99 22:40:34
25.03.99 14:46:05