LEADER 05023nam  22007455  450 
001 9910484883103321
005 20230405233732.0
010   $a3-540-35755-6
024 7 $a10.1007/11785293
035   $a(CKB)1000000000233038
035   $a(SSID)ssj0000316144
035   $a(PQKBManifestationID)11275338
035   $a(PQKBTitleCode)TC0000316144
035   $a(PQKBWorkID)10264171
035   $a(PQKB)11119856
035   $a(DE-He213)978-3-540-35755-1
035   $a(MiAaPQ)EBC3068120
035   $a(PPN)123136407
035   $a(EXLCZ)991000000000233038
100   $a20100301d2006      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgorithm Theory - SWAT 2006 $e10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings /$fedited by Lars Arge, Rusins Freivalds
205   $a1st ed. 2006.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006.
215   $a1 online resource (XII, 436 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4059
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-35753-X 
320   $aIncludes bibliographical references and index.
327   $aInvited 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 Approximation Schemes 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4059
606   $aAlgorithms
606   $aComputer networks
606   $aArtificial intelligence?Data processing
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer graphics
606   $aAlgorithms
606   $aComputer Communication Networks
606   $aData Science
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Graphics
615  0$aAlgorithms.
615  0$aComputer networks.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer graphics.
615 14$aAlgorithms.
615 24$aComputer Communication Networks.
615 24$aData Science.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Graphics.
676   $a511.8
702   $aArge$b Lars$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aFreivalds$b Rusins$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aScandinavian Workshop on Algorithm Theory
906   $aBOOK
912   $a9910484883103321
996   $aAlgorithm Theory – SWAT 2006$9772401
997   $aUNINA