Parameterized complexity of submodular minimization under uncertainty
From MaRDI portal
Cites work
- A faster cutting plane method and its implications for combinatorial and convex optimization
- A faster strongly polynomial time algorithm for submodular function minimization
- A linear time algorithm for the robust recoverable selection problem
- A note on the traveling salesman reoptimization problem under vertex insertion
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete Convex Analysis
- Fast reoptimization for the minimum spanning tree problem
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 7803597 (Why is no real title available?)
- Matroid bases with cardinality constraints on the intersection
- Most balanced minimum cuts
- Multi-budgeted directed cuts
- On covering problems of codes
- On the structure of all minimum cuts in a network and applications
- Parameterized algorithms
- Parameterized complexity of submodular minimization under uncertainty
- Recoverable robust shortest path problems
- Recoverable robust spanning tree problem under interval uncertainty representations
- Rings of sets
- Robust recoverable perfect matchings
- Steiner tree reoptimization in graphs with sharpened triangle inequality
- Submodular reassignment problem for reallocating agents to tasks with synergy effects
- The complexity of satisfiability problems
- The concept of recoverable robustness, linear programming recovery, and railway applications
Cited in
(2)
This page was built for publication: Parameterized complexity of submodular minimization under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891116)
