#### Writes About:

#### Filter Results:

- Full text PDF available (121)

#### Publication Year

2000

2018

- This year (14)
- Last 5 years (103)
- Last 10 years (172)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We propose weakening the assumption made when studying the price of anarchy: Rather than assume that self-interested players will play according to a Nash equilibrium (which may even beâ€¦ (More)

- Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
- MobiHoc
- 2005

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneouslyâ€¦ (More)

This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each agent is assumed toâ€¦ (More)

- Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee
- STOC
- 2005

We develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into L1 (and even Euclideanâ€¦ (More)

We prove semi-logarithmic inapproximability for a maximization problem called <i>unique coverage</i>: given a collection of sets, find a subcollection that maximizes the number of elements coveredâ€¦ (More)

- Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni
- IEEE/ACM Transactions on Networking
- 2003

In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power whileâ€¦ (More)

We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn independently fromâ€¦ (More)

- MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam
- APPROX-RANDOM
- 2010

Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents mustâ€¦ (More)

- Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first non-trivial approximation algorithm for this problem is due to Charikar and Karagiozova (STOC 05);â€¦ (More)