Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CSDP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The image of weighted combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for cardinality constrained portfolio optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-cardinality assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming approaches to facilities layout models with forbidden areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of pfaffians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimum \(K\)-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia characteristics of self-adjoint matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimum capacity cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / 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: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00358-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966902774 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Cardinality constrained minimum cut problems: complexity and algorithms.
scientific article

    Statements

    Cardinality constrained minimum cut problems: complexity and algorithms. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Cut problems
    0 references
    \(k\)-cardinality minimum cut
    0 references
    Cardinality
    0 references
    constrained combinatorial optimization
    0 references
    Computational complexity
    0 references
    Semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers