Pages that link to "Item:Q4323730"

The following pages link to On the hardness of approximating minimization problems (Q4323730):

Displaying 27 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
• A note on approximating graph genus (Q290221) (← links)
• Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
• Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
• Approximation algorithms for a geometric set cover problem (Q423912) (← links)
• Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Independent dominating set problem revisited (Q476836) (← links)
• On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
• Heuristic algorithms in computational molecular biology (Q619906) (← links)
• Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms (Q622140) (← links)
• Approximation and hardness results for label cut and related problems (Q630189) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
• Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• (Q5092472) (← links)
• (Q5111721) (← links)
• Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
• Minimum Power Dominating Sets of Random Cubic Graphs (Q5272639) (← links)
• Coresets for the Nearest-Neighbor Rule (Q5874517) (← links)
• Structure in approximation classes (Q6085751) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
• On the structure of the set of panchromatic colorings of a random hypergraph (Q6148171) (← links)