Generalized \(k\)-multiway cut problems (Q2504075): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / 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: Local search and the local structure of NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3088450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Graph Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / 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: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02896389 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973129994 / rank
 
Normal rank

Latest revision as of 11:20, 30 July 2024

scientific article
Language Label Description Also known as
English
Generalized \(k\)-multiway cut problems
scientific article

    Statements

    Generalized \(k\)-multiway cut problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    randomized algorithm
    0 references
    NP-hard problems
    0 references
    local search algorithm
    0 references
    near-optimum approximation algorithms
    0 references
    0 references