Search Results - "Schieber, Baruch"

The preemptive resource allocation problem.

Authors: Sarpatwar, Kanthi Schieber, Baruch Shachnai, Hadas

Source: Journal of Scheduling; Feb2024, Vol. 27 Issue 1, p103-118, 16p

Just-in-time scheduling in two-stage flexible flow shops.

Authors: Heeger, Klaus Hermelin, Danny Itzhaki, Yuval et al.

Source: European Journal of Operational Research; Sep2026, Vol. 333 Issue 3, p652-664, 13p

Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput.

Authors: Schieber, Baruch Samineni, Bhargav Vahidi, Soroush

Source: Algorithmica; Oct2025, Vol. 87 Issue 10, p1453-1473, 21p

Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.

Authors: Even, Guy Guha, Sudipto Schieber, Baruch

Source: SIAM Journal on Computing; 2002, Vol. 32 Issue 1, p231-252, 22p

Navigating in unfamiliar geometric terrain.

Authors: Blum, Avrim Raghavan, Prabhakar Schieber, Baruch

Source: SIAM Journal on Computing; February 1997, Vol. 26, p110-137, 28p

Fully Dynamic MIS in Uniformly Sparse Graphs.

Authors: ONAK, KRZYSZTOF SCHIEBER, BARUCH SOLOMON, SHAY et al.

Source: ACM Transactions on Algorithms; Mar2020, Vol. 16 Issue 2, p1-19, 19p

Guaranteeing fair service to persistent dependent tasks.

Authors: Bar-Noy, Amotz Mayer, Alain Schieber, Baruch

Source: SIAM Journal on Computing; August 1998, Vol. 27 Issue 4, p1168-1189, 22p

The Euclidean k-Supplier Problem.

Authors: Nagarajan, Viswanath Schieber, Baruch Shachnai, Hadas

Source: Mathematics of Operations Research (INFORMS); Feb2020, Vol. 45 Issue 1, p1-14, 14p

Flexible Resource Allocation to Interval Jobs.

Authors: Katz, Dmitriy Schieber, Baruch Shachnai, Hadas

Source: Algorithmica; Aug2019, Vol. 81 Issue 8, p3217-3244, 28p

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

Authors: ADANY, RON FELDMAN, MORAN HARAMATY, ELAD et al.

Source: ACM Transactions on Algorithms; Apr2016, Vol. 12 Issue 3, p1-25, 25p

Dynamic Pricing for Impatient Bidders.

Authors: Bansal, Nikhil Ning Chen Cherniavsky, Neva et al.

Source: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p35:1-35:21, 21p, 2 Diagrams, 1 Chart

Throughput Maximization of Real-Time Scheduling with Batching.

Authors: BAR-NOY, AMOTZ GUHA, SUDIPTO KATZ, YOAV et al.

Source: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 2, p18-18:17, 17p

Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs.

Authors: EVEN, GUY LEVI, RETSEF RAWITZ, DROR et al.

Source: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p34-34:17, 17p, 3 Diagrams

MESSAGE MULTICASTING IN HETEROGENEOUS NETWORKS.

Authors: Bar-Noy, Amotz Guha, Sudito Naor, Joseph (Seffi) et al.

Source: SIAM Journal on Computing; 2000, Vol. 30 Issue 2, p347, 12p

APPROXIMATING MINIMUM SUBSET FEEDBACK SETS IN UNDIRECTED GRAPHS WITH APPLICATIONS.

Authors: Even, Guy Naor, Joseph Schieber, Baruch et al.

Source: SIAM Journal on Discrete Mathematics; 2000, Vol. 13 Issue 2, p255-267, 13p, 1 Diagram

Complexity and inapproximability results for the Power Edge Set problem.

Authors: Toubaline, Sonia D’Ambrosio, Claudia Liberti, Leo et al.

Source: Journal of Combinatorial Optimization. Apr2018, Vol. 35 Issue 3, p895-905. 11p.

MINIMIZING SERVICE AND OPERATION COSTS OF PERIODIC SCHEDULING.

Authors: Bar-Noy, Amotz Bhatia, Randeep Naor, Joseph (Seffi) et al.

Source: Mathematics of Operations Research (INFORMS). Aug2002, Vol. 27 Issue 3, p518. 27p.

Vehicle Routing and Staffing for Sedan Service.

Authors: Gunluk, Oktay Kimbrel, Tracy Ladanyi, Laszlo et al.

Source: Transportation Science (INFORMS). Aug2006, Vol. 40 Issue 3, p313-326. 14p. 2 Charts, 1 Graph.

BUFFER OVERFLOW MANAGEMENT IN QoS SWITCHES.

Authors: Kesselman, Alexander Lotker, Zvi Mansour, Yishay et al.

Source: SIAM Journal on Computing. 2004, Vol. 33 Issue 2, p563-583. 21p.

APPROXIMATING THE THROUGHPUT OF MULTIPLE MACHINES IN REAL-TIME SCHEDULING.

Authors: Bar-Noy, Amotz Guha, Sudipto Naor, Joseph et al.

Source: SIAM Journal on Computing. 2001, Vol. 31 Issue 2, p331. 22p.