Pages that link to "Item:Q5171195"
From MaRDI portal
The following pages link to Optimal Long Code Test with One Free Bit (Q5171195):
Displayed 24 items.
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- Strong reductions for extended formulations (Q1801022) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- (Q5875482) (← links)
- Timeline cover in temporal graphs: exact and approximation algorithms (Q6182902) (← links)