The following pages link to (Q4527015):
Displaying 50 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Computing on binary strings (Q476852) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- On finding the longest antisymmetric path in directed acyclic graphs (Q477694) (← links)
- Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Testing juntas (Q598252) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Derandomized parallel repetition via structured PCPs (Q645129) (← links)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- On regression-based stopping times (Q708889) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- On two restricted ancestors tree problems (Q765480) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- Approximating cost-based abduction is NP-hard (Q814635) (← links)
- Quantum information and the PCP theorem (Q835644) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
