Pages that link to "Item:Q3093627"
From MaRDI portal
The following pages link to Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627):
Displaying 30 items.
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635) (← links)
- Local search is better than random assignment for bounded occurrence Ordering k-CSPs (Q2957878) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Approximating Bounded Occurrence Ordering CSPs (Q3167393) (← links)
- Testing Consumer Rationality Using Perfect Graphs and Oriented Discs (Q3460788) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- (Q4993600) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- (Q5743431) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- (Q5875456) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- Tree drawings with columns (Q6560148) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Streaming approximation resistance of every ordering CSP (Q6581871) (← links)
