2 Search Results for "Gustedt, Jens"

Document
Track A: Algorithms, Complexity and Games
Computing Tree Decompositions with Small Independence Number

Authors: Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Martin Milanič

Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)

Abstract
The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum weight independent set, can be solved in time n^𝒪(k) if the input n-vertex graph is given together with a tree decomposition of independence number k. Yolov in [SODA 2018] gave an algorithm that given an n-vertex graph G and an integer k, in time n^𝒪(k³) either constructs a tree decomposition of G whose independence number is 𝒪(k³) or correctly reports that the tree-independence number of G is larger than k. In this paper, we first give an algorithm for computing the tree-independence number with a better approximation ratio and running time and then prove that our algorithm is, in some sense, the best one can hope for. More precisely, our algorithm runs in time 2^𝒪(k²) n^𝒪(k) and either outputs a tree decomposition of G with independence number at most 8k, or determines that the tree-independence number of G is larger than k. This implies 2^𝒪(k²) n^𝒪(k)-time algorithms for various problems, like maximum weight independent set, parameterized by the tree-independence number k without needing the decomposition as an input. Assuming Gap-ETH, an n^Ω(k) factor in the running time is unavoidable for any approximation algorithm for the tree-independence number. Our second result is that the exact computation of the tree-independence number is para-NP-hard: We show that for every constant k ≥ 4 it is NP-hard to decide if a given graph has the tree-independence number at most k.

Cite as

Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Martin Milanič. Computing Tree Decompositions with Small Independence Number. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 51:1-51:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

```@InProceedings{dallard_et_al:LIPIcs.ICALP.2024.51,
author =	{Dallard, Cl\'{e}ment and Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Tuukka and Milani\v{c}, Martin},
title =	{{Computing Tree Decompositions with Small Independence Number}},
booktitle =	{51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages =	{51:1--51:18},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-322-5},
ISSN =	{1868-8969},
year =	{2024},
volume =	{297},
editor =	{Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.51},
URN =		{urn:nbn:de:0030-drops-201945},
doi =		{10.4230/LIPIcs.ICALP.2024.51},
annote =	{Keywords: tree-independence number, approximation, parameterized algorithms}
}```
Document
Data Handover: Reconciling Message Passing and Shared Memory

Authors: Jens Gustedt

Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)

Abstract
Data Handover (DHO) is a programming paradigm and interface that aims to handle data between parallel or distributed processes that mixes aspects of message passing and shared memory. It is designed to overcome the potential problems in terms of efficiency of both: (1) memory blowup and forced copies for message passing and (2) data consistency and latency problems for shared memory. Our approach attempts to be simple and easy to understand. It contents itself with just a handful of functions to cover the main aspects of coarse grained inter-operation upon data.

Cite as

Jens Gustedt. Data Handover: Reconciling Message Passing and Shared Memory. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

```@InProceedings{gustedt:DagSemProc.05081.3,
author =	{Gustedt, Jens},
title =	{{Data Handover: Reconciling Message Passing and Shared Memory}},
booktitle =	{Foundations of Global Computing},
pages =	{1--13},
series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN =	{1862-4405},
year =	{2006},
volume =	{5081},
editor =	{Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.3},
URN =		{urn:nbn:de:0030-drops-2977},
doi =		{10.4230/DagSemProc.05081.3},
annote =	{Keywords: Efficient data management, message passing, shared memory}
}```
• Refine by Author
• 1 Dallard, Clément
• 1 Fomin, Fedor V.
• 1 Golovach, Petr A.
• 1 Gustedt, Jens
• 1 Korhonen, Tuukka

• Refine by Classification
• 1 Mathematics of computing → Graph algorithms
• 1 Theory of computation → Graph algorithms analysis
• 1 Theory of computation → Parameterized complexity and exact algorithms

• Refine by Keyword
• 1 Efficient data management
• 1 approximation
• 1 message passing
• 1 parameterized algorithms
• 1 shared memory

• Refine by Type
• 2 document

• Refine by Publication Year
• 1 2006
• 1 2024

X

Feedback for Dagstuhl Publishing