Pages that link to "Item:Q5405060"
From MaRDI portal
The following pages link to Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060):
Displaying 27 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Approximating the revenue maximization problem with sharp demands (Q501665) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- On fair price discrimination in multi-unit markets (Q2046039) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Offline and online algorithms for single-minded selling problem (Q2173298) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Weighted upper domination number (Q2413167) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- (Q4691867) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- (Q5005149) (← links)
- (Q5075798) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- (Q5741821) (redirect page) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
