Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q127007645, #quickstatements; #temporary_batch_1722788207324
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(96)00046-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026634792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127007645 / rank
 
Normal rank

Latest revision as of 17:17, 4 August 2024

scientific article
Language Label Description Also known as
English
Approximability of maximum splitting of k-sets and some other Apx-complete problems
scientific article

    Statements

    Approximability of maximum splitting of k-sets and some other Apx-complete problems (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    Approximation
    0 references
    Algorithms
    0 references
    Combinatorial problems
    0 references
    Computational complexity
    0 references

    Identifiers