Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings

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 algor...

Celý popis

Uloženo v:
Podrobná bibliografie
Korporativní autor: International Symposium on Algorithms and Computation :Singapour
Další autoři: Leong, Hon Wai, 1955- (Šéfredaktor, odpovědný redaktor), Imai, Hiroshi, 1958- (Šéfredaktor, odpovědný redaktor), Jain, Sanjay, 1965- (Šéfredaktor, odpovědný redaktor)
Médium: Livre numérique
Jazyk:Anglais
Vydáno: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Edice:Lecture notes in computer science 1350
Témata:
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithms and computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, proceedings, Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.), 1997, Berlin, Springer, 1 vol. (XV-426 p.), Lecture notes in computer science, 3-540-63890-3
• Algorithms and Computation, Texte imprimé, 9783662207970
LEADER 05940nam a22004337a 4500
001 943769
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155163949
020 |a 9783540696629 (PDF) 
041 0 |a eng 
082 |a 004.015118 
082 |a 004 
111 2 |a International Symposium on Algorithms and Computation  |n (08  |d  :1997  |c  :Singapour). 
245 1 0 |a Algorithms and computation :  |b 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings   |c [edited by] Hon Wai Leong, Hiroshi Imai, Sanjay Jain. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1350  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Complexité de calcul (informatique) 
650 |a Analyse numérique 
650 |a Actes de congrès 
700 1 |a Leong, Hon Wai,  |d 1955-  |4 pbd 
700 1 |a Imai, Hiroshi,  |d 1958-  |4 pbd 
700 1 |a Jain, Sanjay,  |d 1965-  |4 pbd 
776 0 |0 034649417  |t Algorithms and computation  |o 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997  |o proceedings  |f Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)  |d 1997  |c Berlin  |n Springer  |p 1 vol. (XV-426 p.)  |s Lecture notes in computer science  |z 3-540-63890-3 
776 0 |t Algorithms and Computation  |b Texte imprimé  |z 9783662207970 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-63890-3  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-BTRG8M47-5  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747822360  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-63890-3  |z Accès Université d'Orléans 
856 4 |5 180339901:75083918X  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-63890-3  |z Accès INSA CVL 
997 |0 943769  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/