scientific article; zbMATH DE number 871953
From MaRDI portal
Publication:4875228
zbMath0849.68096MaRDI QIDQ4875228
Roberto Solis-Oba, Greg N. Frederickson
Publication date: 28 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Minimum cost edge blocker clique problem ⋮ Minimum edge blocker dominating set problem ⋮ Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry ⋮ Critical edges/nodes for the minimum spanning tree problem: complexity and approximation ⋮ Matching interdiction ⋮ A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ The most vital nodes with respect to independent set and vertex cover ⋮ An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance ⋮ Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Critical edges for the assignment problem: complexity and exact resolution ⋮ A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths ⋮ Stability of solutions in problems of computational geometry ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance ⋮ Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures ⋮ Blockers for the stability number and the chromatic number ⋮ On the optimum capacity of capacity expansion problems ⋮ Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem ⋮ Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm ⋮ Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\) ⋮ Improving spanning trees by upgrading nodes ⋮ On budget-constrained flow improvement.
This page was built for publication:
