Pages that link to "Item:Q5248478"

The following pages link to Linear programming without the matrix (Q5248478):

Displaying 17 items.

• The \(k\)-server problem (Q458484) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
• Local approximability of max-min and min-max linear programs (Q693753) (← links)
• A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
• Two sensitivity theorems in fuzzy integer programming. (Q1421465) (← links)
• Delayed information and action in on-line algorithms (Q1854463) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
• Distributed Distance-Bounded Network Design Through Distributed Convex Programming (Q3300803) (← links)
• A distributed voting scheme to maximize preferences (Q3431448) (← links)
• Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
• Distributed near-optimal matching (Q5101411) (← links)
• Fair Packing and Covering on a Relative Scale (Q5139838) (← links)
• Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
• Algorithmic mechanism design (Q5938624) (← links)
• Minimum vertex cover, distributed decision-making, and communication complexity (Q6184364) (← links)