Maximizing Monotone Submodular Functions over the Integer Lattice

@inproceedings{Soma2015MaximizingMS,
  title={Maximizing Monotone Submodular Functions over the Integer Lattice},
  author={Tasuku Soma and Yuichi Yoshida},
  booktitle={IPCO},
  year={2015}
}
  • Tasuku Soma, Yuichi Yoshida
  • Published in IPCO 2015
  • Mathematics, Computer Science
  • The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose that a non-negative monotone submodular function $$f:\mathbb {Z}_+^n \rightarrow \mathbb {R}_+$$ is given via an evaluation oracle. Assume further that f satisfies the diminishing return property, which is not an immediate consequence of the submodularity… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    6
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 10 CITATIONS

    Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization

    VIEW 12 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    On Multiset Selection With Size Constraints

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Submodular Function Maximization over Distributive and Integer Lattices

    VIEW 10 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    Network-based intervention strategies to reduce violence among homeless

    Provable Non-Convex Optimization and Algorithm Validation via Submodularity

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Maximizing Monotone Submodular Functions over the Integer Lattice

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 29 REFERENCES

    Fast algorithms for maximizing submodular functions

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    A note on maximizing a submodular set function subject to a knapsack constraint

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    An analysis of approximations for maximizing submodular set functions—I

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization

    VIEW 1 EXCERPT