Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a...
Phylogenetic Trees
Light Acquisition
Reducing Line Loss
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss...
Accuracy, limits, and approximation
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...
Basic Plant Anatomy: Roots, Stems, and Leaves
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid.
A technique for obtaining true approximations for <i>k</i>-center with covering constraints.
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint.
A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs.
A first order method for linear programming parameterized by circuit imbalance.
Accelerated first-order optimization under nonlinear constraints.
Related Experiment Video
Updated: Jun 17, 2025

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Better-than- -approximations for leaf-to-leaf tree and connectivity augmentation.
Federica Cecchetto1, Vera Traub2, Rico Zenklusen1
1Department of Mathematics, ETH Zurich, Zurich, Switzerland.
We developed a simple matching-based method for network design problems, specifically the leaf-to-leaf Connectivity Augmentation Problem (CAP). This new approach achieves a better approximation factor, improving upon existing techniques for CAP and TAP instances.
Area of Science:
- Computer Science
- Operations Research
- Algorithm Design
Background:
- The Connectivity Augmentation Problem (CAP) and Tree Augmentation Problem (TAP) are fundamental network design challenges.
- Recent research focuses on approximation algorithms with factors below 2, with the current best at 1.393.
Purpose of the Study:
- To present a novel, simple matching-based method for leaf-to-leaf instances of CAP.
- To improve approximation factors for specific CAP and TAP problem classes.
Main Methods:
- A new matching-based algorithm for leaf-to-leaf CAP instances.
- Combining the new method with existing techniques and a stack analysis approach.
Main Results:
- Achieved a -approximation for Leaf-to-Leaf CAP by selecting the better of the new solution and an existing one.
- Improved the approximation factor to 1.29 for a nontrivial class of TAP/CAP instances, surpassing the threshold.
Conclusions:
- The new matching-based method offers a simpler approach to CAP and TAP.
- The improved approximation factor of 1.29 represents a significant advancement for specific network design problems.

