07837nam 22008175 450 991076752960332120200629221617.03-540-27810-910.1007/b98413(CKB)1000000000212447(DE-He213)978-3-540-27810-8(SSID)ssj0000101066(PQKBManifestationID)11108836(PQKBTitleCode)TC0000101066(PQKBWorkID)10037368(PQKB)10066096(MiAaPQ)EBC3087237(PPN)155217623(EXLCZ)99100000000021244720121227d2004 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierAlgorithm Theory - SWAT 2004 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings /edited by Torben Hagerup, Jyrki Katajainen1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (XII, 512 p.) Lecture Notes in Computer Science,0302-9743 ;3111Bibliographic Level Mode of Issuance: Monograph3-540-22339-8 Includes bibliographical references at the end of each chapters and index.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.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 Humlebæk on the Øresund 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 Stølting 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/.Lecture Notes in Computer Science,0302-9743 ;3111Numerical analysisMathematical modelsAlgorithmsComputer communication systemsData structures (Computer science)Computer science—MathematicsNumerical Analysishttps://scigraph.springernature.com/ontologies/product-market-codes/M14050Mathematical Modeling and Industrial Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M14068Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Numerical analysis.Mathematical models.Algorithms.Computer communication systems.Data structures (Computer science).Computer science—Mathematics.Numerical Analysis.Mathematical Modeling and Industrial Mathematics.Algorithm Analysis and Problem Complexity.Computer Communication Networks.Data Structures.Discrete Mathematics in Computer Science.518/.1Hagerup Torbenedthttp://id.loc.gov/vocabulary/relators/edtKatajainen Jyrkiedthttp://id.loc.gov/vocabulary/relators/edtScandinavian Workshop on Algorithm TheoryMiAaPQMiAaPQMiAaPQBOOK9910767529603321Algorithm Theory - SWAT 20042158509UNINA