OpenAlex | A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Work

Year: 2018

Type: article

Source: International Colloquium on Automata, Languages and Programming

Authors Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal

Institutions Technion – Israel Institute of Technology, University of Würzburg, Aalto University

Cites:

Cited by: 2

Related to: 20

FWCI: 0.44

Citation percentile (by year/subfield): 42.85

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed