Algorithms ESA '99 : 7th annual European symposium, Prague, Czech Republic, July 16 18, 1999 : proceedings
User Rating: Be the first one!
Author: ESA '99 (1999 : Prague, Czech Republic), Nešetřil, Jaroslav
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer algorithms
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540662510
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 318.62 MB
PDF Size: 7.06 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 724
Views: 774
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 48481 7 archive t...torrent
Last Modified: 2022-03-09 10:25:25
Download
Size: 16.56 KB
Description
Algorithms - ESA’ 99: 7th Annual European Symposium Prague, Czech Republic, July 16–18, 1999 Proceedings
Author: Jaroslav Nešetřil
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66251-8
DOI: 10.1007/3-540-48481-7
Table of Contents:
Includes bibliographical references
Author: Jaroslav Nešetřil
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66251-8
DOI: 10.1007/3-540-48481-7
Table of Contents:
- ESA’99 Program
- Adaptively-Secure Distributed Public-Key Systems
- How Long Does a Bit Live in a Computer?
- Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design
- The Impact of Knowledge on Broadcasting Time in Radio Networks
- Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
- IP Address LookupMade Fast and Simple
- On-Line Load Balancing in a Hierarchical Server Topology
- Provably Good and Practical Strategies for Non-uniform Data Management in Networks
- Approximation Algorithms for Restoration Capacity Planning
- Efficient Algorithms for Integer Programs with Two Variables per Constraint
- Convex Quadratic Programming Relaxations for Network Scheduling Problems
- Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems
- Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
- Off-Line Temporary Tasks Assignment
- Load Balancing Using Bisectors — A Tight Average-Case Analysis
- On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help
- Motif Statistics
- Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract)
- On Constructing Suffix Arrays in External Memory
Includes bibliographical references
You May Also Like
We will be happy to hear your thoughts