Sylvia C. Boyd

According to our database, Sylvia C. Boyd authored at least 29 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Approximation algorithms for flexible graph connectivity.

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur

Math. Program., March, 2024

2022

A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

SIAM J. Discret. Math., September, 2022

2021

The salesman's improved tours for fundamental classes.

Sylvia C. Boyd, András Sebö

Math. Program., 2021

A 2-Approximation Algorithm for Flexible Graph Connectivity.

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur

CoRR, 2021

2020

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case.

Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang

Proceedings of the Approximation, 2020

2017

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph.

Sylvia C. Boyd, Philippe Legault

SIAM J. Discret. Math., 2017

The Saleman's Improved Tours for Fundamental Classes.

Sylvia C. Boyd, András Sebö

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

A -approximation for subcubic 2EC using circulations and obliged edges.

Sylvia C. Boyd, Yao Fu, Yu Sun

Discret. Appl. Math., 2016

2015

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem.

Sylvia C. Boyd, Philippe Legault

Electron. Notes Discret. Math., 2015

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem.

Sylvia C. Boyd, Philippe Legault

CoRR, 2015

2014

The traveling salesman problem on cubic and subcubic graphs.

Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie

Math. Program., 2014

A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations.

Sylvia C. Boyd, Yao Fu, Yu Sun

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Finding 2-Factors Closer to TSP Tours in Cubic Graphs.

Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa

SIAM J. Discret. Math., 2013

Mixed and Circular Multichromosomal Genomic Median Problem.

Sylvia C. Boyd, Maryam Haghighi

SIAM J. Discret. Math., 2013

2012

A Fast Method for Large-Scale Multichromosomal Breakpoint Median Problems.

Sylvia C. Boyd, Maryam Haghighi

J. Bioinform. Comput. Biol., 2012

2011

Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices.

Sylvia C. Boyd, Robert Carr

Discret. Optim., 2011

TSP on Cubic and Subcubic Graphs.

Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2008

Finding the Exact Integrality Gap for Small Traveling Salesman Problems.

Geneviève Benoit, Sylvia C. Boyd

Math. Oper. Res., 2008

Facet Generating Techniques.

Sylvia C. Boyd, William R. Pulleyblank

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

On the domino-parity inequalities for the STSP.

Sylvia C. Boyd, Sally Cockburn, Danielle Vella

Math. Program., 2007

2005

Computing the integrality gap of the asymmetric travelling salesman problem.

Sylvia C. Boyd, Paul Elliott-Magwood

Electron. Notes Discret. Math., 2005

1999

A new bound for the ratio between the 2-matching problem and its linear programming relaxation.

Sylvia C. Boyd, Robert Carr

Math. Program., 1999

1997

The Economic Addition of Functionality to a Network.

Sylvia C. Boyd, Karina Marcus

Proceedings of the High-Performance Computing and Networking, 1997

1995

Ladders for Travelling Salesmen.

Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang

SIAM J. Optim., 1995

1993

An Integer Polytope Related to the Design of Survivable Communication Networks.

Sylvia C. Boyd, Tianbao Hao

SIAM J. Discret. Math., 1993

1991

On the Complexity of Generating Optimal Test Sequences.

Sylvia C. Boyd, Hasan Ural

IEEE Trans. Software Eng., 1991

Optimizing over the subtour polytope of the travelling salesman problem.

Sylvia C. Boyd, William R. Pulleyblank

Math. Program., 1991

Small Travelling Salesman Polytopes.

Sylvia C. Boyd, William H. Cunningham

Math. Oper. Res., 1991

The Synchronization Problem in Protocol Testing and its Complexity.

Sylvia C. Boyd, Hasan Ural

Inf. Process. Lett., 1991