- We will send in 10–14 business days.
/images/books/13456395/9783958260764.jpg)
- Author: Krzysztof Fleszar
- Publisher: Würzburg University Press
- Year: 2018
- Pages: 218
- ISBN-10: 3958260764
- ISBN-13: 9783958260764
- Format: 17 x 24.4 x 1.2 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Network-Design Problems in Graphs and on the Plane (e-book) (used book) | bookbook.eu
Reviews
Description
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.14:23:33
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Krzysztof Fleszar
- Publisher: Würzburg University Press
- Year: 2018
- Pages: 218
- ISBN-10: 3958260764
- ISBN-13: 9783958260764
- Format: 17 x 24.4 x 1.2 cm, minkšti viršeliai
- Language: English English
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
Reviews