English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights

Katriel, I. (2004). Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems: First International Conference, CPAIOR 2004 (pp. 190-199). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2A7A-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2A7C-A
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Katriel, Irit1, Author           
Régin, Jean-Charles, Editor
Rueher, Michel, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2005-06-062004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231914
Other: Local-ID: C1256428004B93B8-BF057B141CFA4E45C1256F8700463883-Katriel2004a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Nice, France
Start-/End Date: 2004-04-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 190 - 199 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3011 Sequence Number: - Start / End Page: - Identifier: -