Approximating the max-edge-coloring problem (Q986540): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082958680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in switching networks with set-up delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and total coloring of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Max Edge-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs of High Degree are 1-Factorizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating a scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions and preassignments in preemptive open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time slot scheduling of compatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring: further complexity and approximability results / 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: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Coloring Flat Graphs and Thin / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results concerning the complexity of restricted colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Edge Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the max-weight edge coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 02:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximating the max-edge-coloring problem
scientific article

    Statements

    Approximating the max-edge-coloring problem (English)
    0 references
    11 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    max-edge-coloring
    0 references
    approximation algorithms
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references