Pages that link to "Item:Q1879244"

The following pages link to An approximation algorithm for the fault tolerant metric facility location problem (Q1879244):

Displaying 15 items.

• Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
• LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
• Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
• An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
• Beyond Moulin mechanisms (Q834858) (← links)
• Maximum subset intersection (Q1944892) (← links)
• Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
• Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
• Constant approximation for fault-tolerant median problems via iterative rounding (Q2157915) (← links)
• LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem (Q2295313) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
• A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
• The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
• (Q2753738) (← links)
• Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)