Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of matroid theory in operations research, circuits and systems theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principal lattice of partitions of a submodular function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4246752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank

Latest revision as of 21:46, 29 July 2024

scientific article; zbMATH DE number 7573215
Language Label Description Also known as
English
Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
scientific article; zbMATH DE number 7573215

    Statements

    Identifiers