Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3089158720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for the multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter approximation scheme for min-max \(k\)-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph \(k\)-cut in randomized polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Submodular Multiway Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cuts and Sparsification in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP Relaxation and Tree Packing for Minimum $k$-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Cut and Minimum <i>k</i>-Cut in Hypergraphs via Branching Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimum multiway cuts in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Contractions and Sampling for Hypergraph and Hedge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Karger-Stein algorithm is optimal for k-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Algorithm for Finding All Minimum <i>k</i>‐Way Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nearly 5/3-approximation FPT Algorithm for Min-<i>k</i>-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Deterministic Approximations for k-Cut. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum 3-way cuts in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy splitting algorithms for approximating multiway partition problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:08, 31 July 2024

scientific article; zbMATH DE number 7639674
Language Label Description Also known as
English
Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time
scientific article; zbMATH DE number 7639674

    Statements

    Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (English)
    0 references
    9 January 2023
    0 references
    hypergraphs
    0 references
    \(k\)-cut
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers