|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-35755-1 |
| 003 |
DE-He213 |
| 005 |
20230405233732.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540357551
|9 978-3-540-35755-1
|
| 024 |
7 |
|
|a 10.1007/11785293
|2 doi
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 082 |
0 |
4 |
|a 518.1
|2 23
|
| 245 |
1 |
0 |
|a Algorithm Theory - SWAT 2006
|h [electronic resource] :
|b 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings /
|c edited by Lars Arge, Rusins Freivalds.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 436 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4059
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 700 |
1 |
|
|a Arge, Lars.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Freivalds, Rusins.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540826132
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540357537
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4059
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11785293
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
