Pages that link to "Item:Q3066160"
From MaRDI portal
The following pages link to Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems (Q3066160):
Displaying 12 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)
- 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)
- On the hardness of covering-interdiction problems (Q2031041) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Comparison of \(\alpha\)-Condorcet points with median and center locations (Q5937140) (← links)
