My Wish Lists Login / Join

Experimental Algorithms : 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings - Camil Demetrescu

Instant online reading.
Don't wait for delivery!

Experimental Algorithms

6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings

By: Camil Demetrescu (Editor)

Write A Review

Paperback | 25 May 2007

At a Glance

Paperback
468 Pages

Dimensions(cm)
22.86 x 15.24 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007.

The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Computer Science Graphical & Digital Media Applications Software Engineering Mathematics Applied Mathematics Databases Data Mining

An alternative ranking problem for search engines	p. 1
Engineering fast route planning algorithms	p. 23
Random models for geometric graphs	p. 37
Better landmarks within reach	p. 38
Landmark-based routing in dynamic graphs	p. 52
Dynamic highway-node routing	p. 66
Dynamic trees in practice	p. 80
On the cost of persistence and authentication in skip lists	p. 94
Cache-, hash- and space-efficient bloom filters	p. 108
Crossing minimization in weighted bipartite graphs	p. 122
Fast minimum-weight double-tree shortcutting for metric TSP	p. 136
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem	p. 150
Simple and efficient geographic routing around obstacles for wireless sensor networks	p. 161
A distributed primal-dual heuristic for Steiner problems in networks	p. 175
An experimental study of stability in heterogeneous networks	p. 189
Simple compression code supporting random access and fast string matching	p. 203
Engineering a compressed suffix tree implementation	p. 217
Simple space-time trade-offs for AESA	p. 229
Engineering algorithms for approximate weighted matching	p. 242
Experimental evaluation of parametric max-flow algorithms	p. 256
Experimental study of geometric t-spanners : a running time comparison	p. 270
Vertex cover approximations on random graphs	p. 285
Optimal edge deletions for signed graph balancing	p. 297
Algorithms for the balanced edge partitioning problem	p. 311
Experimental evaluations of algorithms for IP table minimization	p. 324
Algorithms for longer OLED lifetime	p. 338
Improving tree search in phylogenetic reconstruction from genome rearrangement data	p. 352
Benchmarks for strictly fundamental cycle bases	p. 365
A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem	p. 379
Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights	p. 393
An efficient implementation for the 0-1 multi-objective knapsack problem	p. 406
Trunk packing revisited	p. 420
Exact algorithms for the matrix bid auction	p. 433
Table of Contents provided by Blackwell. All Rights Reserved.

Experimental Algorithms

6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Algorithms & Data Structures

Cognitive Fairness-Aware Techniques for Human-Machine Interface

Chapman & Hall/CRC Internet of Things

Constraints and Advanced Solutions for LTE-Advanced Heterogeneous Networks

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Heuristic Algorithms Design

A Methodological Approach

Artificial Intelligence Programming with Python

From Zero to Hero

Addiction by Design

Machine Gambling in Las Vegas

Introduction to Machine Learning with Python

A Guide for Data Scientists

Code Dependent

Living in the Shadow of AI - Shortlisted for the Women's Prize for Non-Fiction

Learning Spark

Lightning-Fast Data Analytics

Python for Algorithmic Trading

From Idea to Cloud Deployment

Robot Automation

Principle, Design and Applications

Considerations on the AI Endgame

Ethics, Risks and Computational Frameworks

Quick Data Structures

Quick Programming

Data Science and Machine Learning for Non-Programmers

Using SAS Enterprise Miner

Ethics and Governance of Artificial Intelligence

Frameworks, Risks, and Society

Ethics and Governance of Artificial Intelligence

Frameworks, Risks, and Society

Computer Science Why

Answers to Computer Science Questions They Don't Cover in Class

Computer Science Why

Answers to Computer Science Questions They Don't Cover in Class

Applied Data Science in FinTech

Models, Tools, and Case Studies

Applied Data Science in FinTech

Models, Tools, and Case Studies

Bioengineering and IoT

Shaping the Future of Healthcare

Tiny Machine Learning Techniques for Constrained Devices

New Storytelling

Learning through Metaphors

BioMed Bots Assurance

Securing Robotics, Healthcare, and IT Convergence

This product is categorised by