Spremljaj
Magnús M. Halldórsson
Magnús M. Halldórsson
Professor of Computer Science, Reykjavik University
Preverjeni e-poštni naslov na ru.is - Domača stran
Naslov
Navedeno
Navedeno
Leto
A compendium of NP optimization problems
P Crescenzi, V Kann, M Halldórsson
5291995
Approximating maximum independent sets by excluding subgraphs
R Boppana, MM Halldórsson
BIT Numerical Mathematics 32 (2), 180-196, 1992
4581992
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
M Halldórsson, J Radhakrishnan
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
4341994
A still better performance guarantee for approximate graph coloring
MM Halldórsson
Information Processing Letters 45 (1), 19-23, 1993
3121993
Capacity of arbitrary wireless networks
O Goussevskaia, R Wattenhofer, MM Halldórsson, E Welzl
IEEE INFOCOM 2009, 1872-1880, 2009
3032009
Approximating the domatic number
U Feige, MM Halldórsson, G Kortsarz, A Srinivasan
SIAM Journal on computing 32 (1), 172-195, 2002
2712002
Approximating discrete collections via local improvements
MM Halldórsson
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995
2301995
On chromatic sums and distributed resource allocation
A Bar-Noy, M Bellare, MM Halldórsson, H Shachnai, T Tamir
Information and Computation 140 (2), 183-202, 1998
2191998
Scheduling split intervals
R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira
SIAM Journal on Computing 36 (1), 1-15, 2006
2152006
Greedy local improvement and weighted set packing approximation
B Chandra, MM Halldórsson
Journal of Algorithms 39 (2), 223-240, 2001
2122001
Coloring powers of planar graphs
G Agnarsson, MM Halldórsson
SIAM Journal on Discrete Mathematics 16 (4), 651-662, 2003
2052003
Approximations of weighted independent set and hereditary subset problems
MM Halldórsson
Graph Algorithms And Applications 2, 3-18, 2004
1942004
On spectrum sharing games
MM Halldórsson, JY Halpern, L Li, VS Mirrokni
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
1852004
Approximating the minimum maximal independence number
MM Halldórsson
Information Processing Letters 46 (4), 169-172, 1993
1611993
Wireless Communication is in APX
MM Halldórsson, R Wattenhofer
International Colloquium on Automata, Languages, and Programming, 525-536, 2009
1472009
Wireless capacity with oblivious power in general metrics
MM Halldórsson, P Mitra
Proceedings of the twenty-second annual ACM-SIAM symposium on discrete …, 2011
1362011
Wireless scheduling with power control
MM Halldórsson
ACM Transactions on Algorithms (TALG) 9 (1), 1-20, 2012
1312012
Lower bounds for on-line graph coloring
MM Halldórsson, M Szegedy
Theoretical Computer Science 130 (1), 163-174, 1994
1291994
Approximation algorithms for dispersion problems
B Chandra, MM Halldórsson
Journal of algorithms 38 (2), 438-465, 2001
1102001
Approximation algorithms for the test cover problem
KMJ De Bontridder, BV Halldórsson, MM Halldórsson, CAJ Hurkens, ...
Mathematical Programming 98 (1), 477-491, 2003
1062003
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20