Shortest Cycles With Monotone Submodular Costs

11/09/2022
by   Fedor V. Fomin, et al.
0

We introduce the following submodular generalization of the Shortest Cycle problem. For a nonnegative monotone submodular cost function f defined on the edges (or the vertices) of an undirected graph G, we seek for a cycle C in G of minimum cost =f(C). We give an algorithm that given an n-vertex graph G, parameter ε > 0, and the function f represented by an oracle, in time n^𝒪(log 1/ε) finds a cycle C in G with f(C)≤ (1+ε)·. This is in sharp contrast with the non-approximability of the closely related Monotone Submodular Shortest (s,t)-Path problem, which requires exponentially many queries to the oracle for finding an n^2/3-ε-approximation [Goel et al., FOCS 2009]. We complement our algorithm with a matching lower bound. We show that for every ε > 0, obtaining a (1+ε)-approximation requires at least n^Ω(log 1/ ε) queries to the oracle. When the function f is integer-valued, our algorithm yields that a cycle of cost can be found in time n^𝒪(log). In particular, for =n^𝒪(1) this gives a quasipolynomial-time algorithm computing a cycle of minimum submodular cost. Interestingly, while a quasipolynomial-time algorithm often serves as a good indication that a polynomial time complexity could be achieved, we show a lower bound that n^𝒪(log n) queries are required even when = 𝒪(n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2022

Budgeted Out-tree Maximization with Submodular Prizes

We consider a variant of the prize collecting Steiner tree problem in wh...
research
04/04/2022

An Optimal Algorithm for Certifying Monotone Functions

Given query access to a monotone function f{0,1}^n→{0,1} with certificat...
research
07/09/2022

Improved Lower Bounds for Submodular Function Minimization

We provide a generic technique for constructing families of submodular f...
research
08/10/2021

A Parallel Algorithm for Minimum Cost Submodular Cover

In a minimum cost submodular cover problem (MinSMC), given a monotone no...
research
12/31/2012

Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings

Submodular functions have many applications. Matchings have many applica...
research
06/25/2020

New Approximations and Hardness Results for Submodular Partitioning Problems

We consider the following class of submodular k-multiway partitioning pr...
research
09/09/2021

Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis

We study the problem of finding a minimum homology basis, that is, a sho...

Please sign up or login with your details

Forgot password? Click here to reset