Poly-logarithmic Competitiveness for the k-Taxi Problem

Gupta, Anupam; Kumar, Amit; Panigrahi, Debmalya

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, January 16 until 2:00 AM ET on Friday, January 17 due to maintenance. We apologize for the inconvenience.

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

+ Advanced Search

Citation Details

Poly-logarithmic Competitiveness for the k-Taxi Problem

Award ID(s):: 2224718 2422926

PAR ID:: 10556292

Author(s) / Creator(s):: Gupta, Anupam; Kumar, Amit; Panigrahi, Debmalya

Publisher / Repository:: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Date Published:: 2024-01-01

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this