Zobrazeno 1 - 10
of 381
pro vyhledávání: '"Marx, Daniel"'
From Chinese Postman to Salesman and Beyond: Shortest Tour $\delta$-Covering All Points on All Edges
A well-studied continuous model of graphs considers each edge as a continuous unit-length interval of points. For $\delta \geq 0$, we introduce the problem $\delta$-Tour, where the objective is to find the shortest tour that comes within a distance o
Externí odkaz:
http://arxiv.org/abs/2410.10613
A graph property is a function $\Phi$ that maps every graph to {0, 1} and is invariant under isomorphism. In the $\#IndSub(\Phi)$ problem, given a graph $G$ and an integer $k$, the task is to count the number of $k$-vertex induced subgraphs $G'$ with
Externí odkaz:
http://arxiv.org/abs/2407.06801
The Electron-Ion Collider (EIC) plans to utilize the local crabbing crossing scheme. This paper explores the feasibility of adopting a single crab cavity with adjusted voltage, inspired by the successful global crabbing scheme in KEKB, to restore eff
Externí odkaz:
http://arxiv.org/abs/2405.08676
Autor:
Focke, Jacob, Frei, Fabian, Li, Shaohua, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Węgrzycki, Karol
We study a general family of problems that form a common generalization of classic hitting (also referred to as covering or transversal) and packing problems. An instance of X-HitPack asks: Can removing k (deletable) vertices of a graph G prevent us
Externí odkaz:
http://arxiv.org/abs/2402.14927
It is known for many algorithmic problems that if a tree decomposition of width $t$ is given in the input, then the problem can be solved with exponential dependence on $t$. A line of research by Lokshtanov, Marx, and Saurabh [SODA 2011] produced low
Externí odkaz:
http://arxiv.org/abs/2402.07331
The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of $G$ such that wheneve
Externí odkaz:
http://arxiv.org/abs/2312.11086
We study the parameterized complexity of #IndSub($\Phi$), where given a graph $G$ and an integer $k$, the task is to count the number of induced subgraphs on $k$ vertices that satisfy the graph property $\Phi$. Focke and Roth [STOC 2022] completely c
Externí odkaz:
http://arxiv.org/abs/2311.08988
Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n^{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any computable fu
Externí odkaz:
http://arxiv.org/abs/2311.05913
In a recent work, Esmer et al. describe a simple method - Approximate Monotone Local Search - to obtain exponential approximation algorithms from existing parameterized exact algorithms, polynomial-time approximation algorithms and, more generally, p
Externí odkaz:
http://arxiv.org/abs/2308.15306
The goal of this paper is to understand how exponential-time approximation algorithms can be obtained from existing polynomial-time approximation algorithms, existing parameterized exact algorithms, and existing parameterized approximation algorithms
Externí odkaz:
http://arxiv.org/abs/2306.15331