Greedy splitting algorithms for approximating multiway partition problems (Q1769071): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counterexamples for Directed and Node Capacitated Cut-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new and improved algorithm for the 3-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm of MULTIWAY CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on formulations for the \(A\)-partition problem on hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / 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: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / 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: Partitions and network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474133 / rank
 
Normal rank

Latest revision as of 19:54, 7 June 2024

scientific article
Language Label Description Also known as
English
Greedy splitting algorithms for approximating multiway partition problems
scientific article

    Statements

    Greedy splitting algorithms for approximating multiway partition problems (English)
    0 references
    0 references
    0 references
    0 references
    17 March 2005
    0 references
    0 references
    Approximation algorithm
    0 references
    Hypergraph partition
    0 references
    Multiterminal cut
    0 references
    Multiway partition problem
    0 references
    Submodular function
    0 references
    0 references