M
Magnús M. Halldórsson
Researcher at Reykjavík University
Publications - 284
Citations - 8251
Magnús M. Halldórsson is an academic researcher from Reykjavík University. The author has contributed to research in topics: Approximation algorithm & Independent set. The author has an hindex of 48, co-authored 281 publications receiving 7830 citations. Previous affiliations of Magnús M. Halldórsson include Japan Advanced Institute of Science and Technology & University of Bergen.
Papers
More filters
Journal ArticleDOI
Approximating maximum independent sets by excluding subgraphs
TL;DR: An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known toO(n/(logn)2), and the results can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems.
Proceedings ArticleDOI
Capacity of Arbitrary Wireless Networks
TL;DR: This work proposes the first scheduling algorithm with approximation guarantee independent of the topology of the network, and proves that the analysis of the algorithm is extendable to higher-dimensional Euclidean spaces, and to more realistic bounded-distortion spaces, induced by non-isotropic signal distortions.
Journal Article
Greed is good : approximating independent sets in sparse and bounded-degree graphs
TL;DR: In this paper, the authors show that the minimum degree greedy algorithm achieves a performance ratio of (Δ+2)/3 for approximating independent sets in graphs with degree bounded by Δ.
Journal ArticleDOI
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
TL;DR: The minimum-degree greedy algorithm is shown to achieve a performance ratio of (Δ+2)/3 for approximating independent sets in graphs with degree bounded by Δ, and a precise characterization of the size of the independent sets found by the algorithm as a function of the independence number is found.
Book ChapterDOI
Approximating Maximum Independent Sets by Excluding Subgraphs
TL;DR: An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to n/(log n)2, and this can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems.