#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2002

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Eyjólfur Ingi Ásgeirsson, Pradipta Mitra
- 2011 Proceedings IEEE INFOCOM
- 2011

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wirelessnetworks where a… (More)

An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control,… (More)

- Eyjólfur Ingi Ásgeirsson
- Annals OR
- 2014

Every company that has employees working on irregular schedules must deal with the difficult and time consuming problem of creating feasible schedules for the employees. We introduce an algorithm… (More)

- Eyjólfur Ingi Ásgeirsson, Clifford Stein
- J. Scheduling
- 2009

In this paper, we look at the online bounded-space bin cover problem and show how we can use the language of Markov chains to model and analyze the problem. We will use the insights given by the… (More)

- Helga Gudmundsdottir, Eyjólfur Ingi Ásgeirsson, +5 authors Ymir Vigfusson
- ArXiv
- 2013

Modeling physical layer behavior of packet reception in the presence of interference is central to achieving effic ient spectrum use in wireless sensor networks via spatial reuse. On one hand,… (More)

- Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Pradipta Mitra
- 2012 46th Annual Conference on Information…
- 2012

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of… (More)

- Eyjólfur Ingi Ásgeirsson, Clifford Stein
- ALENEX
- 2006

We show how the on-line bounded-space bin cover problem can be modeled with a Markov chain. We then use this Markov chain formulation to derive an algorithm for the on-line bounded-space bin cover… (More)

Efficient spectrum use in wireless sensor networks through spatial reuse requires effective models of packet reception at the physical layer in the presence of interference. Despite recent progress… (More)

- Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Pradipta Mitra
- 2014 12th International Symposium on Modeling and…
- 2014

We present a framework for the maximum flow problem in wireless networks using the SINR interference model in combination with MIMO nodes. The performance ratio of our algorithm matches the best… (More)

- Eyjólfur Ingi Ásgeirsson, Clifford Stein
- SIAM J. Discrete Math.
- 2009

The vertex cover problem is a classical NP-complete problem for which the best worstcase approximation ratio is 2−o(1). In this paper, we use a collection of simple graph transformations, each of… (More)