4 problems
- 0 votes0 replies0 views
The conjectured approximation factor for 3-regular 3-edge-connected graphs
Conjectured factor consequence. If , then should be possible; if , then…
- 0 votes0 replies0 views
Alexander et al.'s integrality-gap conjecture for the minimum 2-edge-connected multisubgraph problem
Alexander et al.'s conjecture.
- 0 votes0 replies0 views
Half-integrality conjecture for edge-connectivity augmentation with tree-metric costs
Let be a finite vertex set, let be the complete graph on , let be an edge-connectivity requirement, and let be a capacit…
- 0 votes0 replies0 views
The tree-routing conjecture for the symmetric VPND problem
The symmetric Virtual Private Network Design (VPND) problem buys capacity on links of a communication network so that specified traffic demands can be met. An instance has the tree…