The following pages link to The importance of being biased (Q3579199):
Displaying 41 items.
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Testing juntas (Q598252) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- The checkpoint problem (Q714790) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Approximating the minimum weight weak vertex cover (Q860818) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding (Q941834) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- On the measure of intersecting families, uniqueness and stability (Q963246) (← links)
- Inapproximability results for equations over infinite groups (Q974745) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Maximum locally stable matchings (Q1736563) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- A Katona-type proof of an Erdős-Ko-Rado-type theorem (Q2566804) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- On the independent set problem in random graphs (Q2804023) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)
