The following pages link to Finding EPS-graphs (Q1150378):
Displaying 5 items.
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae (Q2348034) (← links)
