Algorithm theory : proceedings
User Rating: Be the first one!
Author: Arnborg, Stefan, Karlsson, Rolf, Schmidt, Erik Meineche, SWAT
Added by: sketch
Added Date: 2015-12-30
Language: eng
Publishers: Berlin [u.a.] : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540676902, 9783540676904
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 283.78 MB
PDF Size: 5.86 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 236
Views: 286
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44985 X archive t...torrent
Last Modified: 2022-03-09 10:25:44
Download
Size: 15.19 KB
Description
Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 Proceedings
Author:
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67690-4
DOI: 10.1007/3-540-44985-X
Table of Contents:
Author:
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67690-4
DOI: 10.1007/3-540-44985-X
Table of Contents:
- Dynamic Graph Algorithms with Applications
- Coping with the NP-Hardness of the Graph Bandwidth Problem
- Toward Complete Genome Data Mining in Computational Biology
- A New Trade-Off for Deterministic Dictionaries
- Improved Upper Bounds for Pairing Heaps
- Maintaining Center and Median in Dynamic Trees
- Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time
- A Dynamic Algorithm for Maintaining Graph Partitions
- Data Structures for Maintaining Set Partitions
- Fixed Parameter Algorithms for Planar Dominating Set and Related Problems
- Embeddings of k-Connected Graphs of Pathwidth k
- On Graph Powers for Leaf-Labeled Trees
- Recognizing Weakly Triangulated Graphs by Edge Separability
- Caching for Web Searching
- On-Line Scheduling with Precedence Constraints
- Scheduling Jobs Before Shut-Down
- Resource Augmentation in Load Balancing
- Fair versus Unrestricted Bin Packing
- A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
- Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems
You May Also Like
We will be happy to hear your thoughts