Del i serien Lecture Notes in Computer Science

Algorithms and Computation

8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings.

Häftad, Engelska, 1997

AvHon Wai Leong,Hiroshi Imai,Sanjay Jain

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1997-11-21
Mått155 x 235 x 25 mm
Vikt680 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor435
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540638902

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.

Du kanske också är intresserad av

Del 10979

Combinatorial Algorithms

Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung

Häftad, 2018

729 kr

Community Care of Older People

David Beales

Häftad, 1997

909 kr

Local Government Since 1945

Nirmala Rao, Ken Young

Häftad, 1997

899 kr

Journey to Avalon

David Pykitt, Chris Barbar

Häftad, 1997

419 kr

Health Economics For Nurses

Stephen Morris

Häftad, 1997

1 179 kr

Modeling and Simulation of Healthcare Systems for Homeland Security Applications

U.S. Department of Commerce, Charles Mclean, Y. Tina Lee, Sanjay Jain, Charles Hutchings

Häftad, 2015

249 kr

Greenberg Noam, Noam Greenberg, Sanjay Jain, Keng Meng Ng, Sven Schewe, Frank Stephan, Guohua Wu, Yue Yang - ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS, Inbunden

Del 42

ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS

Greenberg Noam, Noam Greenberg, Sanjay Jain, Keng Meng Ng, Sven Schewe, Frank Stephan, Guohua Wu, Yue Yang

Inbunden, 2023

2 829 kr

Edward Bond: Letters 3

Ian Stuart

Häftad, 1997

599 kr

Complex and Derived Constructions

Simon C. Dik, Kees Hengeveld

Inbunden, 1997

2 729 kr

Computing and Combinatorics

Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama

Häftad, 1999

749 kr

Del i serien Lecture Notes in Computer Science

Algorithms and Computation

8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings.

Häftad, Engelska, 1997

AvHon Wai Leong,Hiroshi Imai,Sanjay Jain

749 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1997-11-21
Mått155 x 235 x 25 mm
Vikt680 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor435
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540638902

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

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.