Pages that link to "Item:Q534329"

The following pages link to Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329):

Displaying 13 items.

• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• Inverse eccentric vertex problem on networks (Q301951) (← links)
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• Inverse \(k\)-centrum problem on trees with variable vertex weights (Q494693) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)