Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Karrenbauer Andreas"'
The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: en
Externí odkaz:
http://arxiv.org/abs/2311.00604
Autor:
Karrenbauer, Andreas, Wennmann, Leonie, Mehlhorn, Kurt, Misra, Pranabendu, Rinaldi, Paolo Luigi, Twelsiek, Anna, Shateranloo, Siavash Rahimi, Haqi, Alireza
Patience Sort sorts a sequence of numbers with a minimal number of queues that work according to the First-In-First-Out (FIFO) principle. More precisely, if the length of the longest descreasing subsequence of the input sequence is $L$, then Patience
Externí odkaz:
http://arxiv.org/abs/2207.02476
Physarum Polycephalum is a slime mold that can solve shortest path problems. A mathematical model based on Physarum's behavior, known as the Physarum Directed Dynamics, can solve positive linear programs. In this paper, we present a family of Physaru
Externí odkaz:
http://arxiv.org/abs/2111.02291
Autor:
Giliberti, Jeff, Karrenbauer, Andreas
The fractional knapsack problem is one of the classical problems in combinatorial optimization, which is well understood in the offline setting. However, the corresponding online setting has been handled only briefly in the theoretical computer scien
Externí odkaz:
http://arxiv.org/abs/2109.04428
Publikováno v:
In: Wu W., Zhang Z. (eds) Combinatorial Optimization and Applications. COCOA 2020. Lecture Notes in Computer Science, vol 12577. Springer, Cham
We study the online problem of reading articles that are listed in an aggregated form in a dynamic stream, e.g., in news feeds, as abbreviated social media posts, or in the daily update of new articles on arXiv. In such a context, the brief informati
Externí odkaz:
http://arxiv.org/abs/2012.04343
Autor:
Bonifaci, Vincenzo, Facca, Enrico, Folz, Frederic, Karrenbauer, Andreas, Kolev, Pavel, Mehlhorn, Kurt, Morigi, Giovanna, Shahkarami, Golnoosh, Vermande, Quentin
Publikováno v:
Theoretical Computer Science 920, pp. 1-20 (2022)
In wet-lab experiments, the slime mold Physarum polycephalum has demonstrated its ability to solve shortest path problems and to design efficient networks. For the shortest path problem, a mathematical model for the evolution of the slime is availabl
Externí odkaz:
http://arxiv.org/abs/2009.01498
Autor:
Dayama, Niraj Ramesh, Shiripour, Morteza, Oulasvirta, Antti, Ivanko, Evgeny, Karrenbauer, Andreas
Computational design of menu systems has been solved in limited cases such as the linear menu (list) as an assignment task, where commands are assigned to menu positions while optimizing for for users selection performance and distance of associated
Externí odkaz:
http://arxiv.org/abs/2005.01292
Autor:
Althaus Ernst, Canzar Stefan, Ehrler Carsten, Emmett Mark R, Karrenbauer Andreas, Marshall Alan G, Meyer-Bäse Anke, Tipton Jeremiah D, Zhang Hui-Min
Publikováno v:
BMC Bioinformatics, Vol 11, Iss 1, p 424 (2010)
Abstract Background Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/Deuterium exchange (sHDX) coupled to high-resolution mass analysis of the digested protein or protein complex. In sHDX experiments m
Externí odkaz:
https://doaj.org/article/a53cebcf6eef41ab8d90ab429f5bced1
The directed Physarum dynamics is known to solve positive linear programs: minimize $c^T x$ subject to $Ax = b$ and $x \ge 0$ for a positive cost vector $c$. The directed Physarum dynamics evolves a positive vector $x$ according to the dynamics $\dot
Externí odkaz:
http://arxiv.org/abs/1906.07781
Let $c \in \mathbb{Z}^m_{> 0}$, $A \in \mathbb{Z}^{n\times m}$, and $b \in \mathbb{Z}^n$. We show under fairly general conditions that the non-uniform Physarum dynamics \[ \dot{x}_e = a_e(x,t) \left(|q_e| - x_e\right) \] converges to the optimum solu
Externí odkaz:
http://arxiv.org/abs/1901.07231