Better tired than lost: Turtle ant trail networks favor coherence over short edges
A Chandrasekhar, JAR Marshall, C Austin… - PLoS computational …, 2021 - journals.plos.org
Creating a routing backbone is a fundamental problem in both biology and engineering. The
routing backbone of the trail networks of arboreal turtle ants (Cephalotes goniodontus) …
routing backbone of the trail networks of arboreal turtle ants (Cephalotes goniodontus) …
On approximating degree-bounded network design problems
Abstract Directed Steiner Tree (DST) is a central problem in combinatorial optimization and
theoretical computer science: Given a directed graph G=(V, E) with edge costs c∈ R≥ 0 E …
theoretical computer science: Given a directed graph G=(V, E) with edge costs c∈ R≥ 0 E …
Bounded degree group steiner tree problems
G Kortsarz, Z Nutov - International Workshop on Combinatorial Algorithms, 2020 - Springer
Motivated by some open problems posed in 13, we study three problems that seek a low
degree subtree T of a graph G=(V, E). In the Min-Degree Group Steiner Tree problem we are …
degree subtree T of a graph G=(V, E). In the Min-Degree Group Steiner Tree problem we are …
[PDF][PDF] Better tired than lost: turtle ant trail networks favor coherence over shortest paths
A Chandrasekhar, JAR Marshall, C Austin, S Navlakha… - bioRxiv - scholar.archive.org
Better tired than lost: turtle ant trail networks favor coherence over shortest paths Page 1
Manuscript submitted to eLife Better tired than lost: turtle ant trail networks favor coherence over …
Manuscript submitted to eLife Better tired than lost: turtle ant trail networks favor coherence over …
On Approximating Degree-Bounded Network Design Problems
Directed Steiner Tree (DST) is a central problem in combinatorial optimization and
theoretical computer science: Given a directed graph $ G=(V, E) $ with edge costs …
theoretical computer science: Given a directed graph $ G=(V, E) $ with edge costs …
SIGACT News Online Algorithms Column 30: 2016 in review
R van Stee - ACM SIGACT News, 2017 - dl.acm.org
In this column, I will discuss some recent papers in online algorithms that appeared in 2016.
Quite a number of papers on online algorithms appeared during the year, and I have had to …
Quite a number of papers on online algorithms appeared during the year, and I have had to …
Online Decision Making via Prophet Setting
S Ehsani - 2017 - search.proquest.com
In the study of online problems, it is often assumed that there exists an adversary who acts
against the algorithm and generates the most challenging input for it. This worst-case …
against the algorithm and generates the most challenging input for it. This worst-case …