Pages that link to "Item:Q2366228"

The following pages link to The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228):

Displaying 17 items.

• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
• Unit disk cover problem in 2D (Q491638) (← links)
• The within-strip discrete unit disk cover problem (Q528480) (← links)
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• Open problems around exact algorithms (Q2473037) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• The traveling salesman problem with few inner points (Q2583717) (← links)
• The Euclidean \(k\)-supplier problem in \(I R^2\) (Q2661589) (← links)
• On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
• ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS (Q4931731) (← links)
• ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
• Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
• An ETH-Tight Exact Algorithm for Euclidean TSP (Q6156029) (← links)