Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Constrained submodular maximization"”.

  1. Submodular Optimization and Data Processing

    … this dissertation, we investigate how to apply submodularity to these two data processing paradigms. In the first part of this thesis, we study the connection of submodularity to the data summarization paradigm. First we show that data summarization subsumes a number of applications, including …

    washington Repository record for Submodular Optimization and Data Processing (opens in a new tab)

  2. Optimization and separation for structured submodular functions with constraints

    … marginal returns. Such a property is known as submodularity. Vast amount of work has been devoted to the problem of submodular optimization. In this thesis, we exploit structural information for several classes of submodular optimization problems. We strive for polynomial time algorithms with …

    gatech Repository record for Optimization and separation for structured submodular functions with constraints (opens in a new tab)

  3. COORDINATION AND LEARNING ALGORITHMS FOR MULTI-ROBOT INFORMATION GATHERING

    … team. We present an algorithm for connectivity-constrained submodular maximization for information gathering that requires intermittent communication among the robotic team. For the case where the environment is partially known, and uncertainty exists, we seek to make the multi-robot team robust …

    maryland Repository record for COORDINATION AND LEARNING ALGORITHMS FOR MULTI-ROBOT INFORMATION GATHERING (opens in a new tab)

  4. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization

    … the online bipartite matching problem and the constrained submodular function maximization problem. In the first part of this thesis, we consider novel polyhedral approaches for the i.i.d. online variant of the classical bipartite matching problem defined as follows: one side of the bipartition …

    gatech Repository record for Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization (opens in a new tab)

  5. Submodular optimization with constraints and fairness: Algorithmic advances and applications

    Submodular function optimization is a fundamental tool for modeling complex interactions in machine learning and graph mining. In this thesis, we investigate constrained submodular maximization problems, their variants, and $k$-submodular maximization problems with size constraints and fairness …

    iastate Repository record for Submodular optimization with constraints and fairness: Algorithmic advances and applications (opens in a new tab)