Design and Analysis of Algorithms
Springer Berlin (Verlag)
978-3-642-34861-7 (ISBN)
The 18 papers presented were carefully reviewed and selected from 44 submissions. The conference papers focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. Topics covered include: communications networks, combinatorial optimization and approximation, parallel and distributed computing, computer systems and architecture, economics, game theory, social networks and the World Wide Web.
Detecting Approximate Periodic Patterns.- Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication.- Multicast Routing for Energy Minimization Using Speed Scaling.- Reoptimization of the Minimum Total Flow-Time Scheduling Problem.- Energy Efficient Caching for Phase-Change Memory.- Shortest-Elapsed-Time-First on a Multiprocessor Efficient Route Compression for Hybrid Route Planning.- Multipath Spanners via Fault-Tolerant Spanners.- Constant Thresholds Can Make Target Set Selection Tractable.- Faster Variance Computation for Patterns with Gaps.- Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks.- Experimental Analysis of Rumor Spreading in Social Networks.- A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs.- Simulation-Based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks.- An Efficient Generator for Clustered Dynamic Random Networks.- Slow Down and Sleep for Profit in Online Deadline Scheduling.- FIFO Queueing Policies for Packets with Heterogeneous Processing.- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability.
| Erscheint lt. Verlag | 21.10.2012 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 261 p. 40 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 421 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • data structures • Dynamic Networks • Graphs • periodic patterns • Routing • Scheduling |
| ISBN-10 | 3-642-34861-0 / 3642348610 |
| ISBN-13 | 978-3-642-34861-7 / 9783642348617 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
