Pages that link to "Item:Q5716853"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716853):
Displaying 34 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)
- Almost optimal solutions for bin coloring problems (Q941831) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← 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)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← 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)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← 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)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← 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)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- Approximating interval coloring and max-coloring in chordal graphs (Q3507752) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- On the Max Coloring Problem (Q5443379) (← links)
- (Q5501309) (← links)
- (Q5875482) (← links)
- Algorithms and Computation (Q5897842) (← links)
- Max-coloring of vertex-weighted graphs (Q5964985) (← links)
