Pages that link to "Item:Q5313046"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313046):
Displaying 11 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- On the Red/Blue Spanning Tree Problem (Q3630196) (← links)
- Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles (Q4981173) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
