Coverart for item
The Resource Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings, Camil Demetrescu (ed.), (electronic book)

Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings, Camil Demetrescu (ed.), (electronic book)

Label
Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings
Title
Experimental algorithms
Title remainder
6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings
Statement of responsibility
Camil Demetrescu (ed.)
Title variation
WEA 2007
Creator
Contributor
Subject
Genre
Language
eng
Summary
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
Member of
Cataloging source
GW5XE
Dewey number
005.1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
W43 2007eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2007
http://bibfra.me/vocab/lite/meetingName
WEA (Workshop)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Demetrescu, Camil.
Series statement
  • Lecture notes in computer science
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
4525
http://library.link/vocab/subjectName
Computer algorithms
Label
Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings, Camil Demetrescu (ed.), (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Lectures -- An Alternative Ranking Problem for Search Engines -- Engineering Fast Route Planning Algorithms -- Random Models for Geometric Graphs (Abstract) -- Session 1 (Route Planning) -- Better Landmarks Within Reach -- Landmark-Based Routing in Dynamic Graphs -- Dynamic Highway-Node Routing -- Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters) -- Dynamic Trees in Practice -- On the Cost of Persistence and Authentication in Skip Lists -- Cache-, Hash- and Space-Efficient Bloom Filters -- Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing) -- Crossing Minimization in Weighted Bipartite Graphs -- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP -- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem -- Session 4 (Network Routing and Stability) -- Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks -- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks -- An Experimental Study of Stability in Heterogeneous Networks -- Session 5 (Strings and Range Searching) -- Simple Compression Code Supporting Random Access and Fast String Matching -- Engineering a Compressed Suffix Tree Implementation -- Simple Space-Time Trade-Offs for AESA -- Session 6 (Matching, Flows, and Spanners) -- Engineering Algorithms for Approximate Weighted Matching -- Experimental Evaluation of Parametric Max-Flow Algorithms -- Experimental Study of Geometric t-Spanners: A Running Time Comparison -- Session 7 (Covering, Coloring, and Partitioning) -- Vertex Cover Approximations on Random Graphs -- Optimal Edge Deletions for Signed Graph Balancing -- Algorithms for the Balanced Edge Partitioning Problem -- Session 8 (Applications) -- Experimental Evaluations of Algorithms for IP Table Minimization -- Algorithms for Longer OLED Lifetime -- Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data -- Session 9 (Spanning Trees) -- Benchmarks for Strictly Fundamental Cycle Bases -- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem -- Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights -- Session 10 (Packing and Auctions) -- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem -- Trunk Packing Revisited -- Exact Algorithms for the Matrix Bid Auction
Control code
SPR184904602
Dimensions
unknown
Extent
1 online resource (xiii, 448 pages)
Form of item
online
Isbn
9783540728450
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Specific material designation
remote
Label
Experimental algorithms : 6th international workshop, WEA 2007, Rome, Italy, June 6-8, 2007 : proceedings, Camil Demetrescu (ed.), (electronic book)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Lectures -- An Alternative Ranking Problem for Search Engines -- Engineering Fast Route Planning Algorithms -- Random Models for Geometric Graphs (Abstract) -- Session 1 (Route Planning) -- Better Landmarks Within Reach -- Landmark-Based Routing in Dynamic Graphs -- Dynamic Highway-Node Routing -- Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters) -- Dynamic Trees in Practice -- On the Cost of Persistence and Authentication in Skip Lists -- Cache-, Hash- and Space-Efficient Bloom Filters -- Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing) -- Crossing Minimization in Weighted Bipartite Graphs -- Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP -- A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem -- Session 4 (Network Routing and Stability) -- Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks -- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks -- An Experimental Study of Stability in Heterogeneous Networks -- Session 5 (Strings and Range Searching) -- Simple Compression Code Supporting Random Access and Fast String Matching -- Engineering a Compressed Suffix Tree Implementation -- Simple Space-Time Trade-Offs for AESA -- Session 6 (Matching, Flows, and Spanners) -- Engineering Algorithms for Approximate Weighted Matching -- Experimental Evaluation of Parametric Max-Flow Algorithms -- Experimental Study of Geometric t-Spanners: A Running Time Comparison -- Session 7 (Covering, Coloring, and Partitioning) -- Vertex Cover Approximations on Random Graphs -- Optimal Edge Deletions for Signed Graph Balancing -- Algorithms for the Balanced Edge Partitioning Problem -- Session 8 (Applications) -- Experimental Evaluations of Algorithms for IP Table Minimization -- Algorithms for Longer OLED Lifetime -- Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data -- Session 9 (Spanning Trees) -- Benchmarks for Strictly Fundamental Cycle Bases -- A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem -- Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights -- Session 10 (Packing and Auctions) -- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem -- Trunk Packing Revisited -- Exact Algorithms for the Matrix Bid Auction
Control code
SPR184904602
Dimensions
unknown
Extent
1 online resource (xiii, 448 pages)
Form of item
online
Isbn
9783540728450
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations.
Specific material designation
remote

Library Locations

Processing Feedback ...