Pages that link to "Item:Q1382805"

The following pages link to Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805):

Displaying 7 items.

• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• The connected \(p\)-center problem on cactus graphs (Q1630992) (← links)
• Multi-depot traveling salesmen location problems on networks with special structure (Q2178369) (← links)
• Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• The \(k\)-centrum multi-facility location problem (Q5931794) (← links)