skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Koenig, Alleen"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. The roots of a plant can be viewed as a graph, with vertices representing points in Euclidean space and edges representing the connective material. Such graphs will ideally be designed in order to optimize one or more relevant objectives. Two objectives that are particularly important for biological reasons include minimizing the total length of the edges in the graph (wiring cost), and minimizing the total lengths of the shortest paths from each point to the root of the graph (conduction delay). These two objectives compete with each other, as optimizing for one objective generally results in poorer performance of the other. Additionally, sensitivity to gravitational forces constrains the curvature of edges in the graph, and by extension how well these objectives can be optimized. In this paper we show how ideas from economics can be used to resolve the tradeoff between competing objectives, and we define a concrete optimization problem that accounts for the role of gravity in constraining the solution space. We then show two techniques for solving this seemingly impossible optimization problem, both of which will be accessible to undergraduate math students. 
    more » « less
    Free, publicly-accessible full text available July 7, 2026