2 citations · 2 across the 2 of their papers we have counts for
3 papers
On semiring complexity of Schur polynomials
Sergey Fomin, Dima Grigoriev, Dorian Nogneng +1
Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed…
Scheduling with Gaps: New Models and Algorithms
Marek Chrobak, Mordecai Golin, Tak-Wah Lam +1
We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, either in the objective function…
Better Approximation Bounds for the Joint Replenishment Problem
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak +2
The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to retailers through a shared warehouse. Each shipment involves transporting goods fr…