Pages that link to "Item:Q1402224"

The following pages link to Polynomial time algorithms for 2-edge-connectivity augmentation problems (Q1402224):

Displaying 6 items.

• On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
• A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
• Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
• Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
• Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)