Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2023) | last year (2022) | two years ago (2021) | Notes URL

Action:

login to update
Options:








Author, Editor(s)
Author(s):
Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker		dblp
dblp
dblp
dblp

BibTeX cite key*:

CooperFriezeMehlhornPriebe00

Title

Title*:

Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model


mehlhorn128.pdf (9475.88 KB)

Journal

Journal Title*:

Random Structures & Algorithms
Journal's URL:

http://www.interscience.wiley.com/jpages/1042-9832/

Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Wiley
Publisher's URL:


Publisher's
Address:

New York, USA
ISSN:

1042-9832

Vol, No, pp, Date

Volume*:

16
Number:

1

Publishing Date:

2000

Pages*:

33-46
Number of
VG Pages:

31

Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

We study the average-case complexity of shortest-paths problems in the vertex-potential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths but without negative cycles. We show that on a graph with $n$ vertices and with respect to this model, the single-source shortest-paths problem can be solved in $O(n^2)$ expected time, and the all-pairs shortest-paths problem can be solved in $O(n^2 \log n)$ expected time.

URL for the Abstract:


Categories,
Keywords:

Shortest-Paths Problems, Average-Case Complexity

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:

Public

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{CooperFriezeMehlhornPriebe00,
AUTHOR = {Cooper, Colin and Frieze, Alan M. and Mehlhorn, Kurt and Priebe, Volker},
 TITLE = {Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model},
 JOURNAL = {Random Structures & Algorithms},
 PUBLISHER = {Wiley},
 YEAR = {2000},
 NUMBER = {1},
 VOLUME = {16},
 PAGES = {33--46},
 ADDRESS = {New York, USA},
 ISBN = {1042-9832},
}

Entry last modified by Christine Kiesel, 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)
Volker Priebe		Created
12/21/1999 13:41:09
Revisions
7.
6.
5.
4.
3.		Editor(s)
Christine Kiesel
Tamara Hausmann
Anja Becker
Uwe Brahm
Uwe Brahm		Edit Dates
30.08.2006 16:25:14
20.06.2006 12:25:41
20.03.2001 17:10:01
28.01.2001 18:46:29
28.01.2001 17:32:11
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section
mehlhorn128.pdf