skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2209654

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Mathematical Programming)
    Abstract This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline onmidentical machines. The main result is anO(1) competitive deterministic algorithm for any number of machines$$m >1$$ m > 1 . 
    more » « less
    Full Text Available 
  2. ; ; (, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques)
    Accepted Manuscript Full Text Available
  3. ; ; ; (, SIAM Journal on Computing)
    Full Text Available 
  4. ; ; ; (, Symposium on Parallelism in Algorithms and Architectures)
    Accepted Manuscript Full Text Available
  5. ; ; ; (, International Conference on Database Theory)
    Accepted Manuscript Full Text Available
  6. ; ; (, SImplicity in Algorithms)
    Accepted Manuscript Full Text Available
  7. ; ; (, Operations Research Letters)
    Full Text Available 
  8. (, Latin and American Algorithms, Graphs and Optimization Symposium)
    We consider the online transportation problem set in a metric space containing parking garages of various capacities. Cars arrive over time, and must be assigned to an unfull parking garage upon their arrival. The objective is to minimize the aggregate distance that cars have to travel to their assigned parking garage. We show that the natural greedy algorithm, augmented with garages of k >= 3 times the capacity, is O(1)-competitive. 
    more » « less
    Accepted Manuscript Full Text Available