Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Approximation Algorithms for Certain Network Improvement Problems (1998)
    Springer
    Journal of combinatorial optimization 2 (1998), S. 257-288 
    Details
    ISSN: 1573-2886
    Keywords: Complexity ; NP-hardness ; Approximation Algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study budget constrained network upgrading problems. Such problems aim at finding optimal strategies for improving a network under some cost measure subject to certain budget constraints. Given an edge weighted graph G = (V, E), in the edge based upgrading model, it is assumed that each edge e of the given network also has an associated function ce (t) that specifies the cost of upgrading the edge by an amount t. A reduction strategy specifies for each edge e the amount by which the length ℓ(e) is to be reduced. In the node based upgrading model, a node v can be upgraded at an expense of c(v). Such an upgrade reduces the delay of each edge incident on v. For a given budget B, the goal is to find an improvement strategy such that the total cost of reduction is at most the given budget B and the cost of a subgraph (e.g. minimum spanning tree) under the modified edge lengths is the best over all possible strategies which obey the budget constraint. After providing a brief overview of the models and definitions of the various problems considered, we present several new results on the complexity and approximability of network improvement problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1009798010579
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Buchbesprechungen (1984)
    Springer
    OR spectrum 6 (1984), S. 52-52 
    Details
    ISSN: 1436-6304
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01721252
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    An algorithm for the determination of longest distances in a graph (1975)
    Springer
    Mathematical programming 9 (1975), S. 350-357 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents an algorithm for ranking the vertices of a directed graph. Its space and time requirements are bounded byc 1 n 2 +c 2, wheren is the number of vertices of the graph andc 1,c 2 are positive constants which are independent of the size or other properties of the graph. The algorithm can be easily modified to solve the problem of determining longest distances from a vertex to all other vertices in a positive real valued graph with at mostc 1 n 2 +c 2 elementary operations; the same result holds for shortest distances in negative real valued graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01681355
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Book
    Book
    Informatik III Einführung in Datenstrukturen (1982)
    München u.a. :Hanser,
    Details
    Title: Informatik III Einführung in Datenstrukturen
    Author: Noltemeier, Hartmut
    Publisher: München u.a. :Hanser,
    Year of publication: 1982
    Pages: 221 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 5
    Book
    Book
    Graphentheorie: mit Algorithmen und Anwendungen (1976)
    Berlin u.a. :de Gruyter,
    Details
    Title: Graphentheorie: mit Algorithmen und Anwendungen
    Author: Noltemeier, Hartmut
    Publisher: Berlin u.a. :de Gruyter,
    Year of publication: 1976
    Pages: 239 S.
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 6
    Book
    Book
    Graphentheoretische Konzepte und Algorithmen / (2005)
    Wiesbaden :Teubner,
    Details
    Title: Graphentheoretische Konzepte und Algorithmen /
    Author: Krumke, Sven Oliver
    Contributer: Noltemeier, Hartmut
    Edition: 1. Aufl.
    Publisher: Wiesbaden :Teubner,
    Year of publication: 2005
    Pages: X, 407 S. : , graph. Darst.
    Series Statement: Leitfäden der angewandten Informatik
    ISBN: 3-519-00526-3
    Type of Medium: Book
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 7
    facet.materialart.
    Unknown
    Graphentheoretische Konzepte und Algorithmen (2000)
    Details
    Publication Date: 2020-11-13
    Description: Das vorliegende Skript bietet eine Einf{ü}hrung in die Graphentheorie und graphentheoretische Algorithmen. Im zweiten Kapitel werden Grundbegriffe der Graphentheorie vorgestellt. Das dritte Kapitel besch{ä}ftigt sich mit der Existenz von Wegen in Graphen. Hier wird auch die L{ö}suung des ber{ü}hmten K{ö}nigsberger Br{ü}ckenproblems aufgezeigt und der Satz von Euler bewiesen. Im vierten Kapitel wird gezeigt, wie man auf einfache Weise die Zusammenhangskomponenten eines Graphen bestimmen kann. Im Kapitel sechs wird dann sp{ä}ter mit der Tiefensuche ein Verfahren vorgestellt, das schneller arbeitet und mit dessen Hilfe man noch mehr Informationen {ü}ber die Struktur eines Graphen gewinnen kann. In den folgenden Kapiteln werden Algorithmen vorgestellt, um minimale aufspannenden B{ä}ume, k{ü}rzeste Wege und maximale Fl{ü}sse in Graphen zu bestimmen. Am Ende des Skripts wird ein kurzer Einblick in die planaren Graphen und Graphhomomorphismen geboten.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...