An accelerated continuous greedy algorithm for maximizing strong submodular functions

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Journal of combinatorial optimization

• Publication date

  2013-12-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10878-013-9685-x
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint

  2012cited by this paper
• The Power of Local Search: Maximum Coverage over a Matroid

  2012cited by this paper
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

  2011influential reference
• Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms

  2011cited by this paper
• You Share, I Share: Network Effects and Economic Incentives in P2P File-Sharing Systems

  2010cited by this paper
• Submodularity and Curvature: The Optimal Algorithm

  2010cited by this paper
• Maximizing submodular set functions subject to multiple linear constraints

  2009cited by this paper
• Submodular Functions: Extensions, Distributions, and Algorithms. A Survey

  2009cited by this paper
• Submodularity and curvature : the optimal algorithm

  2008influential reference
• Optimal approximation for the submodular welfare problem in the value oracle model

  2008cited by this paper
• Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions

  2008cited by this paper
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

  2007cited by this paper
• Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

  2005cited by this paper
• Submodularity, Supermodularity, and Higher-Order Monotonicities of Pseudo-Boolean Functions

  2005cited by this paper
• A note on maximizing a submodular set function subject to a knapsack constraint

  2004cited by this paper
• Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

  2004cited by this paper
• Combinatorial auctions with decreasing marginal utilities

  2001cited by this paper
• A threshold of ln n for approximating set cover (preliminary version)

  1996cited by this paper
• A Characterization of a Cone of Pseudo-Boolean Functions via Supermodularity-Type Inequalities

  1989cited by this paper
• Best Algorithms for Approximating the Maximum of a Submodular Set Function

  1978cited by this paper
• An analysis of approximations for maximizing submodular set functions—I

  1978influential reference
• Comments on bases in dependence structures

  1969cited by this paper

• Multi-Robot Planning for Filming Groups of Moving Actors Leveraging Submodularity and Pixel Density

  2024cites this paper
• Resource-Aware Distributed Submodular Maximization: A Paradigm for Multi-Robot Decision-Making

  2022cites this paper
• Sensor Planning for Large Numbers of Robots

  2021influential citation
• A balanced sensor scheduling for multitarget localization in a distributed multiple-input multiple-output radar network

  2021cites this paper
• Fully-Dynamic Submodular Cover with Bounded Recourse

  2020cites this paper
• Fast Non-Monotone Submodular Maximisation Subject to a Matroid Constraint

  2017cites this paper
• Weapon target assignment leveraging strong submodularity

  2013cites this paper