Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs.

Sanjeev Khanna Aaron (Louie) Putterman Madhu Sudan

Published in: ICALP (2024)

Keyphrases

tight bounds
upper bound
greedy algorithm
worst case
computer vision
graph theory
training data
lower bound
database
training set
data dependencies
approximation algorithms
markov random field
image features
multiscale
website
image processing
information retrieval
databases