Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
From MaRDI portal
(Redirected from Publication:896272)
Recommendations
Cites work
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 3906193 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- A fast hypergraph min-cut algorithm for circuit partitioning
- A near-linear time algorithm for constructing a cactus representation of minimum cuts
- A new approach to the minimum cut problem
- A simple min-cut algorithm
- Algorithmic Aspects of Graph Connectivity
- Complexity of some parametric integer and network programming problems
- Computing All Small Cuts in an Undirected Network
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Cutsets and partitions of hypergraphs
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Lower Bounds in a Parallel Model without Bit Operations
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Minimizing symmetric submodular functions
- Minimum cuts in near-linear time
- Modeling hypergraphs by graphs with the same mincut properties
- Multicriteria Optimization
- Multicriteria global minimum cuts
- On the number of small cut in a graph
- Output-sensitive results on convex hulls, extreme points, and related problems
- Parametric multiple sequence alignment and phylogeny construction
- Sketching cuts in graphs and hypergraphs
- Slicing Space
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
Cited in
(15)- Complexity of source-sink monotone 2-parameter min cut
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
- Algorithms and Computation
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
- Approximating multiobjective optimization problems: how exact can you be?
- An approximation algorithm for a general class of multi-parametric optimization problems
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- Minimum cuts and sparsification in hypergraphs
- Multicriteria global minimum cuts
- Maximum flows in parametric graph templates
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
- Enumerating parametric global minimum cuts by random interleaving
This page was built for publication: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896272)
