MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Katriel, Iritdblp
Editor(s):
Régin, Jean-Charles
Rueher, Michel
dblp
dblp
Not MPII Editor(s):
Régin, Jean-Charles
Rueher, Michel
BibTeX cite key*:
Katriel2004a
Title, Booktitle
Title*:
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
Booktitle*:
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004
Event, URLs
Conference URL::
Downloading URL:
http://www.mpi-sb.mpg.de/~irit/pub/DAG.ps
Event Address*:
Nice, France
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
20 April 2004
Event End Date:
22 April 2004
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
3011
Number:
Month:
April
Pages:
190-199
Year*:
2004
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We deal with the problem of maintaining the heaviest paths
in a DAG under edge insertion and deletion.
Michel and Van Hentenryck~\cite{Michel} designed algorithms for
this problem which work on DAGs with strictly positive edge
weights. They handle edges of zero or negative weight by
replacing each of them by (potentially many) edges with
positive weights. In this paper we show an alternative
solution, which has the same complexity and handles arbitrary
edge weights without graph transformations. For the case in which
all edge weights are integers, we show a second algorithm
which is asymptotically faster.
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-InstitutfürInformatik
MPG Subunit:
Algorithms and Complexity Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Katriel2004a,
AUTHOR = {Katriel, Irit},
EDITOR = {R{\'e}gin, Jean-Charles and Rueher, Michel},
TITLE = {Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights},
BOOKTITLE = {Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {3011},
PAGES = {190--199},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Nice, France},
MONTH = {April},
}


Entry last modified by Christine Kiesel, 06/06/2005
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)
Irit Katriel
Created
01/12/2005 01:46:59 PM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm
Edit Dates
06.06.2005 15:24:41
25.05.2005 14:08:10
11.04.2005 17:20:44
02/15/2005 09:15:10 PM
03.02.2005 10:59:13