Algorithms and Computation: 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. (Lecture Notes in Computer Science) - Taschenbuch

EAN (ISBN-13): 9783540638902
ISBN (ISBN-10): 3540638903
Taschenbuch
Erscheinungsjahr: 1997
Herausgeber: Springer Berlin
452 Seiten
Gewicht: 0,678 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-02-06T19:09:47+01:00 (Vienna)
Detailseite zuletzt geändert am 2023-02-02T12:12:07+01:00 (Vienna)
ISBN/EAN: 9783540638902

ISBN - alternative Schreibweisen:
3-540-63890-3, 978-3-540-63890-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: leong, hiroshi imai, jain
Titel des Buches: algorithms computation, international 1997, singapore, lecture notes computer science, wai wai, isaac, symposium notes

---

Daten vom Verlag:

Autor/in: Hon Wai Leong; Hiroshi Imai; Sanjay Jain
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings.
Verlag: Springer; Springer Berlin
435 Seiten
Erscheinungsjahr: 1997-11-21
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XVII, 435 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Computational Geometry; Discrete Mathematics; Matchings; Scientific Computing; complexity; geometry; sets; algorithm analysis and problem complexity; Theory of Computation; Algorithms; Discrete Mathematics in Computer Science; Computational Mathematics and Numerical Analysis; Numerical Analysis; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; EA

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.