6 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.SC2014★ 3 cited
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals
Jesús A. De Loera, Susan Margulies, Michael Pernpeintner +5
We revisit a well-known family of polynomial ideals encoding the problem of graph--colorability. Our paper describes how the inherent combinatorial structure of the ideals impli…
math.OC2014★ 6 cited
Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model
Reza Eghbali, Jon Swenson, Maryam Fazel
Online optimization problems arise in many resource allocation tasks, where the future demands for each resource and the associated utility functions change over time and are not k…