We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...