Pages that link to "Item:Q4323730"
From MaRDI portal
The following pages link to On the hardness of approximating minimization problems (Q4323730):
Displayed 50 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)
- PCP characterizations of NP: toward a polynomially-small error-probability (Q649097) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- How to guard a graph? (Q652526) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Approximately dominating representatives (Q870264) (← links)
- Statistical mechanics of the minimum dominating set problem (Q888266) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- On the computational complexity of the minimum committee problem (Q928677) (← links)
- Efficient sensor network design for continuous monitoring of moving objects (Q936530) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Approximation algorithm for coloring of dotted interval graphs (Q963476) (← links)
- Consecutive block minimization is 1.5-approximable (Q975428) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496) (← links)
- Computational complexity of the minimum committee problem and related problems (Q1005473) (← links)
- Approximation of the \(k\)-batch consolidation problem (Q1006079) (← links)
- An application of the greedy heuristic of set cover to traffic checks (Q1022400) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- On the complexity of SNP block partitioning under the perfect phylogeny model (Q1045048) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- On the hardness of approximating shortest integer relations among rational numbers (Q1274930) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- On proving that a graph has no large clique: A connection with Ramsey theory (Q1351164) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)