Bitonicity of Euclidean TSP in Narrow Strips EuroCG presentation - - PowerPoint PPT Presentation

β–Ά
bitonicity of euclidean tsp in narrow strips
SMART_READER_LITE
LIVE PREVIEW

Bitonicity of Euclidean TSP in Narrow Strips EuroCG presentation - - PowerPoint PPT Presentation

Bitonicity of Euclidean TSP in Narrow Strips EuroCG presentation Henk Alkema, Mark de Berg, and Sndor Kisfaludi-Bak Department of Mathematics and Computer Science Introduction The Euclidean Travelling Salesman Problem In red: added


slide-1
SLIDE 1

Department of Mathematics and Computer Science Henk Alkema, Mark de Berg, and SΓ‘ndor Kisfaludi-Bak

EuroCG presentation

Bitonicity of Euclidean TSP in Narrow Strips

slide-2
SLIDE 2

Introduction

slide-3
SLIDE 3

The Euclidean Travelling Salesman Problem

In red: added commentary to make the slides readable

slide-4
SLIDE 4

The Euclidean Travelling Salesman Problem

Find a shortest tour visiting all points

slide-5
SLIDE 5

Euclidean TSP in narrow strips

Find a shortest tour visiting all points Likely to be a bitonic tour A tour is bitonic if it crosses any vertical line at most twice

slide-6
SLIDE 6

Motivation

𝑒-dimensional Euclidean TSP: NP-hard Can be solved in 2𝑃 π‘œ1βˆ’1/𝑒 time ETH-tight 2𝑃

π‘œ for 𝑒 = 2

Bitonic tours: 𝑃(π‘œ log2 π‘œ)

slide-7
SLIDE 7

Problem description

𝑄 = {π‘ž1, π‘ž2, … , π‘žπ‘œ} point set in 0, π‘œ Γ— 0, πœ€ 𝑦-coordinate of π‘žπ‘— is exactly 𝑗

slide-8
SLIDE 8

Bitonicity of Euclidean TSP in Narrow Strips

slide-9
SLIDE 9

Bitonicity of Euclidean TSP in Narrow Strips

Theorem 1. If πœ€ ≀ 2 2, there exists a shortest tour that is bitonic. This bound is tight. Construction for πœ€ > 2 2:

slide-10
SLIDE 10

Bitonicity of Euclidean TSP in Narrow Strips

Theorem 1. If πœ€ ≀ 2 2, there exists a shortest tour that is bitonic. This bound is tight. Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-11
SLIDE 11

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-12
SLIDE 12

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-13
SLIDE 13

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-14
SLIDE 14

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-15
SLIDE 15

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-16
SLIDE 16

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-17
SLIDE 17

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-18
SLIDE 18

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-19
SLIDE 19

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-20
SLIDE 20

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-21
SLIDE 21

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-22
SLIDE 22

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-23
SLIDE 23

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² An edge set E is superior to an edge set F if

  • The sum of the lengths of the edges of E is strictly less than that of F, or
  • The sums are equal, but
  • No vertical line crosses E strictly more times than F, and
  • There exists a vertical line which crosses E strictly fewer times than F
slide-24
SLIDE 24

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² Step 1: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates β‡’ A superior edge set always exists β€˜Interesting’ points are those which cross the vertical line we are currently looking at during our sweep from right to left

slide-25
SLIDE 25

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² Step 1: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates β‡’ A superior edge set always exists Step 2: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates

slide-26
SLIDE 26

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-27
SLIDE 27

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² The exact connections are unimportant, but their connections are; the new set of edges must still form a tour together with the black edges

slide-28
SLIDE 28

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² In blue, a alternative set of edges. Note that moving points along the red edges can only make blue β€˜less’ superior

slide-29
SLIDE 29

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-30
SLIDE 30

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-31
SLIDE 31

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-32
SLIDE 32

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² If you whish to move a vertex with two red edges connected, things are slightly more complicated…

slide-33
SLIDE 33

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² Split the vertex into two, adding a connection between them (they are still on the same spot, but slightly displaced in the figure for clarity)

slide-34
SLIDE 34

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² Then, you can move one of them as normal

slide-35
SLIDE 35

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€²

slide-36
SLIDE 36

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Transform tour π‘ˆ into (shorter) bitonic tour π‘ˆβ€² Step 1: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates β‡’ A superior edge set always exists Step 2: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates

slide-37
SLIDE 37

Bitonicity of Euclidean TSP in Narrow Strips

Step 2: Superior edge set exists if β€˜interesting’ points have consecutive 𝑦-coordinates Proof sketch: Case distinction on the connections between the β€˜interesting’ points

slide-38
SLIDE 38

Bitonicity of Euclidean TSP in Narrow Strips

All six possible cases. Points in grey blocks can have any horizontal ordering

slide-39
SLIDE 39

Bitonicity of Euclidean TSP in Narrow Strips

Proof sketch: Case distinction on the connections between the β€˜interesting’ points For each case, this can be proven either algebraically, or by computer assistance The figure to the right gives the bound (both horizontal orderings of points 4 and 5 give the same bound of 2√2)

slide-40
SLIDE 40

Questions?

Feel free to let us know!