Afbeelding 1 van 1

Galerij
Afbeelding 1 van 1

Hebt u iets om te verkopen?
Algorithms - ESA 2001, Lecture Notes in Computer Science Ser., 9th Annual Europ
US $70,00
OngeveerEUR 60,20
of Beste voorstel
Objectstaat:
“Both soft cover and all pages in perfect condition.”
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Verzendkosten:
US $25,00 (ongeveer EUR 21,50) Standard Shipping from outside US.
Bevindt zich in: Hornbæk, Denemarken
Levering:
Geschatte levering tussen di, 4 nov en di, 18 nov tot 94104
Retourbeleid:
14 dagen om te retourneren. Koper betaalt voor retourzending Als u een eBay-verzendlabel gebruikt, wordt dit in mindering gebracht op het terugbetalingsbedrag.
Betalingen:
Winkel met vertrouwen
De verkoper neemt de volledige verantwoordelijkheid voor deze aanbieding.
eBay-objectnummer:374329748082
Specificaties
- Objectstaat
- Vrijwel nieuw
- Opmerkingen van verkoper
- “Both soft cover and all pages in perfect condition.”
- Country/Region of Manufacture
- Germany
- Educational Level
- Adult & Further Education
- Level
- Advanced, Technical
- ISBN
- 9783540424932
Over dit product
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540424938
ISBN-13
9783540424932
eBay Product ID (ePID)
1935261
Product Key Features
Number of Pages
Xii, 544 Pages
Language
English
Publication Name
Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
Publication Year
2001
Subject
Programming / General, Programming / Algorithms, Computer Science
Type
Textbook
Subject Area
Computers
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback
Dimensions
Item Weight
32.9 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2001-045764
Dewey Edition
21
Series Volume Number
2161
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
005.1
Table Of Content
Invited Talks.- External Memory Data Structures.- Some Algorithmic Problems in Large Networks.- Exact and Approximate Distances in Graphs -- A Survey.- Caching and Prefetching.- Strongly Competitive Algorithms for Caching with Pipelined Prefetching.- Duality between Prefetching and Queued Writing with Parallel Disks.- Online Algorithms.- Online Bin Coloring.- A General Decomposition Theorem for the k-Server Problem.- Buying a Constant Competitive Ratio for Paging.- Data Structures I.- Simple Minimal Perfect Hashing in Less Space.- Cuckoo Hashing.- Optimization and Approximation.- Coupling Variable Fixing Algorithms for the Automatic Recording Problem.- Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints.- On the Approximability of the Minimum Test Collection Problem.- Sequences.- Finding Approximate Repetitions under Hamming Distance.- SNPs Problems, Complexity, and Algorithms.- Scheduling.- A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.- Grouping Techniques for Scheduling Problems: Simpler and Faster.- A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.- Shortest Paths.- A Simple Shortest Path Algorithm with Linear Average Time.- A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.- Geometry I.- A Separation Bound for Real Algebraic Expressions.- Property Testing with Geometric Queries.- Smallest Color-Spanning Objects.- Data Structures II.- Explicit Deterministic Constructions for Membership in the Bitprobe Model.- Lossy Dictionaries.- Geometry II.- Splitting a Delaunay Triangulation in Linear Time.- A Fast Algorithm for Approximating the Detour of a Polygonal Chain.- An ApproximationAlgorithm for Minimum Convex Cover with Logarithmic Performance Guarantee.- Distributed Algorithms.- Distributed O(? log n)-Edge-Coloring Algorithm.- Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation.- Graph Algorithms.- Computing Cycle Covers without Short Cycles.- A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.- Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows.- Pricing.- Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options.- Competitive Auctions for Multiple Digital Goods.- Broadcasting and Multicasting.- Algorithms for Efficient Filtering in Content-Based Multicast.- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.- Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.- Graph Labeling and Graph Drawing.- Online and Offline Distance Constrained Labeling of Disk Graphs.- Approximate Distance Labeling Schemes.- On the Parameterized Complexity of Layered Graph Drawing.- Graphs.- A General Model of Undirected Web Graphs.- Packing Cycles and Cuts in Undirected Graphs.- Greedy Algorithms for Minimisation Problems in Random Regular Graphs.
Synopsis
This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.
LC Classification Number
QA76.6-76.66
Objectbeschrijving van de verkoper
Over deze verkoper
bookgate
100% positieve feedback•29 objecten verkocht
Geregistreerd als particuliere verkoperDus de consumentenrechten die voortvloeien uit EU-wetgeving voor consumentenbescherming zijn niet van toepassing. eBay-kopersbescherming geldt nog steeds voor de meeste aankopen.
Feedback verkoper (13)
- k***o (52)- Feedback gegeven door koper.Afgelopen 6 maandenGeverifieerde aankoopFast shipping, item as described, meticulous packaging. Excellent service, thank you!
- a***m (0)- Feedback gegeven door koper.Vorig jaarGeverifieerde aankoopEverything went great, very well packaged! The book is absolutely like new, as mentioned. Good quality and trustworthyAlgorithms in C, Parts 1-4: Fundamentals, Data Structures, ... (#375633855991)
- _***2 (141)- Feedback gegeven door koper.Vorig jaarGeverifieerde aankoopGOOD SELLER. THANKS!Antwoord van: bookgate- Feedback beantwoord door verkoper bookgate.- Feedback beantwoord door verkoper bookgate.Prompt payment, perfect transaction!Manifolds, Tensor Analysis, and Applications (#374716469808)