The following pages link to (Q4875228):
Displaying 24 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Matching interdiction (Q602686) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- Stability of solutions in problems of computational geometry (Q1974331) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- On the optimum capacity of capacity expansion problems (Q2472185) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry (Q3186829) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) (Q5951977) (← links)
- Modifying networks to obtain low cost trees (Q6550552) (← links)
