#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2008

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- S. Anand, Naveen Garg, Amit Kumar
- SODA
- 2012

We propose a general dual-fitting technique for analyzing on-line scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time, and we allow the machines of the on-line algorithm to have (1 + ε)-extra speed than the offline optimum (the so-called speed augmentation model). Typically, such algorithms are… (More)

- S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
- Algorithmica
- 2013

In this paper we initiate the study of job scheduling on related and unrelated machines so as to minimize the maximum flow time or the maximum weighted flow time (when each job has an associated weight). Previous work for these metrics considered only the setting of parallel machines, while previous work for scheduling on unrelated machines only considered… (More)

- S. Anand, Naveen Garg, Nicole Megow
- ICALP
- 2011

We consider the online problem of scheduling real-time jobs with hard deadlines on m parallel machines. Each job has a processing time and a deadline, and the objective is to schedule jobs so that they complete before their deadline. It is known that even when the instance is feasible it may not be possible to meet all deadlines when jobs arrive online over… (More)

- Sesham Anand
- 2014

Factor Analysis is a very useful linear algebra technique used for dimensionality reduction. It is also used for data compression and visualization of high dimensional datasets. This technique tries to identify from among a large set of variables, a reduced set of components which summarizes the original data. This is done by identifying groups of variables… (More)

- Amitabha Bagchi, Jose, S Anand, J Weißl
- 2008

Lecture 7: The critical probability for bond percolation in 2 dimensions is 1 2 7th, 14th and 21th October 2008 7.1 Introduction From percolation theory we know that there exists a probability p c such that ∀p > p c , there exists an infinite component in an infinite mesh and a θ(n 2) component in a n × n mesh with high probability. We saw the Kaklamanis… (More)

We study two variants of the classical strip packing problem, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting stock problem. The first result presented in this paper is an OP T + O(1// 2) approximation scheme for resource augmented strip packing in which we are allowed to increase the width of strip by.… (More)

- ‹
- 1
- ›