Sylvia C. Boyd

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