Tools

LEADER 07760cam 2200877 i 4500

001 ocm50091538;

003 OCoLC;

005 20260420152354.0;

008 020628s2002 gw a b 101 0 eng d;

015 a| GBA2492122| bnb;

015 a| 02,N27,03612| dnb;

016 7 a| 9645110372| DE-101;

016 7 a| 0066146362| Uk;

016 7 a| 35404386612| Uk;

019 a| 496298743a| 518794574a| 640537243a| 960141098a| 1169846520a| 1171136901a| 1225767173;

020 a| 3540438661q| (pbk.);

020 a| 9783540438663q| (pbk.);

024 3 a| 9783540438663;

035 a| (Sirsi) o50091538;

049 a| EREE;

050 4 a| QA9.58b| .S28 2002;

050 4 a| QA76b| .L47 no.2368;

072 7 a| QA2| lcco;

082 04 a| 511.82| 211| https://id.oclc.org/worldcat/ddc/E3m8CBBdxWbDHbRCxh7hcH77Xf;

084 a| 54.102| bcl;

111 2 a| Scandinavian Workshop on Algorithm Theoryn| (8th :d| 2002 :c| Turku, Finland),j| author,j| host institution.;

245 10 a| Algorithm theory--SWAT 2002 :b| 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings /c| Martti Penttonen, Erik Meineche Schmidt (eds.).;

246 30 a| SWAT 2002;

246 30 a| 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 :b| proceedings;

246 3 a| Eighths Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 :b| proceedings;

264 1 a| Berlin :b| Springer,c| 2002.;

300 a| xiv, 450 pages :b| illustrations ;c| 24 cm.;

336 a| textb| txt2| rdacontent;

337 a| unmediatedb| n2| rdamedia;

338 a| volumeb| nc2| rdacarrier;

490 1 a| Lecture notes in computer science,x| 0302-9743 ;v| 2368;

500 a| Internat. conference proceedings.;

530 a| Also available via the World Wide Web.;

504 a| Includes bibliographical references.;

506 a| Also available via the World Wide Web.;

505 0 a| Invited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model -- ?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees.;

650 0 a| Algorithmsv| Congresses.;

650 0 a| Computational complexityv| Congresses.;

650 7 a| Algorithms.2| fast0| (OCoLC)fst00805020;

650 7 a| Computational complexity.2| fast0| (OCoLC)fst00871991;

650 7 a| Berechnungskomplexität.2| gnd0| (DE-588)4134751-1;

650 7 a| Datenstruktur.2| gnd0| (DE-588)4011146-5;

650 7 a| Algorithmentheorie.2| gnd0| (DE-588)4200409-3;

650 7 a| Algorithmus.2| gnd0| (DE-588)4001183-5;

650 17 a| Fundamentele informatica.2| gtt;

650 17 a| Algoritmen.2| gtt;

650 7 a| Algorithmsv| Congresses.2| nli;

650 7 a| Algorithmesx| Congrès.2| ram;

650 7 a| Complexité de calcul (informatique)x| Congrès.2| ram;

651 7 a| Turku <2002>.2| swd;

655 7 a| Conference papers and proceedings.2| fast0| (OCoLC)fst01423772;

700 1 a| Penttonen, Martti,d| 1948-e| editor.1| https://id.oclc.org/worldcat/entity/E39PBJqQCB7kJPM3Ft98KhttKd;

758 i| has work:a| Algorithm theory-AT 2002 (Text)1| https://id.oclc.org/worldcat/entity/E39PCFM9FhqVxPH7w6PKQxdXJP4| https://id.oclc.org/worldcat/ontology/hasWork;

830 0 a| Lecture notes in computer science ;v| 2368.;

856 41 3| SpringerLinku| https://doi.org/10.1007/3-540-45471-3;

856 41 3| Table of contentsu| http://swbplus.bsz-bw.de/bsz099471175inh.htm;

856 41 u| http://link.springer-ny.com/link/service/series/0558/tocs/t2368.htmz| Restricted to Springer LINK subscribers;

856 41 u| http://link.springer.com/10.1007/3-540-45471-3z| eBook available for UOIT via SpringerLink. Click link to access;

856 41 u| http://www.link.springer.de/link/service/series/0558/tocs/t2368.htm;

856 4 3| Coveru| http://swbplus.bsz-bw.de/bsz099471175cov.htm;

856 4 3| Kapitel 1u| http://swbplus.bsz-bw.de/bsz099471175kap.htm;

938 a| Ingram Library Servicesb| INGRn| in500372811;

938 a| Brodartb| BRODn| 59719990c| $73.00;

938 a| Otto Harrassowitzb| HARRn| har025019322;

994 a| C0b| ERE;

596 a| 1;

998 a| 890086;

999 a| QA9.58 .S28 2002w| LCc| 1i| 30372011816342d| 1/31/2013e| 4/16/2004l| JGESm| JOYNERn| 1p| $69.35q| 1r| Ys| Yt| JGESBKu| 10/25/2002x| BOOKz| JSTACKSo| .STAFF. 0;

Algorithm theory--SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings / Martti Penttonen, Erik Meineche Schmidt (eds.).

Author/creator	Scandinavian Workshop on Algorithm Theory
Other author	Penttonen, Martti, 1948- editor.
Other author	Schmidt, E. M. (Erik Meineche), 1945- editor.
Format	Book
Publication	Berlin : Springer, 2002.
Description	xiv, 450 pages : illustrations ; 24 cm.
Supplemental Content	SpringerLink
Supplemental Content	Table of contents
Supplemental Content	Restricted to Springer LINK subscribers
Supplemental Content	eBook available for UOIT via SpringerLink. Click link to access
Supplemental Content	http://www.link.springer.de/link/service/series/0558/tocs/t2368.htm
Supplemental Content	Cover
Supplemental Content	Kapitel 1
Subjects	Algorithms--Congresses. Computational complexity--Congresses.

Portion of title	SWAT 2002
Portion of title	8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings
Variant title	Eighths Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings
Series	Lecture notes in computer science, 0302-9743 ; 2368 Lecture notes in computer science ; 2368.
Contents	Invited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model -- ?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees.
General note	Internat. conference proceedings.
Bibliography note	Includes bibliographical references.
Access restriction	Also available via the World Wide Web.
Other forms	Also available via the World Wide Web.
Genre/form	Conference papers and proceedings.
ISBN	3540438661 (pbk.)
ISBN	9783540438663 (pbk.)
Standard identifier#	9783540438663

Algorithm theory--SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings / Martti Penttonen, Erik Meineche Schmidt (eds.).

Click here for more information about this title