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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783540357537_new
Cantidad disponible: Más de 20 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540357537
Cantidad disponible: 10 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 5907005-n
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540357537
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 5907005-n
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 452. Nº de ref. del artículo: 263061475
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 452 Illus. Nº de ref. del artículo: 5835068
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 452. Nº de ref. del artículo: 183061481
Cantidad disponible: 4 disponibles
Librería: moluna, Greven, Alemania
Condición: 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. Nº de ref. del artículo: 4888282
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783540357537
Cantidad disponible: 1 disponibles