Pages that link to "Item:Q3452847"
From MaRDI portal
The following pages link to Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847):
Displayed 42 items.
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
- Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5075771) (← links)
- (Q5091191) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- The Dominating Set Problem in Geometric Intersection Graphs (Q5111873) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- On the minimum consistent subset problem (Q5918312) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Computing list homomorphisms in geometric intersection graphs (Q6039432) (← links)
- (Q6065419) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
- Algorithms for \(k\)-dispersion for points in convex position in the plane (Q6174438) (← links)