04411nam 2200601 a 450 991048488310332120200520144314.03-540-35755-610.1007/11785293(CKB)1000000000233038(SSID)ssj0000316144(PQKBManifestationID)11275338(PQKBTitleCode)TC0000316144(PQKBWorkID)10264171(PQKB)11119856(DE-He213)978-3-540-35755-1(MiAaPQ)EBC3068120(PPN)123136407(EXLCZ)99100000000023303820060519d2006 uy 0engurnn#008mamaatxtccrAlgorithm theory -- SWAT 2006 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006 : proceedings /Lars Arge, Rusins Freivalds (eds.)1st ed. 2006.Berlin Springer20061 online resource (XII, 436 p.)Lecture notes in computer science,0302-9743 ;4059LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-35753-X Includes bibliographical references and index.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 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.Lecture notes in computer science ;4059.LNCS sublibrary.SL 1,Theoretical computer science and general issues.SWAT 2006AlgorithmsCongressesComputational complexityCongressesAlgorithmsComputational complexity511.8Arge L(Lars)1221979Freivald R. V1759808Scandinavian Workshop on Algorithm TheoryMiAaPQMiAaPQMiAaPQBOOK9910484883103321Algorithm theory -- SWAT 20064198460UNINA