Pages that link to "Item:Q4361784"

The following pages link to Colourful Linear Programming and its Relatives (Q4361784):

Displaying 28 items.

• A note on lower bounds for colourful simplicial depth (Q350647) (← links)
• The colorful Helly theorem and general hypergraphs (Q412268) (← links)
• Quantitative combinatorial geometry for continuous parameters (Q517447) (← links)
• More colourful simplices (Q629837) (← links)
• Notes about the Carathéodory number (Q714989) (← links)
• The intersection of a matroid and an oriented matroid (Q908055) (← links)
• The colourful feasibility problem (Q944700) (← links)
• A quadratic lower bound for colourful simplicial depth (Q1016046) (← links)
• Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
• Tverberg plus minus (Q1991341) (← links)
• Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
• Radon numbers and the fractional Helly theorem (Q2022784) (← links)
• No-dimensional Tverberg theorems and algorithms (Q2105318) (← links)
• Computing colourful simplicial depth and Median in \(\mathbb{R}_2\) (Q2135626) (← links)
• Enumerating trichromatic triangles containing the origin in linear time (Q2376788) (← links)
• A colorful theorem on transversal lines to plane convex sets (Q2377668) (← links)
• Carathéodory, Helly and the others in the max-plus world (Q2380785) (← links)
• Quantitative Tverberg theorems over lattices and other discrete sets (Q2408215) (← links)
• Tropical Carathéodory with matroids (Q2679600) (← links)
• The Colorful Helly Property for Hypergraphs (Q2851534) (← links)
• Algorithms for Colourful Simplicial Depth and Medians in the Plane (Q2958332) (← links)
• Helly’s theorem: New variations and applications (Q2979647) (← links)
• Robust Tverberg and Colourful Carathéodory Results via Random Choice (Q4635512) (← links)
• Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Examples with decreasing largest inscribed ball for deterministic rescaling algorithms (Q5884386) (← links)
• Extensions of the colorful Helly theorem for <i>d</i>-collapsible and <i>d</i>-Leray complexes (Q6131055) (← links)