Pages that link to "Item:Q2931428"
From MaRDI portal
The following pages link to Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428):
Displaying 50 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- A note on anti-coordination and social interactions (Q386417) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- Maximum subset intersection (Q1944892) (← links)
- On multi-path routing for reliable communications in failure interdependent complex networks (Q2025105) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Factor models on locally tree-like graphs (Q2434914) (← links)
- Online vector scheduling and generalized load balancing (Q2443018) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Eternal dominating sets on digraphs and orientations of graphs (Q2659065) (← links)
