Coverart for item
The Resource Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings, Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)

Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings, Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)

Label
Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings
Title
Algorithms and computation
Title remainder
8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings
Statement of responsibility
Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97, held in Singapore in December 1997. The 42 revised full papers presented were selected from a total of 98 submissions. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas. Among the topics addressed are scheduling and logistics, networking and routing, combinatorial optimization, graph-computations, algorithmic learning, computational geometry, etc
Member of
Cataloging source
SCPER
Dewey number
004.015118
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
I73 1997
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1997
http://bibfra.me/vocab/lite/meetingName
ISAAC (Symposium)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
  • 1955-
  • 1958-
  • 1965 February 22-
http://library.link/vocab/relatedWorkOrContributorName
  • Leong, Hon Wai
  • Imai, H.
  • Jain, Sanjay
Series statement
Lecture notes in computer science
Series volume
1350
http://library.link/vocab/subjectName
  • Computer algorithms
  • Numerical calculations
  • Computer algorithms
  • Numerical calculations
  • Algoritmen
  • Complexiteit
  • Computerwiskunde
Label
Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings, Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic -- Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists
Control code
321260766
Dimensions
unknown
Extent
1 online resource (xv, 426 pages)
Form of item
online
Isbn
9783540696629
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)321260766
Label
Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings, Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic -- Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists
Control code
321260766
Dimensions
unknown
Extent
1 online resource (xv, 426 pages)
Form of item
online
Isbn
9783540696629
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)321260766

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...