153 citations
- Sobolev Institute of MathematicsRU2 papers
- Arizona State UniversityUS1 paper
- Boston UniversityUS1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Centrum Wiskunde & InformaticaNL1 paper
- Chalmers University of TechnologySE1 paper
- Délégation Paris 7FR1 paper
- DePaul UniversityUS1 paper
- Eindhoven University of TechnologyNL1 paper
- Institute of Mathematics and InformaticsBG1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- IT University of CopenhagenDK1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 9 cited
Approximating Semi-Matchings in Streaming and in Two-Party Communication
Christian Konrad, Adi Rosén
We study the communication complexity and streaming complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E), with n = |A|, is a su…
cs.DS2010
On a game theoretic approach to capacity maximization in wireless networks
Eyjólfur Ingi Ásgeirsson, Pradipta Mitra
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 wireless n…