The following pages link to (Q2941638):
Displayed 29 items.
- The complexity of flow expansion and electrical flow expansion (Q831846) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Easy capacitated facility location problems, with connections to lot-sizing (Q1984675) (← links)
- Optimal matroid partitioning problems (Q2032344) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- (Q5136270) (← links)
- (Q5136271) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
- (Q5214247) (← links)
- (Q5875460) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Justifying groups in multiwinner approval voting (Q6165554) (← links)
- Observation routes and external watchman routes (Q6179428) (← links)
- Capacity-preserving subgraphs of directed flow networks (Q6182901) (← links)