Results 71 to 80 of about 2,699,353 (198)
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
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
The expressibility of functions on the Boolean domain, with applications to Counting CSPs [PDF]
, 2013 An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post'
Bulatov, AA +6 more
core +1 more source
Streaming and Matching Problems with Submodular Functions [PDF]
, 2022 Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning.
Garg, Paritosh
core +1 more source
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
CAAI Transactions on Intelligence Technology, Volume 11, Issue 3, Page 920-934, June 2026.ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper, for the univariate Bernstein-Kantorovich-Choquet, Szasz-Kantorovich-Choquet, Baskakov-Kantorovich-Choquet and Bernstein-Durrmeyer-Choquet operators written in terms of the Choquet integrals with respect to monotone and submodular set ...
Sorin Gal
doaj +2 more sources
Approximating Submodular Functions Everywhere
, 2009 URL to paper from conference siteSubmodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle.
Harvey, Nicholas J. A. +7 more
core +1 more source
Polymatroidal tilings and the Chow class of linked projective spaces
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract Linked projective spaces are quiver Grassmannians of constant dimension one of certain quiver representations, called linked nets, over certain quivers, called Zn$\mathbb {Z}^n$‐quivers. They were recently introduced as a tool for describing schematic limits of families of divisors.
Felipe de Leon, Eduardo Esteves
wiley +1 more source
Maximizing bisubmodular and k-submodular functions
, 2013 Submodular functions play a key role in combinatorial optimization and in the study of valued constraint satisfaction problems. Recently, there has been interest in the class of bisubmodular functions, which assign values to disjoint pairs of sets.
Justin Ward +3 more
core +1 more source