![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 12.03.2021 18:20 starfox5454
There are n cities where for each i < j, there is a road from city i to city j which takes Ti;j time to travel. Two travelers Marco and Polo want to pass through all the cities, in the shortest time possible. In the other words, we want to divide the cities into two sets and assign one set to Marco and assign the other one to Polo such that the sum of the travel time by them is minimized. You can assume they start their travel from the city with smallest index from their set, and they travel cities in the ascending order of index (from smallest index to largest). The time complexity of your algorithm should be O(n2). Prove your algorithm nds the best answer.
![ansver](/tpl/images/cats/User.png)
Answers: 1
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 10:40
Nims is applicable to all stakeholders with incident related responsibilities. true or false
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 11:00
How does a policy manual an organization? a. it boost productivity. b. it create awareness in employees about the organization’s values. c. it employees achieve targets. d. it safeguards the organization from liabilities.
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 13:00
Think of a spreadsheet as a giant calculator spread of paper chart data collector
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 25.06.2019 05:00
How does computer network work in a paragraph
Answers: 1
You know the right answer?
There are n cities where for each i < j, there is a road from city i to city j which takes Ti;j t...
Questions
![question](/tpl/images/cats/en.png)
English, 18.11.2020 02:30
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/istoriya.png)
History, 18.11.2020 02:30
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30
![question](/tpl/images/cats/istoriya.png)
History, 18.11.2020 02:30
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/himiya.png)
Chemistry, 18.11.2020 02:30
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/himiya.png)
Chemistry, 18.11.2020 02:30
![question](/tpl/images/cats/himiya.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30
![question](/tpl/images/cats/en.png)
English, 18.11.2020 02:30
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 18.11.2020 02:30