Bansal Nikhil

Nikhil Bansal

Information about the author Nikhil Bansal will soon be added to the site.
Found 10 papers in total
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
2012
Consider a random graph model where each possible edge e is present independently with...
Competitive Algorithms for Due Date Scheduling
Competitive Algorithms for Due Date Scheduling
2011
We consider several online scheduling problems that arise when customers request...
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
2006
We study the following packing problem: Given a collection of d–dimensional...
Job shop scheduling with unit processing times
Job shop scheduling with unit processing times
2006
We consider randomized algorithms for the preemptive job shop problem, or...
Two-dimensional bin packing with one-dimensional resource augmentation
Two-dimensional bin packing with one-dimensional resource augmentation
2007
The two-dimensional bin packing problem is a generalization of the classical bin...
Minimizing makespan in no-wait job shops
Minimizing makespan in no-wait job shops
2005
In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait...
On the average sojourn time under M/M/1/SRPT
On the average sojourn time under M/M/1/SRPT
2005
We study an M/M/1 queueing system under the shortest remaining processing time (SRPT)...
Minimizing flow time on a constant number of machines with preemption
Minimizing flow time on a constant number of machines with preemption
2005
We consider offline algorithms for minimizing the total flow time on O(1) machines...
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
2004
We compare the overall mean response time (a.k.a. sojourn time) of the processor...
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
2003
We analyze the single server processor-sharing queue for the case of bulk arrivals. We...
Papers per page: