( en | de | ru )

 

Disambiguation of "Naor, Seffi"

Author of the publication

copydeleteadd this publication to your clipboard
A greedy approximation algorithm for minimum-gap scheduling.

, , , , , and . J. Sched., 20 (3): 279-292 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Naor, Seffi
add a person with the name Naor, Seffi
 

Other publications of authors with the same name

Algorithms for Dynamic NFV Workload., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 238-258. Springer, (2018)A Greedy Approximation Algorithm for Minimum-Gap Scheduling., , , , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 97-109. Springer, (2013)Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks., , , , , and . CoRR, (2021)Structured Robust Submodular Maximization: Offline and Online Algorithms., , , , , and . AISTATS, volume 89 of Proceedings of Machine Learning Research, page 3128-3137. PMLR, (2019)A greedy approximation algorithm for minimum-gap scheduling., , , , , and . J. Sched., 20 (3): 279-292 (2017)Editorial., , , and . Discret. Appl. Math., 156 (4): 410-411 (2008)The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms., , , and . Discret. Appl. Math., 156 (4): 407-408 (2008)Structured Robust Submodular Maximization: Offline and Online Algorithms., , , , , and . INFORMS J. Comput., 33 (4): 1590-1607 (2021)Tight Bounds for Online Weighted Tree Augmentation., , and . Algorithmica, 84 (2): 304-324 (2022)Non-preemptive buffer management for latency sensitive packets., and . J. Sched., 20 (4): 337-353 (2017)