#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1996

2011

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Dimitris Achlioptas, Marek Chrobak, John Noga
- ESA
- 1996

The paging problem is deened as follows: we are given a two-level memory system, in which one level is a fast memory, called cache, capable of holding k items, and the second level is an unbounded but slow memory. At each given time step, a request to an item is issued. Given a request to an item p, a miss occurs if p is not present in the fast memory. In… (More)

- Marek Chrobak, Claire Mathieu, John Noga, Neal E. Young
- LATIN
- 2006

Following Mettu and Plaxton [22, 21], we study oblivious algorithms for the k-medians problem. Such an algorithm produces an incremental sequence of facility sets. We give improved algorithms, including a (24 + ǫ)-competitive deterministic polynomial algorithm and a 2e ≈ 5.44-competitive, randomized, non-polynomial algorithm. Our approach is similar to that… (More)

- John Noga, Steven S. Seiden
- Theor. Comput. Sci.
- 2001

- Marek Chrobak, John Noga
- Algorithmica
- 1998

In the paging problem we have to manage a two-level memory system, in which the rst level has short access time but can hold only up to k pages, while the second level is very large but slow. We use competitive analysis to study the relative performance of the two best known algorithms for paging, LRU and FIFO. Sleator and Tarjan proved that the competitive… (More)

- Leah Epstein, John Noga, Gerhard J. Woeginger
- Oper. Res. Lett.
- 2002

We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an… (More)

We study the problem of online scheduling on two uniform machines with speeds 1 and s 1. For this problem, a 1:61803 competitive de-terministic algorithm was already known. We present the rst randomized results for this problem: We show that randomization does not help for speeds s 2, but does help for all s < 2. We present a simple memoryless randomized… (More)

- Marek Chrobak, Leah Epstein, +4 authors Nodari Vakhania
- ICALP
- 2002

- Csanád Imreh, John Noga
- RANDOM-APPROX
- 1999

- John Noga, Veerawan Sarbua
- 8th International Symposium on Parallel…
- 2005

The knapsack problem can and has been used to model many resource sharing problems. The allocation of a portion of a resource to a particular agent provides a benefit to the system, but also blocks other agents from utilizing that portion of the resource. For a problem where the number of agents as well as each agent's demand and potential benefit are known… (More)