The Online Submodular Cover Problem

doi 10.1137/1.9781611975994.94
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Whole-Page Optimization and Submodular Welfare Maximization With Online Bidders

ACM Transactions on Economics and Computation
StatisticsProbabilityMarketingEconomicsComputer ScienceComputational MathematicsEconometrics
2016English

Submodular Percolation

SIAM Journal on Discrete Mathematics
Mathematics
2009English

The Minimum K-Cover Problem

Applied Mathematical Sciences
2013English

Submodular Unsplittable Flow on Trees

Mathematical Programming, Series B
MathematicsSoftware
2018English

Submodular Unsplittable Flow on Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Online Ramsey Numbers and the Subgraph Query Problem

Building Bridges II
2019English

The Real Problem: Avatars, Metaphysics and Online Social Interaction

New Media and Society
CommunicationSociologyPolitical Science
2010English

On the Discrete Unit Disk Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Deterministic Algorithms for Submodular Maximization Problems

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy