Pages that link to "Item:Q868984"

The following pages link to An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984):

Displaying 10 items.

• Improved algorithms to network \(p\)-center location problems (Q390143) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
• On the Solution Value of the Continuous <i>p</i>-Center Location Problem on a Graph (Q3758534) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)