Pages that link to "Item:Q358656"

The following pages link to Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656):

Displaying 18 items.

• Minimum edge blocker dominating set problem (Q319914) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• Blockers for the stability number and the chromatic number (Q489343) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
• Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
• Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• Parametric matroid interdiction (Q6122085) (← links)