The following pages link to (Q4230322):
Displayed 28 items.
- Max NP-completeness made easy (Q1960655) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- The ferry cover problem (Q2272191) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- (Q4266753) (← links)
- Random walks on colored graphs (Q4286296) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- (Q5708499) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5901067) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- Partitioning problems in dense hypergraphs (Q5957354) (← links)
- Approximate evaluations of characteristic polynomials of Boolean functions (Q5958111) (← links)
- Hardness and methods to solve CLIQUE (Q5959359) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)