Pages that link to "Item:Q1630992"

The following pages link to The connected \(p\)-center problem on cactus graphs (Q1630992):

Displaying 12 items.

• A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• The 2-maxian problem on cactus graphs (Q2339821) (← links)
• Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
• A linear time algorithm for connected \(p\)-centdian problem on block graphs (Q2672632) (← links)
• (Q3197864) (← links)
• (Q5422574) (← links)
• The connected p-median problem on complete multi-layered graphs (Q5866016) (← links)