Pages that link to "Item:Q1276168"
From MaRDI portal
The following pages link to Zero knowledge and the chromatic number (Q1276168):
Displayed 29 items.
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Conjunctive query containment revisited (Q1575132) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Cross-layer optimization in ultra wideband networks (Q2463846) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem (Q2773025) (← links)
- Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment (Q2773169) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)