LEADER 06539nam 22007335 450 001 996466078903316 005 20200702090845.0 010 $a3-540-69662-8 024 7 $a10.1007/3-540-63890-3 035 $a(CKB)1000000000234767 035 $a(SSID)ssj0000321211 035 $a(PQKBManifestationID)11247375 035 $a(PQKBTitleCode)TC0000321211 035 $a(PQKBWorkID)10262623 035 $a(PQKB)10986721 035 $a(DE-He213)978-3-540-69662-9 035 $a(PPN)155163949 035 $a(EXLCZ)991000000000234767 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation$b[electronic resource] $e8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. /$fedited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XVII, 435 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1350 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63890-3 327 $aSolving 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1350 606 $aComputers 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer mathematics 606 $aNumerical analysis 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aComputational Mathematics and Numerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer mathematics. 615 0$aNumerical analysis. 615 14$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputation by Abstract Devices. 615 24$aComputational Mathematics and Numerical Analysis. 615 24$aNumeric Computing. 676 $a004.0151 702 $aLeong$b Hon Wai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aImai$b Hiroshi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJain$b Sanjay$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466078903316 996 $aAlgorithms and Computation$9771857 997 $aUNISA