Steiner Trees in Industry: 11 (Combinatorial Optimization, 11) - Image 1

£162.60

Springer Steiner Trees in Industry: 11 (Combinatorial Optimization, 11)

Name: Steiner Trees in Industry: 11 (Combinatorial Optimization, 11)
Brand: Springer
Price: 162.6 GBP
Availability: InStock

Network Hardware

It has never been this cheap. We have no record of a lower price.

£163 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 67 days • 67 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 67 days • 1 price levels

Days at Price

Price Analysis

Most common price: £163 (67 days, 100.0%)

Price range: £163 - £163

Price levels: 1 different prices over 67 days

Description

This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini mum tree) was first proposed by Gauss.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 1402000995
Category: Books > Subjects > Computing & Internet > Networking & Security > Network Hardware
Domain: Amazon UK
Release Date: 31 October 2001
Listed Since: 15 December 2006

Barcode

No barcode data available

Springer Steiner Trees in Industry: 11 (Combinatorial Optimization, 11)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Steiner Tree Problems In Computer Communication Networks

Advances in Steiner Trees: 6 (Combinatorial Optimization, 6)

Spanning Trees and Optimization Problems: 19 (Discrete Mathematics and Its Applications)

THE RECTILINEAR STEINER TREE PROBLEM: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE RECTILINEAR STEINER TREE PROBLEM

Minimal NetworksThe Steiner Problem and Its Generalizations

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining: 146 (Intelligent Systems Reference Library, 146)

Geometry of Cuts and Metrics: 15 (Algorithms and Combinatorics, 15)

Gems of Combinatorial Optimization and Graph Algorithms

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Parameterized Algorithms

Finite Geometries and Designs: Proceedings of the Second Isle of Thorns Conference 1980: 49 (London Mathematical Society Lecture Note Series, Series Number 49)

Proceedings of the Fourteenth International Conference on Management Science and Engineering Management: Volume 2: 1191 (Advances in Intelligent Systems and Computing, 1191)

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions: 156 (Intelligent Systems Reference Library, 156)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Proceedings of the Seventh International Conference on Management Science and Engineering Management: Focused on Electrical and Information Technology ... Notes in Electrical Engineering, 242)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science)

Fuzzy Relational Mathematical Programming: Linear, Nonlinear and Geometric Programming Models: 389 (Studies in Fuzziness and Soft Computing, 389)

Metaheuristic Algorithms in Industry 4.0 (Advances in Metaheuristics)

Quantitative Graph Theory: Mathematical Foundations and Applications (Discrete Mathematics and Its Applications (Hardcover))

The Theory of Algorithms: 23 (Mathematics and its Applications, 23)

Graph Theory for Programmers: Algorithms for Processing Trees: 515 (Mathematics and Its Applications, 515)