In this task you will be given a text passage from a trivia quiz. You should choose the category this question belongs to from these categories: History, Science, Social Science, Fine Arts, Literature. You can only choose one category, so if in doubt, please choose the closest match.

Example input: In one work this author details the life of a tomb-maker who makes extra money by playing the organ at an insane asylum, while another of his novels sees Swartz give a refugee proper documentation only after he tells him his life story in the title Portuguese city. In addition to The Black Obelisk and The Night in Lisbon, he also wrote about Robert and Otto selling their auto workshop and visiting Patrice in a Swiss tuberculosis sanatorium in his novel The Three Comrades, while the turbulent life of the German surgeon Ravic is told in The Arch of Triumph. Another of his novels, The Road Back, is thought to be a sequel to his most famous book, in which the patriotic teacher Kantorek convinces Paul Bumer and his friends to join the Germany Army during World War I. For 10 points, name this German author who wrote All Quiet on the Western Front.
Example output: Literature
Example explanation: The text is talking about an author and their works, so it belongs to theliterature category.
Q: The first solution to a nontrivial instance of this problem was presented by Dantzig, Fulkerson, and Johnson in 1954 and employed linear programming technqiues to provide a solution for a graph of 42 nodes. An optimal solution to the "Sweden" instance of this problem, the largest one so far solved, was generated by the (*) Lin-Kernighan heuristic. Formally stated, the problem is to find the Hamiltonian cycle for a weighted graph with the minimum edge cost. For 10 points, identify this NP-hard problem in computer science, based on the task of visiting every city in a territory and returning to the start while driving a minimum distance.
A:
Science