|
ROLE
 Author only
AUTHOR PROFILE PAGES (BETA)
Project background
BOOKMARK & SHARE
|
|
|
|
| Export results as:
BibTeX
EndNotes
ACM Ref
|
| 2009
|
1
|
|
Throughput maximization of real-time scheduling with batching
Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph (Seffi) Naor, Baruch Schieber, Hadas Shachnai
|
|
March 2009
|
|
Transactions on Algorithms (TALG)
, Volume 5 Issue 2
|
|
Publisher: ACM
|
|
Full text available: |
 Pdf
(135.10 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 22, Downloads (12 Months): 144, Citation Count: 0 |
 |
|
We consider the following scheduling with batching problem that has many applications, for example, in multimedia-on-demand and manufacturing of integrated circuits. The input to the problem consists of n jobs and k parallel machines. Each ...
Keywords: Scheduling, batching, local ratio technique
|
| |
|
| 2008
|
2
|
|
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon (Moni) Shahar, Maxim Sviridenko
|
|
June 2008
|
|
Transactions on Algorithms (TALG)
, Volume 4 Issue 3
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(220.73 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 8, Downloads (12 Months): 92, Citation Count: 0 |
|
|
In the rectangle stabbing problem, we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all the rectangles. In this article, we study the capacitated ...
Keywords: Approximation algorithms, capacitated covering, lot sizing, rectangle stabbing
|
| |
|
| 2007
|
3
|
|
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees
Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph (Seffi) Naor, Baruch Schieber
|
|
December 2007
|
|
Theory of Computing Systems
, Volume 42 Issue 1
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
|
|
Service providers rely on the management systems housed in their Network Operations Centers (NOCs) to remotely operate, monitor and provision their data networks. Lately there has been a tremendous increase in management traffic due to the growing complexity ...
Keywords: Combinatorial optimization, Confluent flows, Dynamic programming, Management flows, Network management, Traffic engineering
|
| |
|
4
|
|
Preface
Baruch M. Schieber
|
|
May 2007
|
|
IBM Journal of Research and Development
, Volume 51 Issue 3
|
|
Publisher: IBM Corp.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
|
|
|
|
| |
|
5
|
|
Dynamic pricing for impatient bidders
Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
|
|
January 2007
|
|
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
|
|
Publisher: Society for Industrial and Applied Mathematics
|
|
Full text available: |
Pdf
(389.80 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 3, Downloads (12 Months): 49, Citation Count: 1 |
|
|
We study the following problem related to pricing over time. Assume there is a collection of bidders, each of whom is interested in buying a copy of an item of which there is an unlimited supply. Every bidder is associated with a time interval over which ...
|
| |
|
| 2006
|
6
|
|
Vehicle Routing and Staffing for Sedan Service
Oktay Günlük, Tracy Kimbrel, Laszlo Ladanyi, Baruch Schieber, Gregory B. Sorkin
|
|
August 2006
|
|
Transportation Science
, Volume 40 Issue 3
|
|
Publisher: INFORMS
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
|
|
We present the optimization component of a decision support system developed for a sedan service provider. The system assists supervisors and dispatchers in scheduling driver shifts and routing the fleet throughout the day to satisfy customer demands ...
Keywords: column generation, driver staffing, integer programming, urban transportation services, vehicle routing
|
| |
|
7
|
|
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko
|
|
August 2006
|
|
Journal of Scheduling
, Volume 9 Issue 4
|
|
Publisher: Kluwer Academic Publishers
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0 |
|
|
Suppose that we are given n persistent tasks (jobs) that need to be executed in an equitable way on m processors (machines). Each machine is capable of performing one unit of work ...
Keywords: Fair scheduling, Multiprocessor scheduling, Persistent tasks, Process migration
|
| |
|
8
|
|
A quasi-PTAS for unsplittable flow on line graphs
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber
|
|
May 2006
|
|
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(172.76 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 8, Downloads (12 Months): 45, Citation Count: 2 |
|
|
We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial time approximation scheme for UFP on line graphs, thereby ...
Keywords: approximation algorithms, approximation scheme, resource allocation, scheduling, unsplittable flow
|
| |
|
| 2005
|
9
|
|
Computing the minimum DNF representation of boolean functions defined by intervals
Baruch Schieber, Daniel Geist, Ayal Zaks
|
|
August 2005
|
|
Discrete Applied Mathematics
, Volume 149 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1 |
|
|
For any two n-bit numbers a ≤ b define the Boolean function f[a,b] : {0, 1}n → {0, 1} to be the function for which f[a,b] (x) = 1 if and only if x is the binary ...
Keywords: DNF, automatic test generation, boolean function, constraint satisfaction, disjunctive normal form
|
| |
|
10
|
|
Traffic engineering of management flows by link augmentations on confluent trees
Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber
|
|
July 2005
|
|
SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(207.41 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 1, Downloads (12 Months): 28, Citation Count: 0 |
|
|
Service providers rely on the management systems housed in their Network Operations Centers (NOCs) to remotely operate, monitor and provision their data networks. Lately there has been a tremendous increase in management traffic due to the growing complexity ...
Keywords: approximation algorithms, network management, traffic engineering
|
| |
|
|
|
|
|
