Pages that link to "Item:Q2904480"
From MaRDI portal
The following pages link to Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations (Q2904480):
Displaying 6 items.
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- On finding orientations with the fewest number of vertices with small out-degree (Q494438) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- Efficient algorithms to solve the link-orientation problem for multi-square, convex-bipartite, and convex-split networks (Q2568262) (← links)
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)