The following pages link to (Q3128896):
Displaying 19 items.
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Constant-degree graph expansions that preserve treewidth (Q633842) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- Some APX-completeness results for cubic graphs (Q1566710) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Derandomized graph products (Q1842777) (← links)
- The limits of local search for weighted \(k\)-set packing (Q2164726) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- (Q5075740) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
