Pages that link to "Item:Q5362979"
From MaRDI portal
The following pages link to On largest volume simplices and sub-determinants (Q5362979):
Displaying 25 items.
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- On the complexity of approximating extremal determinants in matrices (Q1346597) (← links)
- Generalized Sperner lemma and subdivisions into simplices of equal volume (Q1375203) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Largest parallelotopes contained in simplices (Q1969781) (← links)
- Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices (Q2114109) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← links)
- On proportional volume sampling for experimental design in general spaces (Q2677908) (← links)
- Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- A Local Search Framework for Experimental Design (Q5092507) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- (Q6084421) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)