• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Network-Design Problems in Graphs and on the Plane

Network-Design Problems in Graphs and on the Plane

Paperback

General Computers

ISBN10: 3958260764
ISBN13: 9783958260764
Publisher: Lightning Source Inc
Published: Dec 6 2018
Pages: 218
Weight: 0.78
Height: 0.46 Width: 6.69 Depth: 9.61
Language: 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.

Also in

General Computers