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 10 of 10 for “"submodular functions"”.
-
Matchings, matroids and submodular functions
… matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing perfect or …
-
Scheduling to minimize power consumption using submodular functions
… for logarithmic approximation to maximizing any submodular function subject to budget constraints. We also introduce the online version of this scheduling problem, and show its relation to the classical secretary problem. In order to obtain constant competitive algorithms for this online version, …
-
LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING
… a sum-max function, a rich subclass of monotone submodular functions. We design an algorithm for this bandit problem, and prove it achieves significant improvement in regret with respect to standard algorithms for monotone submodular functions. Finally, we consider the Stochastic Shortest Path …
-
Combinatorial structures in online and convex optimization
… the minimization of separable strictly convex functions over polyhedra. This problem is motivated by first-order optimization methods whose bottleneck relies on the minimization of a (often) separable, convex metric, known as the Bregman divergence. We provide a conceptually simple algorithm, …
-
Contributions on secretary problems, independent sets of rectangles and related problems
… of finding nonempty minimizers of a symmetric submodular function over any family of sets closed under inclusion. We give an efficient O(ns)-time algorithm for this task, based on Queyranne's pendant pair technique for minimizing unconstrained symmetric submodular functions. We extend this …
-
Approximation algorithms for submodular optimization and graph problems
… combinatorial optimization problems involving submodular functions and graphs. The problems we study are NP-hard and therefore, assuming that P =/= NP, there do not exist polynomial-time algorithms that always output an optimal solution. In order to cope with the intractability of these …
-
Parsimonious, Risk-Aware, and Resilient Multi-Robot Coordination
… in the coordination achieved by means of submodular function optimization. Submodularity encodes the diminishing returns property that arises in multi-robot coordination. For example, the marginal gain of assigning an additional robot to track the same target diminishes as the number of …
-
Layering principles for wireless networks
… at a node are further jointly constrained by a submodular function. While a max-flow min-cut theorem for unicast traffic is known for polymatroidal networks, multiple-unicast traffic has not been studied prior to this work. A key technical contribution of this thesis is an approximate max-flow …
-
Optimization problems in networks and queues
… dynamic resource allocation with concave cost functions that capture user dissatisfaction from resource shortfalls. We analyze two non-convex optimization problems in this domain and present polynomial-time algorithms with provable guarantees on reaching their respective global optima. This …
-
Algorithmic aspects of connectivity and density in graphs and hypergraphs
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms