Approximability and exact resolution of the multidimensional binary vector assignment problem (Q1631661): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2796157151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / 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: 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
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 15:16, 17 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
    6 December 2018
    0 references
    0 references
    approximation algorithm
    0 references
    UGC
    0 references
    inapproximability
    0 references
    dynamic programming
    0 references
    0 references