Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference Scandinavian Workshop on Algorithm Theory (14th : 2014 : Copenhagen, Denmark)
Title Algorithm theory-- SWAT 2014 : 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014 : proceedings / R. Ravi, Inge Li Grtz (Eds.).
Imprint Cham : Springer, [2014]

View online
View online
Conference Scandinavian Workshop on Algorithm Theory (14th : 2014 : Copenhagen, Denmark)
Series Lecture Notes in Computer Science, 0302-9743 ; 8503
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 8503. 1611-3349
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject Computer algorithms -- Congresses.
Data structures (Computer science) -- Congresses.
Alt Name Ravi, R. (Ramamoorthi), 1969-
Grtz, Inge Li,
Add Title SWAT 2014
Description 1 online resource.
Note International conference proceedings.
Includes author index.
Summary This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms, and algorithmic game theory.
Contents Online Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size [Omega](log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs.
Note Online resource; title from PDF title page (SpringerLink, viewed July 7, 2014).
ISBN 9783319084046 (electronic bk.)
3319084046 (electronic bk.)
9783319084039 (print)
3319084038 (print)
ISBN/ISSN 10.1007/978-3-319-08404-6
OCLC # 882247905
Additional Format Printed edition: 9783319084039

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team