CORE
šŗš¦Ā
Ā make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Solving hard cut problems via flow-augmentation
Authors
Eun Jung Kim
Stefan Kratsch
Marcin Pilipczuk
Magnus Wahlstrƶm
Publication date
17 July 2020
Publisher
'Society for Industrial & Applied Mathematics (SIAM)'
Doi
Cite
View
on
arXiv
Abstract
We present a new technique for designing FPT algorithms for graph cut problems in undirected graphs, which we call flow augmentation. Our technique is applicable to problems that can be phrased as a search for an (edge)
(
s
,
t
)
(s,t)
(
s
,
t
)
-cut of cardinality at most
k
k
k
in an undirected graph
G
G
G
with designated terminals
s
s
s
and
t
t
t
. More precisely, we consider problems where an (unknown) solution is a set
Z
ā
E
(
G
)
Z \subseteq E(G)
Z
ā
E
(
G
)
of size at most
k
k
k
such that (1) in
G
ā
Z
G-Z
G
ā
Z
,
s
s
s
and
t
t
t
are in distinct connected components, (2) every edge of
Z
Z
Z
connects two distinct connected components of
G
ā
Z
G-Z
G
ā
Z
, and (3) if we define the set
Z
s
,
t
ā
Z
Z_{s,t} \subseteq Z
Z
s
,
t
ā
ā
Z
as these edges
e
ā
Z
e \in Z
e
ā
Z
for which there exists an
(
s
,
t
)
(s,t)
(
s
,
t
)
-path
P
e
P_e
P
e
ā
with
E
(
P
e
)
ā©
Z
=
{
e
}
E(P_e) \cap Z = \{e\}
E
(
P
e
ā
)
ā©
Z
=
{
e
}
, then
Z
s
,
t
Z_{s,t}
Z
s
,
t
ā
separates
s
s
s
from
t
t
t
. We prove that in this scenario one can in randomized time
k
O
(
1
)
(
ā£
V
(
G
)
ā£
+
ā£
E
(
G
)
ā£
)
k^{O(1)} (|V(G)|+|E(G)|)
k
O
(
1
)
(
ā£
V
(
G
)
ā£
+
ā£
E
(
G
)
ā£
)
add a number of edges to the graph so that with
2
ā
O
(
k
log
ā”
k
)
2^{-O(k \log k)}
2
ā
O
(
k
l
o
g
k
)
probability no added edge connects two components of
G
ā
Z
G-Z
G
ā
Z
and
Z
s
,
t
Z_{s,t}
Z
s
,
t
ā
becomes a minimum cut between
s
s
s
and
t
t
t
. We apply our method to obtain a randomized FPT algorithm for a notorious "hard nut" graph cut problem we call Coupled Min-Cut. This problem emerges out of the study of FPT algorithms for Min CSP problems, and was unamenable to other techniques for parameterized algorithms in graph cut problems, such as Randomized Contractions, Treewidth Reduction or Shadow Removal. To demonstrate the power of the approach, we consider more generally Min SAT(
Ī
\Gamma
Ī
), parameterized by the solution cost. We show that every problem Min SAT(
Ī
\Gamma
Ī
) is either (1) FPT, (2) W[1]-hard, or (3) able to express the soft constraint
(
u
ā
v
)
(u \to v)
(
u
ā
v
)
, and thereby also the min-cut problem in directed graphs. All the W[1]-hard cases were known or immediate, and the main new result is an FPT algorithm for a generalization of Coupled Min-Cut
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2007.09018
Last time updated on 21/07/2020
Royal Holloway - Pure
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.royalholloway.ac.uk:p...
Last time updated on 22/01/2021
Royal Holloway - Pure
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.royalholloway.ac.uk:p...
Last time updated on 11/02/2024
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 11/08/2021