search result

Cover von Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees

Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees

Year: 2015
Media group: LIPIcs
Cover von Approximating Spanning Trees with Few Branches; 1
article : pp. 181-196
Search for this author
Year: 2015
Publisher: Berlin, Springer
Count: 1
Media group: ARTICLE
Cover von Simplification of Polyline Bundles

Simplification of Polyline Bundles

Year: 2020
Media group: LIPIcs
Cover von A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Year: 2019
Media group: LIPIcs
Cover von Approximation Schemes for Geometric Coverage Problems

Approximation Schemes for Geometric Coverage Problems

Year: 2018
Media group: LIPIcs
Cover von Brief Announcement

Brief Announcement

Approximation Schemes for Geometric Coverage Problems
Year: 2018
Media group: LIPIcs
Cover von New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness

New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness

Year: 2016
Media group: LIPIcs
Cover von Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions

Year: 2025
Media group: LIPIcs
Cover von Parameterized Approximation; 7
Algorithms and Hardness : pp. 96-107
Search for this author
Year: 2024
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 7
Media group: DAGSTUHL REPORT
Cover von Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0