Muutke küpsiste eelistusi

E-raamat: Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings

Edited by , Edited by
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 3111
  • Ilmumisaeg: 08-Jun-2004
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783540278108
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 3111
  • Ilmumisaeg: 08-Jun-2004
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783540278108
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This volume contains the papers presented at SWAT 2004, the 9th Scandi- vian Workshop on Algorithm Theory, which was held on July 8-10, 2004, at the Louisiana Museum of Modern Art in Humlebaek on the Oresund coast north of Copenhagen. The SWAT workshop, in reality a full- edged conference, has been held biennially since 1988 and rotates among the ?ve Nordic countries, D- mark, Finland, Iceland, Norway, and Sweden. The previous meetings took place ? in Halmstad (1988), Bergen (1990), Helsinki (1992), Arhus (1994), Reykjavik (1996), Stockholm (1998), Bergen (2000), and Turku (2002). SWAT alternates with the Workshop on Algorithms and Data Structures (WADS), held in o- numbered years. Thecallforpapersinvitedcontributionsonallaspectsofalgorithmtheory.A totalof121submissionswasreceived-anoverallSWAThigh.Theseunderwent thorough reviewing, and the program committee met in Copenhagen on March 20-21, 2004, and selected 40 papers for presentation at the conference. The programcommitteewasimpressedwiththequalityofthesubmissionsand,given the constraints imposed by the choice of conference venue and duration, had to make some tough decisions. The scienti c program was enriched by invited presentations by Gerth Stolting Brodal (University of Aarhus) and Charles E. Leiserson (Massachusetts Institute of Technology). TwosatelliteeventswereheldimmediatelybeforeSWAT2004:theWorkshop on On-Line Algorithms (OLA 2004), organized by members of the Department of Mathematics and Computer Science at the University of Southern Denmark, and the Summer School on Experimental Algorithmics, organized by the Perf- mance Engineering Laboratory in the Department of Computing at the Univ- sity of Copenhagen. More information about SWAT 2004 and its satellite events is available at the conference web sitehttp://swat.diku.dk/.

Muu info

Springer Book Archives
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.