Inicio > Matemáticas y ciencia > Matemáticas > Probabilidad y estadística > Shortest Connectivity
Shortest Connectivity

Shortest Connectivity

Dietmar Cieslik

132,61 €
IVA incluido
Consulta disponibilidad
Editorial:
Springer Nature B.V.
Año de edición:
2004
Materia
Probabilidad y estadística
ISBN:
9780387235387

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)
¡Pregúntanos!
Sobre IBD

The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology.

Artículos relacionados

  • ENGINEERING UNCERTAINTY AND RISK ANALYSIS
    Sergio E. Serrano
    An integrated coverage of probability, statistics, Monte Carlo simulation, inferential statistics, design of experiments, systems reliability, fitting random data to models, analysis of variance, stochastic processes, and stochastic differential equations for engineers and scientists. The author for first time presents an introduction to the broad field of applied engineering u...
    Disponible

    134,56 €

  • UNDERSTANDING AND CALCULATING THE ODDS
    Catalin Barboianu
    Man’s daily life is full of decisional situations. Whether we have math skills or not, we frequently estimate and compare probabilities, sometimes without realizing it, especially when making decisions. But probabilities are not just simple numbers attached objectively or subjectively to events, as they perhaps look, and their calculus and usage is highly predisposed to qualita...
    Disponible

    31,61 €

  • Random Graphs and Complex Networks
    Remco van der Hofstad
    ...
  • Introduction to Malliavin Calculus
    David Nualart / Eulalia Nualart
    ...
    Disponible

    60,35 €

  • Probability, Markov Chains, Queues, and Simulation
    William J. Stewart
    Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic process...
  • SPSS for you
    A. Rajathi / P. Chandran
    In an era where statistical analysis underpins breakthroughs across all fields, the importance of mastering statistical software cannot be overstated. 'SPSS for you' emerges as a pivotal resource for anyone keen to navigate the complexities of statistical analysis with ease and precision. Drawing from over 25 years of teaching experience, practical guidance in statistical analy...
    Disponible

    29,30 €

Otros libros del autor

  • Steiner Minimal Trees
    Dietmar Cieslik
    The problem of 'Shortest Connectivity', which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner’s Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a ne...
    Disponible

    207,48 €

  • The Steiner Ratio
    Dietmar Cieslik
    Steiner’s Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner’s Problem is one of the most famous combinatorial-geometrical problems, b...
    Disponible

    134,07 €

  • The Steiner Ratio
    Dietmar Cieslik
    Steiner’s Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner’s Problem is one of the most famous combinatorial-geometrical problems, b...
  • Steiner Minimal Trees
    Dietmar Cieslik
    The problem of 'Shortest Connectivity', which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner’s Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a ne...