Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings (Lecture Notes in Computer

Algorithm Theory - SWAT 2010: 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings (Lecture Notes in Computer

By: Haim Kaplan (editor)Paperback

2 - 4 weeks availability

£81.00 With FREE Saver Delivery


ThisvolumecontainsthepaperspresentedatSWAT2010,the12thScandinavian Symposium on Algorithm Theory. Since 1988 SWAT has been held biennially in the Nordic countries; it has a loose association with WADS (Workshop on Algorithms and Data Structures) that is held on odd-numbered years in North America. This 12th SWAT was held during June 21-23, at the University of Bergen in Norway. The conference focuses on algorithms and data structures. The call for - pers invited contributions in all areas of algorithms and data structures, incl- ing approximation algorithms, computational biology, computational geometry, distributedalgorithms,external-memoryalgorithms,graphalgorithms,online- gorithms, optimization algorithms, parallel algorithms, randomized algorithms, stringalgorithmsandalgorithmicgametheory.Atotalof78papersweresubm- ted,outofwhichtheProgramCommitteeselected36forpresentationatthes- posium.Inaddition,invitedlecturesweregivenbySanjeevArorafromPrinceton University, PrabhakarRaghavanfrom Yahoo! ResearchLabs, and Dana Randall from Georgia Institute of Technology. Wewouldliketo thankallthepeoplewho contributedto makingSWAT 2010 a success. In particular, we thank the Program Committee and all of our many colleagues who helped the committee evaluate the submissions. We also thank the NorwegianResearch Council and the University of Bergen for their support.

Create a review


Optimal Exploration of Terrains with Obstacles.- Reconstructing a Simple Polygon from Its Angles.- Semidefinite Programming and Approximation Algorithms: A Survey.- Strictly-Regular Number System and Data Structures.- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition.- A Bottom-Up Method and Fast Algorithms for max independent set.- Capacitated Domination Faster Than O(2 n ).- Isomorphism for Graphs of Bounded Feedback Vertex Set Number.- On Feedback Vertex Set New Measure and New Structures.- Conflict-Free Coloring Made Stronger.- Polychromatic Coloring for Half-Planes.- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem.- Minimum and Maximum against k Lies.- Feasible and Accurate Algorithms for Covering Semidefinite Programs.- The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms.- Systems of Linear Equations over and Problems Parameterized above Average.- Capacitated max -Batching with Interval Graph Compatibilities.- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.- Representing a Functional Curve by Curves with Fewer Peaks.- Bregman Clustering for Separable Instances.- Improved Methods For Generating Quasi-gray Codes.- The MST of Symmetric Disk Graphs Is Light.- Vector Bin Packing with Multiple-Choice.- Bin Packing with Fixed Number of Bins Revisited.- Cops and Robber Game without Recharging.- Path Schematization for Route Sketches.- Approximation Algorithms for Free-Label Maximization.- Phase Transitions in Sampling Algorithms and the Underlying Random Structures.- Polynomial Kernels for Hard Problems on Disk Graphs.- Faster Parameterized Algorithms for Minor Containment.- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.- Online Function Tracking with Generalized Penalties.- Better Bounds on Online Unit Clustering.- Online Selection of Intervals and t-Intervals.- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph.- Improved Algorithm for Degree Bounded Survivable Network Design Problem.- Minimizing the Diameter of a Network Using Shortcut Edges.

Product Details

  • publication date: 09/06/2010
  • ISBN13: 9783642137303
  • Format: Paperback
  • Number Of Pages: 448
  • ID: 9783642137303
  • weight: 658
  • ISBN10: 364213730X

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly