Results 71 to 80 of about 1,352 (208)
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
CoRR, 2015 15 pages, 1 figure, a short version of this will appear in the NIPS 2015 ...
Jennifer Gillenwater +4 more
openaire +4 more sources
Complete Submodularity Characterization in the Comparative Independent Cascade Model [PDF]
, 2020 . We study the propagation of comparative ideas in social network. A full characterization for submodularity in the comparative independent cascade (Com-IC) model of two-idea cascade is given, for competing ideas and complementary ideas respectively.
Hanrui Zhang, Wei Chen
core
Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression [PDF]
, 2022 We study the following problem: Given a variable of interest, we would like to find a best linear predictor for it by choosing a subset of k relevant variables obeying a matroid constraint.
Ward, J +2 more
core +2 more sources
Complexity and accessibility of random landscapes
SciPost Physics Lecture NotesThese notes introduce probabilistic landscape models defined on high-dimensional discrete sequence spaces. The models are motivated primarily by fitness landscapes in evolutionary biology, but links to statistical physics and computer science are ...
Sakshi Pahujani, Joachim Krug
doaj +1 more source
On a Connection between Information and Group Lattices
Entropy, 2011 In this paper we review a particular connection between information theory and group theory. We formalize the notions of information elements and information lattices, first proposed by Shannon.
Edwin K. P. Chong, Hua Li
doaj +1 more source
Lower bounds for cube‐ideal set‐systems
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi +3 more
wiley +1 more source
Migration as Submodular Optimization
Proceedings of the AAAI Conference on Artificial Intelligence, 2019 Migration presents sweeping societal challenges that have recently attracted significant attention from the scientific community. One of the prominent approaches that have been suggested employs optimization and machine learning to match migrants to localities in a way that maximizes the expected number of migrants who find employment.
Paul Gölz, Ariel D. Procaccia
openaire +5 more sources
Efficient investment, search, and sorting in matching markets
Theoretical Economics, Volume 21, Issue 3, Page 810-848, July 2026.We study markets where heterogeneous agents first make investment decisions and then engage in a costly search to form productive matches. The trading process is a random search and bargaining with explicit search costs. Despite potential hold‐up and matching problems, we prove that the constrained efficient allocation is an equilibrium: the agents ...
Alp Atakan, Michael Richter, Matan Tsur
wiley +1 more source
Certifying Submodularity with Algebraic Techniques Submodularity is a structural property encoding the notion of diminishing returns, that is, the benefits one gets from an additional element decrease when many elements have been chosen.
Anna Deza, Georgina Hall
core +1 more source