Experimental Algorithms (Record no. 181416)

MARC details
000 -LEADER
fixed length control field 05481nam a22006255i 4500
001 - CONTROL NUMBER
control field 978-3-540-72845-0
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423125747.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100301s2007 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540728450
-- 978-3-540-72845-0
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-3-540-72845-0
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.758
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051230
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Experimental Algorithms
Medium [electronic resource] :
Remainder of title 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings /
Statement of responsibility, etc edited by Camil Demetrescu.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2007.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 2007.
300 ## - PHYSICAL DESCRIPTION
Extent XIV, 450 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Theoretical Computer Science and General Issues,
International Standard Serial Number 2512-2029 ;
Volume number/sequential designation 4525
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical analysis.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software Engineering.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Numerical Analysis.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Demetrescu, Camil.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540728443
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540839002
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Theoretical Computer Science and General Issues,
-- 2512-2029 ;
Volume number/sequential designation 4525
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/978-3-540-72845-0">https://doi.org/10.1007/978-3-540-72845-0</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in