rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Experimental and Efficient Algorithms
    sub title: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
  name:
    name part: Jansen, Klaus.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Margraf, Marian.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Mastrolilli, Monaldo.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: Rolim, José D. P.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2003
    edition: 1st ed. 2003.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: VIII, 272 p. online resource.
  abstract: This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003. The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems.
  table of contents: Improving Linear Programming Approaches for the Steiner Tree Problem -- Algorithms and Experiments on Colouring Squares of Planar Graphs -- Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem -- Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm -- An On-Line Algorithm for the Rectangle Packing Problem with Rejection -- New Lower and Upper Bounds for Graph Treewidth -- Search Data Structures for Skewed Strings -- Evaluation of Basic Protocols for Optical Smart Dust Networks -- Linear Time Local Improvements for Weighted Matchings in Graphs -- Experimental Studies of Graph Traversal Algorithms -- A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning -- Comparing Push- and Pull-Based Broadcasting -- Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location -- A Lazy Version of Eppstein's K Shortest Paths Algorithm -- Linear Algorithm for 3-Coloring of Locally Connected Graphs -- A Clustering Algorithm for Interval Graph Test on Noisy Data -- Core Instances for Testing: A Case Study -- The Reliable Algorithmic Software Challenge RASC -- A New Class of Greedy Heuristics for Job Shop Scheduling Problems -- Algorithmic Techniques for Memory Energy Reduction -- A Framework for Designing Approximation Algorithms for Scheduling Problems -- Analysis and Visualization of Social Networks.
  note: edited by Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim.
  subject:
    topic: Applied mathematics
  subject:
    topic: Engineering mathematics
  subject:
    topic: Algorithms
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Computer graphics
  subject:
    topic: Applications of Mathematics
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Numeric Computing
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Computer Graphics
  classification: T57-57.97
  classification: 519
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2647
  identifier: 9783540448679
  identifier: https://doi.org/10.1007/3-540-44867-5
  record info:
    record creation date: 121227
    record change date: 20191024041938.0
    record identifier: 978-3-540-44867-9