Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem (Q2835671): 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: W2347083085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions, completeness and the hardness of approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Wafer to Wafer Integration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional vector assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Wafer-to-Wafer Integration / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:14, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem
scientific article

    Statements

    Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vector assignment problem
    0 references
    exact resolution
    0 references
    approximation scheme
    0 references
    NP-hardness
    0 references
    APX-hardness
    0 references
    unique games conjecture
    0 references
    0 references