The following pages link to Sylvia Boyd (Q298951):
Displaying 27 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874) (← links)
- (Q803047) (redirect page) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- The synchronization problem in protocol testing and its complexity (Q1183455) (← links)
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- The saleman's improved tours for fundamental classes (Q2401149) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- Finding 2-Factors Closer to TSP Tours in Cubic Graphs (Q2848544) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- (Q2999650) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Finding the Exact Integrality Gap for Small Traveling Salesman Problems (Q3169005) (← links)
- (Q3322122) (← links)
- (Q3439689) (← links)
- Small Travelling Salesman Polytopes (Q3978615) (← links)
- An Integer Polytope Related to the Design of Survivable Communication Networks (Q4302271) (← links)
- (Q4737520) (← links)
- Ladders for Travelling Salesmen (Q4838961) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- Mixed and Circular Multichromosomal Genomic Median Problem (Q5300481) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)
- A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations (Q5418995) (← links)
- A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q6058192) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
