Let A, B, C, D be the vertices of a square with side length 100. If we want to create a minimum-weight spanning tree to connect these four vertices, clearly this spanning tree would have total weight 300 (e.g. we can connect AB, BC, and CD). But what if we are able to add extra vertices inside the square, and use these additional vertices in constructing our spanning tree?  Would the minimum-weight spanning tree have total weight less than 300?  And if so, where should these additional vertices be placed to minimize the total weight? Let G be a graph with the vertices A, B, C, D, and possibly one or more additional vertices that can be placed anywhere you want on the (two-dimensional) plane containing the four vertices of the square. Determine the smallest total weight for the minimum-weight spanning tree of G.  Round your answer to the nearest integer. Attention: Please don't just copy these two following answers, which are not correct at all. Thank you. https://www.bartleby.com/questions-and-answers/let-a-b-c-d-be-the-vertices-of-a-square-with-side-length-100.-if-we-want-to-create-a-minimum-weight-/49e3ae56-ef82-4ccc-a35e-6ee2336c72fb https://www.bartleby.com/questions-and-answers/let-a-b-c-d-be-the-vertices-of-a-square-with-side-length-100.-if-we-want-to-create-a-minimum-weight-/47c32761-5ad4-42bc-b8a0-9aa854337d08

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Let A, B, C, D be the vertices of a square with side length 100.

If we want to create a minimum-weight spanning tree to connect these four vertices, clearly this spanning tree would have total weight 300 (e.g. we can connect AB, BC, and CD).

But what if we are able to add extra vertices inside the square, and use these additional vertices in constructing our spanning tree? 

Would the minimum-weight spanning tree have total weight less than 300?  And if so, where should these additional vertices be placed to minimize the total weight?

Let G be a graph with the vertices A, B, C, D, and possibly one or more additional vertices that can be placed anywhere you want on the (two-dimensional) plane containing the four vertices of the square.

Determine the smallest total weight for the minimum-weight spanning tree of G.  Round your answer to the nearest integer.

Attention: Please don't just copy these two following answers, which are not correct at all. Thank you.

https://www.bartleby.com/questions-and-answers/let-a-b-c-d-be-the-vertices-of-a-square-with-side-length-100.-if-we-want-to-create-a-minimum-weight-/49e3ae56-ef82-4ccc-a35e-6ee2336c72fb

https://www.bartleby.com/questions-and-answers/let-a-b-c-d-be-the-vertices-of-a-square-with-side-length-100.-if-we-want-to-create-a-minimum-weight-/47c32761-5ad4-42bc-b8a0-9aa854337d08

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Approximation Algorithms
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education