Reconfiguration of Common Independent Sets of Matroids Moritz M - - PowerPoint PPT Presentation

▶
reconfiguration of common independent sets of matroids
SMART_READER_LITE
LIVE PREVIEW

Reconfiguration of Common Independent Sets of Matroids Moritz M - - PowerPoint PPT Presentation

Aug 15, 2023 126 likes •417 views

Reconfiguration of Common Independent Sets of Matroids Moritz M uhlenthaler TU Dortmund Aussois, 2018 Moritz M uhlenthaler (TU Dortmund) Aussois, 2018 1 / 21 Reconfiguration of Common Independent Sets of Matroids Moritz M

slide-1
SLIDE 1

Reconfiguration of Common Independent Sets

  • f Matroids

Moritz M¨ uhlenthaler

TU Dortmund

Aussois, 2018

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 1 / 21

slide-2
SLIDE 2

Reconfiguration of Common Independent Sets

  • f Matroids

Moritz M¨ uhlenthaler

TU Dortmund

Aussois, 2018

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 2 / 21

slide-3
SLIDE 3

Reconfiguration Problems

transformation step: rotate a face of the cube question: can we reach the target configuration, where each face has a single color? ≈ 51 · 1019 configurations! (rules out exploration/enumeration. . . )

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 3 / 21

slide-4
SLIDE 4

Reconfiguration Graphs

adjacency of configurations yields graph structure, the reconfiguration graph

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 4 / 21

slide-5
SLIDE 5

Reconfiguration Graphs

adjacency of configurations yields graph structure, the reconfiguration graph in the following: configurations are solutions of an instance

  • f some combinatorial problem

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 4 / 21

slide-6
SLIDE 6

Reconfiguration Graphs

adjacency of configurations yields graph structure, the reconfiguration graph in the following: configurations are solutions of an instance

  • f some combinatorial problem

Given an instance of some search problem P, the problem P Reconfiguration asks for the existence of an st-path in the reconfiguration graph.

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 4 / 21

slide-7
SLIDE 7

Reconfiguration Graphs

adjacency of configurations yields graph structure, the reconfiguration graph in the following: configurations are solutions of an instance

  • f some combinatorial problem

Given an instance of some search problem P, the problem P Reconfiguration asks for the existence of an st-path in the reconfiguration graph.

△

!

The size of a reconfiguration graph is generally exponential in the size of the instance.

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 4 / 21

slide-8
SLIDE 8

Complexity of Reconfiguration

many problems P exhibit the following pattern P ∈ P ⇒ P Reconfiguration ∈ P P is NP-hard ⇒ P Reconfiguration is PSPACE-compl.

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 5 / 21

slide-9
SLIDE 9

Complexity of Reconfiguration

many problems P exhibit the following pattern P ∈ P ⇒ P Reconfiguration ∈ P P is NP-hard ⇒ P Reconfiguration is PSPACE-compl. exceptions are known, for example

◮ 3-Coloring Reconfiguration is in P [Cereceda et al.,

2011]

◮ Shortest Path Reconfiguration is PSPACE-complete

[Bonsma, 2013]

complexity may depend on choice of the adjacency relation

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 5 / 21

slide-10
SLIDE 10

Tools and Techniques

PSPACE-hardness

1

non-deterministic constraint logic (NCL)

2

reductions preserving reachability

polynomial-time algorithms

1

dynamic programming

2

kernelization

3

alternating paths algorithms

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 6 / 21

slide-11
SLIDE 11

Matroids and Reconfiguration (1)

Why matroids are natural structures for reconfiguration We can characterize feasible solutions of combinatorial problems using common independent sets of matroids and use exchange properties for adjacency.

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 7 / 21

slide-12
SLIDE 12

Matroids and Reconfiguration (1)

Why matroids are natural structures for reconfiguration We can characterize feasible solutions of combinatorial problems using common independent sets of matroids and use exchange properties for adjacency. known results

◮ basis graph characterization [Maurer, 1972] ◮ reconfiguration of two weighted bases always possible such that

the weight does not exeed that of the heavier one [Ito et al., 2011]

◮ reconfiguration of ordered bases [Lubiw and Pathak, 2016] Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 7 / 21

slide-13
SLIDE 13

Matroids and Reconfiguration (2)

Feasible solutions of many combinatorial problems can be characterized by common independent sets of ℓ ≥ 1 matroids: ≤ 1 ≤ 1 ≤ 1 ≤ 1 Bipartite Matching

≤ 1

≤ 2 ≤ 1 ≤ 1 ≤ 1 Graph Orientation Colorful Spanning Tree Directed Hamilton Path

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 8 / 21

slide-14
SLIDE 14

Common Independent Set Reconfiguration

ℓ-Common Independent Set (CIS) Reconfiguration input Independence oracles for matroids M1, M2, . . . , Mℓ, each on ground-set X, S, T ∈ X such that S and T independent in each matroid, number k ∈ N question Is T reachable from S in the reconfiguration graph Gk(M1, M2, . . . , Mℓ) = (V , E)? V := {A ⊆ E | A independent in M1, M2, . . . , Mℓ, |A| ≥ k − 1} E := {AB | A, B ∈ V , |A △ B| = 1}

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 9 / 21

slide-15
SLIDE 15

Results

Theorem (M., 2017)

2-CIS Reconfiguration admits a polynomial-time algorithm.

Theorem (M., 2017)

For ℓ ≥ 3, ℓ-CIS Reconfiguration is PSPACE-complete, even for a very restricted class of matroids.

very restricted class: 1-uniform partition matroids having blocks of size at most two

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 10 / 21

slide-16
SLIDE 16

2-CIS Reconfiguration (1)

variant of the alternating paths technique two common independent sets are connected iff their symmetric difference contains no “frozen” structure

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 11 / 21

slide-17
SLIDE 17

2-CIS Reconfiguration (1)

variant of the alternating paths technique two common independent sets are connected iff their symmetric difference contains no “frozen” structure

  • bstructions to reconfiguration

≤ 1 ≤ 1 ≤ 1 ≤ 1 M1 partition matroid M2 partition matroid ≤ 2 ≤ 2 ≤ 2 M1 graphic matroid M2 partition matroid

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 11 / 21

slide-18
SLIDE 18

2-CIS Reconfiguration (2)

  • bstructions are (essentially) chordless cycles in the exchange graph

≤ 2 ≤ 2 ≤ 2 b d f a c e b d f a c e I \ J J \ I arcs in the exchange graph x y iff I − x + y independent in M1 x y iff I − x + y independent in M2

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 12 / 21

slide-19
SLIDE 19

3-CIS Reconfiguration (1)

Theorem

For ℓ ≥ 3, ℓ-CIS Reconfiguration is PSPACE-complete, even for 1-uniform partition matroids having blocks of size at most two. M2 M3 M1

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 13 / 21

slide-20
SLIDE 20

3-CIS Reconfiguration (2)

3-SAT Reconf. Stable Set Reconf. 3-CIS Reconfiguration [Gopalan et al., 2009] [Ito et al., 2011] [M., 2017] new reduction required Construct partition matroids from 3-edge-coloring of the stable set instance graph.

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 14 / 21

slide-21
SLIDE 21

3-CIS Reconfiguration (3)

3-SAT Reconfiguration − → Stable Set Reconf. example ϕ = (x1 ∨ x2) ∧ (x1 ∨ x2 ∨ x3) ∧ (x2 ∨ x3) [Ito et al., 2011] x1 x1 x2 x2 x3 x3 x1 x2 x1 x3 x2 x2 x3

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 15 / 21

slide-22
SLIDE 22

3-CIS Reconfiguration (3)

3-SAT Reconfiguration − → Stable Set Reconf. example ϕ = (x1 ∨ x2) ∧ (x1 ∨ x2 ∨ x3) ∧ (x2 ∨ x3) [Ito et al., 2011] x1 x1 x2 x2 x3 x3 x1 x2 x1 x3 x2 x2 x3

  • max. stable set correspond to satisfying assignments

subgraph induced by a literal is a complete bipartite graph

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 15 / 21

slide-23
SLIDE 23

3-CIS Reconfiguration (4)

3-SAT Reconfiguration − → Stable Set Reconf. replace each subgraph induced by a literal by the following gadget . . . . . . x x x x x x

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 16 / 21

slide-24
SLIDE 24

3-CIS Reconfiguration (5)

3-SAT Reconfiguration − → Stable Set Reconf. x x x x x = True x x x x x = False

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 17 / 21

slide-25
SLIDE 25

3-CIS Reconfiguration (6)

Stable Set Reconf. − → 3-CIS Reconfiguration x2 ¬x2 ¬x2 ¬x1 x1 x3 ¬x3 construct partition matroids M1, M2, M3 from the colored edges

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 18 / 21

slide-26
SLIDE 26

NAE 3SAT Reconfiguration

Corollary (M., 2017)

Monotone 4-Occ NAE 3-SAT Reconfiguration is PSPACE-complete. p1

T

p2

T

p3

T

p4

T

p5

T

p6

T

p7

T

p8

F F F

x x x x x

T T T T T

NAE 3-SAT version of the path gadget

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 19 / 21

slide-27
SLIDE 27

Conclusions and Future Directions

solution graphs of combinatorial problems are interesting objects matroids capture solution graphs of many such problems reachability in the solutions graph. . .

◮ can be decided in polynomial time for common independent sets

  • f two matroids

◮ is PSPACE-complete for common independent sets of three of

more matroids

What is the reconfiguration complexity for related structures?

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 20 / 21

slide-28
SLIDE 28

Thank you!

Moritz M¨ uhlenthaler (TU Dortmund) Aussois, 2018 21 / 21