AI Chat AI Image Generator AI Video Text to Speech

A Note on Optimizing the Ratio of Monotone Supermodular Functions

12/16/2020

∙

by Wenxin Li, et al.

∙

∙

We show that for the problem of minimizing (or maximizing) the ratio of two supermodular functions, no bounded approximation ratio can be achieved via polynomial number of queries, if the two supermodular functions are both monotone non-decreasing or non-increasing.

page 1

page 2

research

∙ 04/22/2018

Towards Practical Constrained Monotone Submodular Maximization

We design new algorithms for maximizing a monotone non-negative submodul...

0 Wenxin Li, et al. ∙

research

∙ 09/30/2021

Polynomial Approximation of Symmetric Functions

We study the polynomial approximation of symmetric multivariate function...

0 Markus Bachmayr, et al. ∙

research

∙ 12/01/2017

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems

For the multi-objective time series search problem, Hasegawa and Itoh [P...

0 Toshiya Itoh, et al. ∙

research

∙ 09/03/2023

(min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences

We study the time complexity of computing the (min,+) matrix product o...

0 Andrzej Lingas, et al. ∙

research

∙ 01/04/2022

Erdős-Selfridge Theorem for Nonmonotone CNFs

In an influential paper, Erdős and Selfridge introduced the Maker-Breake...

0 Md. Lutfar Rahman, et al. ∙

research

∙ 03/11/2023

Binary Search with Distance-Dependent Costs

We introduce a search problem generalizing the typical setting of Binary...

0 Calvin Leng, et al. ∙

research

∙ 04/20/2012

Numerical Analysis of Diagonal-Preserving, Ripple-Minimizing and Low-Pass Image Resampling Methods

Image resampling is a necessary component of any operation that changes ...

0 Chantal Racette, et al. ∙