Pages that link to "Item:Q1165162"
From MaRDI portal
The following pages link to On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162):
Displayed 12 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- Bounding component sizes of two-connected Steiner networks (Q2380015) (← links)
- Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)