( en | de | ru )

 

Disambiguation of "Boyd, Sylvia C."

Author of the publication

copydeleteadd this publication to your clipboard
The traveling salesman problem on cubic and subcubic graphs

, , , and . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sylvia C Eder

Timothy Boyd

Silas Boyd-Wickizer

Britta Boyd

Robert Boyd

 

Other publications of authors with the same name

A 2-Approximation Algorithm for Flexible Graph Connectivity., , , and . CoRR, (2021)The salesman's improved tours for fundamental classes., and . Math. Program., 186 (1): 289-307 (2021)Approximation algorithms for flexible graph connectivity., , , and . Math. Program., 204 (1): 493-516 (March 2024)Facet Generating Techniques., and . Bonn Workshop of Combinatorial Optimization, page 33-55. Springer, (2008)Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph., and . SIAM J. Discret. Math., 31 (1): 632-644 (2017)Finding the Exact Integrality Gap for Small Traveling Salesman Problems., and . IPCO, volume 2337 of Lecture Notes in Computer Science, page 83-92. Springer, (2002)Approximation Algorithms for Flexible Graph Connectivity., , , and . FSTTCS, volume 213 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The traveling salesman problem on cubic and subcubic graphs., , , and . Math. Program., 144 (1-2): 227-245 (2014)The traveling salesman problem on cubic and subcubic graphs, , , and . CoRR, (2011)The Saleman's Improved Tours for Fundamental Classes., and . IPCO, volume 10328 of Lecture Notes in Computer Science, page 111-122. Springer, (2017)