Tag: Team seminar
Euler Polytopes and Convex Matroid Optimization
We introduce a novel family of polytopes strengthening bounds relevant to combinatorial optimization and convex matroid optimization. Del Pia and Michini recently improved the upper bound of kd due to Kleinschmidt and Onn for the largest possible diameter of the convex hull of a set of points in dimension d ...
Choosing k best arms in adversarial bandit setting: application to inter-cell Interference Coordination
This talk address to Multi-Armed Bandit problem for Distributed Inter-Cell Interference Coordination. In order to achieve high data rates in future wireless packet switched cellular networks, aggressive frequency reuse is inevitable due to the scarcity of the radio resources. While intra-cell interference is mostly mitigated and can be ignored, inter-cell ...
Locating pairs of vertices on Hamiltonian cycles
We first introduce some of our recent results that generalises Dirac's theorem in Hamiltonian graph theory. Then we will focus on the following conjecture of Enomoto that states that, if \(G\) is a graph of order \(n\) with minimum degree \(delta(G)geq frac{n}{2}+1\), then for ...
« Page 12 / 12