Pages that link to "Item:Q4537621"

The following pages link to Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621):

Displaying 12 items.

• Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← 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)
• 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)
• (Q3763866) (← links)
• (Q4535022) (← links)
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
• A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS (Q5009369) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)