This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.
"synopsis" may belong to another edition of this title.
This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The 36 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 154 submissions. The papers address all issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, etc.
"About this title" may belong to another edition of this title.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540357537_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783540357537
Quantity: 10 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 5907005-n
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 5907005-n
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more. 452 pp. Englisch. Seller Inventory # 9783540357537
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 452. Seller Inventory # 263061475
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 452 Illus. Seller Inventory # 5835068
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 452. Seller Inventory # 183061481
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006Includes 36 revised full papers presented together with 3 invited papersAddresses issues of theoretical algorithmics and applications in various fieldsTh. Seller Inventory # 4888282
Quantity: Over 20 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Papers.- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily).- Results and Problems on Self-adjusting Search Trees and Related Data Structures.- Classic and Quantum Network Coding.- Contributed Papers.- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.- Scheduling Jobs on Grid Processors.- Variable Sized Online Interval Coloring with Bandwidth.- A Simpler Linear-Time Recognition of Circular-Arc Graphs.- An Algorithm for Online Topological Ordering.- Dynamic Matching Markets and Voting Paths.- Sorting by Merging or Merging by Sorting .- Finding the Position of the k-Mismatch and Approximate Tandem Repeats.- Unbiased Matrix Rounding.- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.- Paging with Request Sets.- Decentralization and Mechanism Design for Online Machine Scheduling.- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.- Exact Computation of Maximum Induced Forest.- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.- On the Approximation Hardness of Some Generalizations of TSP.- Reoptimization of Minimum and Maximum Traveling Salesman's Tours.- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.- On Guarding Rectilinear Domains.- Approximation Algorithms for the Minimum Convex Partition Problem.- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.- Simultaneous Embedding with Two Bends per Edge in Polynomial Area.- Acyclic Orientation of Drawings.- Improved Algorithms for Quantum Identification of Boolean Oracles.- Approximability of Minimum AND-Circuits.- Triangles, 4-Cycles and Parameterized (In-)Tractability.- Better ApproximationSchemes for Disk Graphs.- An Approximation Algorithm for the Wireless Gathering Problem.- Minimum Membership Set Covering and the Consecutive Ones Property.- Approximating Rational Objectives Is as Easy as Approximating Linear Ones.- In-Place Algorithms for Computing (Layers of) Maxima.- Largest and Smallest Tours and Convex Hulls for Imprecise Points.- On Spanners of Geometric Graphs.- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.- Linear-Time Algorithms for Tree Root Problems.- Generalized Powers of Graphs and Their Algorithmic Use.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 452 pp. Englisch. Seller Inventory # 9783540357537