Sylvia C. Boyd

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 12

Top Topics

Approximation Algorithms

Top Venues

SIAM J. Discret. Math.

Publications

Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation algorithms for flexible graph connectivity. Math. Program. 204 (1) (2024)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. SIAM J. Discret. Math. 36 (3) (2022)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. CoRR (2022)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation Algorithms for Flexible Graph Connectivity. FSTTCS (2021)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
A 2-Approximation Algorithm for Flexible Graph Connectivity. CoRR (2021)
Sylvia C. Boyd, András Sebö
The salesman's improved tours for fundamental classes. Math. Program. 186 (1) (2021)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. CoRR (2020)
Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. APPROX-RANDOM (2020)
Sylvia C. Boyd, Philippe Legault
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. SIAM J. Discret. Math. 31 (1) (2017)
Sylvia C. Boyd, András Sebö
The Salesman's Improved Tours for Fundamental Classes. CoRR (2017)
Sylvia C. Boyd, András Sebö
The Saleman's Improved Tours for Fundamental Classes. IPCO (2017)
Sylvia C. Boyd, Yao Fu, Yu Sun
A -approximation for subcubic 2EC using circulations and obliged edges. Discret. Appl. Math. 209 (2016)
Sylvia C. Boyd, Philippe Legault
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem. CoRR (2015)
Sylvia C. Boyd, Philippe Legault
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem. Electron. Notes Discret. Math. 50 (2015)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
The traveling salesman problem on cubic and subcubic graphs. Math. Program. 144 (1-2) (2014)
Sylvia C. Boyd, Yao Fu, Yu Sun
A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations. IPCO (2014)
Sylvia C. Boyd, Maryam Haghighi
Mixed and Circular Multichromosomal Genomic Median Problem. SIAM J. Discret. Math. 27 (1) (2013)
Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Sylvia C. Boyd, Maryam Haghighi
A Fast Method for Large-Scale Multichromosomal Breakpoint Median Problems. J. Bioinform. Comput. Biol. 10 (1) (2012)
Sylvia C. Boyd, Robert Carr
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discret. Optim. 8 (4) (2011)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
TSP on Cubic and Subcubic Graphs. IPCO (2011)
Sylvia C. Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
The traveling salesman problem on cubic and subcubic graphs CoRR (2011)
Maryam Haghighi, Sylvia C. Boyd
A fast method for large-scale multichromosomal breakpoint median problems. BCB (2011)
Sylvia C. Boyd, William R. Pulleyblank
Facet Generating Techniques. Bonn Workshop of Combinatorial Optimization (2008)
Geneviève Benoit, Sylvia C. Boyd
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. Math. Oper. Res. 33 (4) (2008)
Sylvia C. Boyd, Sally Cockburn, Danielle Vella
On the domino-parity inequalities for the STSP. Math. Program. 110 (3) (2007)
Sylvia C. Boyd, Paul Elliott-Magwood
Computing the integrality gap of the asymmetric travelling salesman problem. Electron. Notes Discret. Math. 19 (2005)
Sylvia C. Boyd, Geneviève Labonté
Finding the Exact Integrality Gap for Small Traveling Salesman Problems. IPCO (2002)
Sylvia C. Boyd, Robert Carr
A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Math. Program. 86 (3) (1999)
Sylvia C. Boyd, Karina Marcus
The Economic Addition of Functionality to a Network. HPCN Europe (1997)
Sylvia C. Boyd, William H. Cunningham, Maurice Queyranne, Yaoguang Wang
Ladders for Travelling Salesmen. SIAM J. Optim. 5 (2) (1995)
Sylvia C. Boyd, Tianbao Hao
An Integer Polytope Related to the Design of Survivable Communication Networks. SIAM J. Discret. Math. 6 (4) (1993)
Sylvia C. Boyd, William R. Pulleyblank
Optimizing over the subtour polytope of the travelling salesman problem. Math. Program. 49 (1991)
Sylvia C. Boyd, Hasan Ural
On the Complexity of Generating Optimal Test Sequences. IEEE Trans. Software Eng. 17 (9) (1991)
Sylvia C. Boyd, Hasan Ural
The Synchronization Problem in Protocol Testing and its Complexity. Inf. Process. Lett. 40 (3) (1991)
Sylvia C. Boyd, William H. Cunningham
Small Travelling Salesman Polytopes. Math. Oper. Res. 16 (2) (1991)