Partitioning a weighted partial order (Q927191): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q262242
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Frits C. R. Spieksma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108883059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with bipartite compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch processing with interval graph compatibilities between tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for a Loading Problem with Bounded Clique Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality-restricted chains and antichains in partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004146 / rank
 
Normal rank

Latest revision as of 11:18, 28 June 2024

scientific article
Language Label Description Also known as
English
Partitioning a weighted partial order
scientific article

    Statements

    Partitioning a weighted partial order (English)
    0 references
    0 references
    0 references
    4 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partially ordered sets
    0 references
    chain decomposition
    0 references
    approximation algorithms
    0 references
    0 references