Pages that link to "Item:Q5716853"

The following pages link to Automata, Languages and Programming (Q5716853):

Displaying 23 items.

• Max-coloring paths: tight bounds and extensions (Q454245) (← links)
• On the max-weight edge coloring problem (Q613668) (← links)
• On the max coloring problem (Q690449) (← links)
• Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
• On-line chain partitions of orders: a survey (Q766153) (← links)
• Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
• Approximating the max-edge-coloring problem (Q986540) (← links)
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
• Weighted coloring: further complexity and approximability results (Q1045908) (← links)
• Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
• Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
• On Monte Carlo tree search for weighted vertex coloring (Q2163775) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
• Bounded max-colorings of graphs (Q2447538) (← links)
• Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
• Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
• Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results (Q3181046) (← links)
• Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
• On the Maximum Edge Coloring Problem (Q3602848) (← links)
• On the Max Coloring Problem (Q5443379) (← links)
• Max-coloring of vertex-weighted graphs (Q5964985) (← links)