The following pages link to (Q3002828):
Displaying 26 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Complexity and lowers bounds for power edge set problem (Q1711663) (← links)
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Donation center location problem (Q1949758) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Competitive and collaborative influence in social networks (Q2422617) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Locally Stable Marriage with Strict Preferences (Q2968513) (← links)
- Maximum Weighted Independent Sets with a Budget (Q2971655) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses (Q3104768) (← links)
- (Q5075740) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
