The following pages link to Nachshon Cohen (Q388115):
Displaying 6 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- CBPQ: high performance lock-free priority queue (Q1693224) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
