Jump number of posets and independent sets of

rectangles
Based on a work presented in IPCO 2011

José A. Soto1 Claudio Telha2

1 Department of Mathematics, MIT
2 Operations Research Center, MIT

IPCO 2011

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 1

Outline

1 Introduction to the Jump Number Problem

2 Cross-free Matchings and Biclique Covers

3 Main results
Outline

1 Introduction to the Jump Number Problem

2 Cross-free Matchings and Biclique Covers

3 Main results
Jump Number Problem

P
d e f

a b c

Jump number problem for a poset P

Find a linear extension (total order)
with minimum number of jumps j(P).

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 3

Jump Number Problem

P e

d e f
d

a b c
c

b
Jump number problem for a poset P
Find a linear extension (total order)
a
with minimum number of jumps j(P).
4 Jumps

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 3

Jump Number Problem

P e e

d e f
d f

f c

a b c
c d

b b
Jump number problem for a poset P
Find a linear extension (total order)
a a
with minimum number of jumps j(P).
4 Jumps 3 Jumps

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 3

(cont.) Jump number

Properties of j(P)
(Habib 84) Comparability invariant: j(G).

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 4

(cont.) Jump number

Properties of j(P)
(Habib 84) Comparability invariant: j(G).
(Müller 90) NP-hard for chordal bipartite graphs.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 4

(cont.) Jump number

Properties of j(P)
(Habib 84) Comparability invariant: j(G).
(Müller 90) NP-hard for chordal bipartite graphs.
Polynomial time algorithms:
(Steiner-Stewart 87) Bipartite permutation graphs.
(Brändstadt 89) Biconvex graphs.
(Dahlhaus 94) Convex graphs.
OPEN: 2D-graphs (or permutation graphs).

Bipartite ⊂ Biconvex ⊂ Convex ⊂ 2 DORG ⊂ Chordal

Permutation Bipartite
⊂

2D-graphs

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 4

Permutation Graphs (2D-graphs)

Definition (2D-graphs)
Given a set V of points in the plane.
G(V) is the graph where

ab is an edge if ax ≤ bx and ay ≤ by .

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 5

Two-Directional Orthogonal Ray Graphs (2 DORG)

Definition (Bicolored 2D-graphs or 2 DORG)

Given two sets A and B of points in the plane.
G(A, B) is the bipartite graph on A ∪ B where

ab is an edge if a ∈ A, b ∈ B, ax ≤ bx and ay ≤ by .

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 6

Two-Directional Orthogonal Ray Graphs (2 DORG)

Definition (Bicolored 2D-graphs or 2 DORG)

Given two sets A and B of points in the plane.
G(A, B) is the bipartite graph on A ∪ B where

ab is an edge if a ∈ A, b ∈ B, ax ≤ bx and ay ≤ by .

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 6

Two-Directional Orthogonal Ray Graphs (2 DORG)

Definition (Bicolored 2D-graphs or 2 DORG)

Given two sets A and B of points in the plane.
G(A, B) is the bipartite graph on A ∪ B where

ab is an edge if a ∈ A, b ∈ B, ax ≤ bx and ay ≤ by .

Geometric
formulation of a
2 DORG as a
rectangle family R.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 6

Outline

1 Introduction to the Jump Number Problem

2 Cross-free Matchings and Biclique Covers

3 Main results
Cross-free Matchings and Biclique Covers.

Cross-free matchings
Edges ab and a0 b0 cross if ab0 and a0 b are also edges.

d e f

a b c

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 7

Cross-free Matchings and Biclique Covers.

Cross-free matchings
Edges ab and a0 b0 cross if ab0 and a0 b are also edges.
α∗ (G) = maximum size of a cross-free matching.

d e f

a b c

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 7

Cross-free Matchings and Biclique Covers.

Cross-free matchings
Edges ab and a0 b0 cross if ab0 and a0 b are also edges.
α∗ (G) = maximum size of a cross-free matching.
e

f
d e f
Fact (Müller 90): c

For G chordal bipartite. d

α∗ (G) + j(G) = n − 1.
b
a b c
a

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 7

Cross-free Matchings and Biclique Covers.

Cross-free matchings
Edges ab and a0 b0 cross if ab0 and a0 b are also edges.
α∗ (G) = maximum size of a cross-free matching.
e

f
d e f
Fact (Müller 90): c

For G chordal bipartite. d

α∗ (G) + j(G) = n − 1.
b
a b c
a

Biclique Cover
κ∗ (G) = minimum size of a biclique-cover.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 7

Cross-free Matchings and Biclique Covers.

Cross-free matchings
Edges ab and a0 b0 cross if ab0 and a0 b are also edges.
α∗ (G) = maximum size of a cross-free matching.
e

f
d e f
Fact (Müller 90): c

For G chordal bipartite. d

α∗ (G) + j(G) = n − 1.
b
a b c
a

Biclique Cover
κ∗ (G) = minimum size of a biclique-cover. α∗ (G) ≤ κ∗ (G).

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 7

 α∗ (G(A, B)) and κ∗ (G(A, B)) in 2 DORGs

Crossing edges = Overlapping rectangles

Maximal bicliques = Rectangle hitting sets

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 8

 α∗ (G(A, B)) and κ∗ (G(A, B)) in 2 DORGs

Crossing edges = Overlapping rectangles

Maximal bicliques = Rectangle hitting sets

Proposition [ST11]: In a 2 DORG with rectangles R

α∗ (G(A, B)) = maximum independent set of R [MIS(R)].
κ∗ (G(A, B)) = minimum hitting set of R [MHS(R)].

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 8

 α∗ (G(A, B)) and κ∗ (G(A, B)) in 2 DORGs

Crossing edges = Overlapping rectangles

Can replace R
by the
inclusionwise
Maximal bicliques = Rectangle hitting sets minimal
rectangles R↓ .

Proposition [ST11]: In a 2 DORG with rectangles R

α∗ (G(A, B)) = maximum independent set of R [MIS(R)].
κ∗ (G(A, B)) = minimum hitting set of R [MHS(R)].

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 8

Outline

1 Introduction to the Jump Number Problem

2 Cross-free Matchings and Biclique Covers

3 Main results
Linear Program Formulation
1
z∗ = max 1T x
X

 xR ≤ 1, q ∈ Grid. Nonintegral Polytope.
P= R3q
xR ≥ 0, R ∈ R↓ .



Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 9

Linear Program Formulation
1
z∗ = max 1T x
X

 xR ≤ 1, q ∈ Grid.
P= R3q
A

 xR ≥ 0, R ∈ R↓ . Integral

Theorem 1 [ST11]: In a 2 DORG with minimal rectangles R↓

The fractional solution with minimum weighted area is integral, i.e.:
nX o
arg min area(R)xR : 1T x = z ∗ , x ∈ P is integral.
R∈R↓

Proof: Uncrossing argument.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 9

Min-Max relation

Theorem 2 [ST11]: For every 2 DORG,

κ∗ (G(A, B)) = α∗ (G(A, B)).
min. hitting set(R↓ ) = max. indep. set(R↓ ).

e 2.38 )-time.
And we can compute them in O(n

Proof has elements from [Frank 99] and [Benczúr-Foster-Király 99].

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 10

(sketch) Theorem 2: α∗ (G(A, B)) = κ∗ (G(A, B)).
Let H be the intersection graph of R↓ . Then:
α∗ (G(A, B)) = MIS(R↓ ) = stability number of H.
κ∗ (G(A, B)) = MHS(R↓ ) = clique covering number of H.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 11

(sketch) Theorem 2: α∗ (G(A, B)) = κ∗ (G(A, B)).
Let H be the intersection graph of R↓ . Then:
α∗ (G(A, B)) = MIS(R↓ ) = stability number of H.
κ∗ (G(A, B)) = MHS(R↓ ) = clique covering number of H.
Intersections
The only possible intersections in H can be
corner-free intersections or corner intersections.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 11

(sketch) Theorem 2: α∗ (G(A, B)) = κ∗ (G(A, B)).
Let H be the intersection graph of R↓ . Then:
α∗ (G(A, B)) = MIS(R↓ ) = stability number of H.
κ∗ (G(A, B)) = MHS(R↓ ) = clique covering number of H.
Intersections
The only possible intersections in H can be
corner-free intersections or corner intersections.

Perfect Case:
If R↓ is such that the only intersections are corner-free-intersection,
then its intersection graph H is a comparability graph (perfect).
Therefore α∗ (G(A, B)) = κ∗ (G(A, B)).

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 11

(cont.) Theorem 3: MIS(R↓ )=MHS(R↓ )

General Case:
1 Construct a family K ⊆ R↓ by greedily including (in a certain
order) rectangles in K if they do not form corner-intersection.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 12

(cont.) Theorem 3: MIS(R↓ )=MHS(R↓ )

General Case:
1 Construct a family K ⊆ R↓ by greedily including (in a certain
order) rectangles in K if they do not form corner-intersection.
2 Since K is a corner-free-intersection family
MHS(K)=MIS(K)≤MIS(R↓ )≤MHS(R↓ ).

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 12

(cont.) Theorem 3: MIS(R↓ )=MHS(R↓ )

General Case:
1 Construct a family K ⊆ R↓ by greedily including (in a certain
order) rectangles in K if they do not form corner-intersection.
2 Since K is a corner-free-intersection family
MHS(K)=MIS(K)≤MIS(R↓ )≤MHS(R↓ ).
3 Compute P a minimum hitting set of K.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 12

(cont.) Theorem 3: MIS(R↓ )=MHS(R↓ )

General Case:
1 Construct a family K ⊆ R↓ by greedily including (in a certain
order) rectangles in K if they do not form corner-intersection.
2 Since K is a corner-free-intersection family
MHS(K)=MIS(K)≤MIS(R↓ )≤MHS(R↓ ).
3 Compute P a minimum hitting set of K.

Swapping procedure.
If p, q in P, with px < qx and py < qy s.t.
P0 = P \ {p, q} ∪ {(px , qy ), (py , qx )}
is a hitting set for K then set P ← P0 .

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 12

(cont.) Theorem 3: MIS(R↓ )=MHS(R↓ )

General Case:
1 Construct a family K ⊆ R↓ by greedily including (in a certain
order) rectangles in K if they do not form corner-intersection.
2 Since K is a corner-free-intersection family
MHS(K)=MIS(K)≤MIS(R↓ )≤MHS(R↓ ).
3 Compute P a minimum hitting set of K.

Swapping procedure.
If p, q in P, with px < qx and py < qy s.t.
P0 = P \ {p, q} ∪ {(px , qy ), (py , qx )}
is a hitting set for K then set P ← P0 .

We can show that final P is also a hitting set for R↓ .

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 12

Conclusions and Other Results.

Results
p
Get an O(n2.5 log n) time algorithm to compute jump number,
maximum cross-free matching and minimum biclique cover for any
2 d.o.r.g. on n vertices.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 13

Conclusions and Other Results.

Results
p
Get an O(n2.5 log n) time algorithm to compute jump number,
maximum cross-free matching and minimum biclique cover for any
2 d.o.r.g. on n vertices.
For particular subclasses of 2 d.o.r.g.s. (namely biconvex and
convex graphs) we give O(n2 ) algorithm. Previously:
No algorithm for min. biclique cover.
Only O(n9 ) algorithm for jump number and max. cross-free
matching in convex graphs.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 13

Conclusions and Other Results.

Results
p
Get an O(n2.5 log n) time algorithm to compute jump number,
maximum cross-free matching and minimum biclique cover for any
2 d.o.r.g. on n vertices.
For particular subclasses of 2 d.o.r.g.s. (namely biconvex and
convex graphs) we give O(n2 ) algorithm. Previously:
No algorithm for min. biclique cover.
Only O(n9 ) algorithm for jump number and max. cross-free
matching in convex graphs.
Also show that maximum weight cross-free matching is
NP-complete for 2 d.o.r.g.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 13

Conclusions and Other Results.

Results
p
Get an O(n2.5 log n) time algorithm to compute jump number,
maximum cross-free matching and minimum biclique cover for any
2 d.o.r.g. on n vertices.
For particular subclasses of 2 d.o.r.g.s. (namely biconvex and
convex graphs) we give O(n2 ) algorithm. Previously:
No algorithm for min. biclique cover.
Only O(n9 ) algorithm for jump number and max. cross-free
matching in convex graphs.
Also show that maximum weight cross-free matching is
NP-complete for 2 d.o.r.g.
Give O(n3 ) algorithm for weighted problem in biconvex and
convex graphs.

Soto, Telha - MIT Jump Number and Rectangles IPCO 2011 13