Pages that link to "Item:Q4987446"
From MaRDI portal
The following pages link to Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446):
Displaying 8 items.
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5236247) (redirect page) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Faster algorithms for Steiner tree and related problems: from theory to practice (Q6606515) (← links)
