Results 71 to 80 of about 13,098 (239)
Improved algorithms for submodular function minimization and submodular flow [PDF]
Very recently, two groups of researchers independently developed the first combinatorial, strongly polynomial-time algorithms for submodular function minimization (Iwata, Fleischer, Fujishige; and Schrijver). In this paper, we improve on these algorithms and show that the ideas generated in the design of these algorithms are helpful in other contexts ...
Lisa Fleischer, Satoru Iwata
openaire +1 more source
The strategic placement and sizing of electric vehicle (EV) charging stations on highways are critical for alleviating range anxiety and fostering widespread EV adoption. This paper presents a novel mixed‐integer linear programming (MILP) model for optimizing the location and capacity of charging stations along highway corridors.
Raka Jovanovic +3 more
wiley +1 more source
We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ...
Krause, Andreas +2 more
core +1 more source
On Some Algorithmic and Structural Results on Flames
ABSTRACT A directed graph F with a root node r is called a flame if for every vertex v other than r the local edge‐connectivity value λ F ( r , v ) from r to v is equal to ϱ F ( v ), the in‐degree of v. It is a classic, simple and beautiful result of Lovász [4] that every digraph D with a root node r has a spanning subgraph F that is a flame and the λ (
Dávid Szeszlér
wiley +1 more source
This paper aims to present an optimization method for the best bus selection (BBS) in the large‐scale power systems in order to send the input signals to the damping controllers.
Mohsen Darabian +2 more
doaj +1 more source
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications [PDF]
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at every step.
Bilmes, Jeff, Iyer, Rishabh
core +1 more source
Streaming Algorithms for Submodular Function Maximization
We consider the problem of maximizing a nonnegative submodular set function $f:2^{\mathcal{N}} \rightarrow \mathbb{R}^+$ subject to a $p$-matchoid constraint in the single-pass streaming setting.
A Badanidiyuru Varadaraja +16 more
core +1 more source
We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call {\em deep submodular functions} or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share
Bilmes, Jeffrey, Bai, Wenruo
openaire +2 more sources
Control Node Placement and Structural Controllability of Water Quality Dynamics in Drinking Networks
Abstract Chlorine, the most widely used disinfectant, needs to be adequately distributed in water distribution networks (WDNs) to maintain consistent residual levels and ensure safe water. This is performed through control node injections at the treatment plant and via booster stations distributed across the WDNs.
Salma M. Elsherif, Ahmad F. Taha
wiley +1 more source
Data and Competition: A Simple Framework
ABSTRACT Does enhanced access to data foster or hinder competition among firms? Using a competition‐in‐utility framework that encompasses many situations where firms use data, we model data as a revenue‐shifter and identify two opposite effects: a mark‐up effect according to which data induces firms to compete harder, and a surplus‐extraction effect ...
Alexandre de Cornière, Greg Taylor
wiley +1 more source

