Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs (Q6179424): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4385357590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Color Sum of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Clique by Removing Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum edge coloring of multigraphs via configuration LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring of bipartite graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for minimum sum edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Latest revision as of 11:28, 23 August 2024

scientific article; zbMATH DE number 7789713
Language Label Description Also known as
English
Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs
scientific article; zbMATH DE number 7789713

    Statements

    Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs (English)
    0 references
    0 references
    0 references
    16 January 2024
    0 references

    Identifiers