Pages that link to "Item:Q2947009"
From MaRDI portal
The following pages link to A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009):
Displaying 9 items.
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- (Q6084397) (← links)