Pages that link to "Item:Q1332662"
From MaRDI portal
The following pages link to The hardness of approximation: Gap location (Q1332662):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Exact algorithms for the matrix bid auction (Q958442) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Multi-dimensional vector assignment problems (Q2339839) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- The minimum-entropy set cover problem (Q2581268) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- An improved algorithm for parallel machine scheduling under additional resource constraints (Q2693796) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem (Q2946037) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (Q3453287) (← links)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- (Q5009574) (← links)
