Pages that link to "Item:Q991472"

The following pages link to A new lower bound for the geometric traveling salesman problem in terms of discrepancy (Q991472):

Displaying 3 items.

• Random restricted matching and lower bounds for combinatorial optimization (Q1928532) (← links)
• Bounds for the traveling salesman paths of two-dimensional modular lattices (Q2012892) (← links)
• Randomized near-neighbor graphs, giant components and applications in data science (Q3299443) (← links)