X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Buch
    Buch
    Algorithm theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8 - 10, 2004 ; proceedings (2004)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almahu_BV019362752
    Umfang: XI, 506 S. : , Ill., graph. Darst.
    ISBN: 3-540-22339-8
    Serie: Lecture notes in computer science 3111
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    SS 4800
    Schlagwort(e): Algorithmentheorie ; Algorithmus ; Berechnungskomplexität ; Datenstruktur ; Algorithmische Geometrie ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    URL: Einführung/Vorwort
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    URL: http://www.loc.gov/catdir/enhancements/fy0818/2004107864-d.html
    URL: Online Access
    Mehr zum Autor: Hagerup, Torben, ca. 20. / 21. Jh.
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    HU Berlin get availability status
    FU Berlin get availability status
    UB Potsdam get availability status
  • 2
    Online-Ressource
    Online-Ressource
    Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920589102882
    Umfang: XII, 512 p. , online resource.
    ISBN: 9783540278108
    Serie: Lecture Notes in Computer Science, 3111
    Anmerkung: Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )–Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540223399
    Sprache: Englisch
    DOI: 10.1007/b98413
    URL: http://dx.doi.org/10.1007/b98413
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 3
    Online-Ressource
    Online-Ressource
    Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings (2004)
    Berlin : Springer
    Details
    UID:
    gbv_749125195
    Umfang: Online-Ressource (XI, 506 p. Also available online) , digital
    Ausgabe: Springer eBook Collection. Computer Science
    ISBN: 9783540278108 , 3540223398 , 9783540223399
    Serie: Lecture Notes in Computer Science 3111
    Inhalt: This book constitutes the refereed proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, held in Humlebaek, Denmark in July 2004. The 40 revised full papers presented together with an invited paper and the abstract of an invited talk were carefully reviewed and selected from 121 submissions. The papers span the entire range of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, bioinformatics, combinatorics, sorting, searching, online algorithms, optimization, etc
    Weitere Ausg.: ISBN 9783540223399
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783662209110
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783540223399
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    SS 4800
    DOI: 10.1007/b98413
    URL: lizenzpflichtig
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltstext
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Online Zugang
    Open Access Wunsch
    UB Potsdam
  • 4
    Online-Ressource
    Online-Ressource
    Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings (2004)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621580602882
    Umfang: XII, 512 p. , online resource.
    Ausgabe: 1st ed. 2004.
    ISBN: 9783540278108
    Serie: Lecture Notes in Computer Science, 3111
    Anmerkung: Invited Contributions -- Design and Analysis of Dynamic Multithreaded Algorithms -- Cache-Oblivious Algorithms and Data Structures -- Refereed Contributions -- Getting the Best Response for Your Erg -- Auctions with Budget Constraints -- Tight Approximability Results for Test Set Problems in Bioinformatics -- Robust Subgraphs for Trees and Paths -- Collective Tree Spanners of Graphs -- Optimally Competitive List Batching -- The Relative Worst Order Ratio Applied to Seat Reservation -- Online Maintenance of k-Medians and k-Covers on a Line -- Matching Polyhedral Terrains Using Overlays of Envelopes -- Independent Set of Intersection Graphs of Convex Objects in 2D -- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion -- Construction of the Nearest Neighbor Embracing Graph of a Point Set -- Connectivity of Graphs Under Edge Flips -- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity -- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension -- Railway Delay Management: Exploring Its Algorithmic Complexity -- Layered Heaps -- Melding Priority Queues -- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs -- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices -- New Algorithms for Enumerating All Maximal Cliques -- The Multi-multiway Cut Problem -- The Bottleneck Problem with Minimum Quantity Commitments -- All-Norm Approximation for Scheduling on Identical Machines -- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler -- Approximation Schemes for the Crane Scheduling Problem -- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems -- A ( )-Approximation Algorithm for the Stable Marriage Problem -- Maximizing the Number of Packed Rectangles -- Two Space Saving Tricks for Linear Time LCP Array Computation -- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles -- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks -- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks -- The Optimal Online Algorithms for Minimizing Maximum Lateness -- Power Assignment in Radio Networks with Two Power Levels -- Pointed Binary Encompassing Trees -- On Geometric Structure of Global Roundings for Graphs and Range Spaces -- External Connected Components -- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths -- Simplified External Memory Algorithms for Planar DAGs.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662209110
    Weitere Ausg.: Printed edition: ISBN 9783540223399
    Sprache: Englisch
    DOI: 10.1007/b98413
    URL: https://doi.org/10.1007/b98413
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    HU Berlin
  • 5
    Buch
    Buch
    Algorithm theory : proceedings (2004)
    Berlin : Springer-Verlag
    Details
    UID:
    kobvindex_ZLB13765727
    Umfang: XI, 506 Seiten , graph. Darst. , 24 cm
    Ausgabe: 1
    ISBN: 3540223398
    Serie: Lecture notes in computer science 3111
    Anmerkung: Literaturangaben , Text engl.
    Sprache: Englisch
    Schlagwort(e): Algorithmentheorie ; Kongress ; Humlebaek 〈2004〉 ; Algorithmus ; Berechnungskomplexität ; Datenstruktur ; Kongress ; Humlebaek 〈2004〉 ; Algorithmische Geometrie ; Kongress ; Humlebaek 〈2004〉 ; Kongress ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Buch
    Berlin VÖBB/ZLB get availability status
Nichts oder nicht das Richtige gefunden? Bitte überprüfen Sie Ihre Suchanfrage oder benutzen Sie den Fernleihindex.
Meinten Sie 9783540203599?
Meinten Sie 9783540123309?
Meinten Sie 9783540220299?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz