Pages that link to "Item:Q1210712"
From MaRDI portal
The following pages link to Geometric algorithms and combinatorial optimization (Q1210712):
Displayed 50 items.
- Semidefinite programming (Q1600854) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Short vectors of planar lattices via continued fractions (Q1603456) (← links)
- Query by committee, linear separation and random walks. (Q1603591) (← links)
- A polynomial-time algorithm for the bistable roommates problem (Q1604203) (← links)
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem (Q1607016) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- K-submodular functions and convexity of their Lovász extension (Q1613409) (← links)
- On the mean radius of permutation polytopes (Q1765513) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Probing polygons minimally is hard (Q1803270) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs (Q1815824) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- Graph imperfection. I (Q1850556) (← links)
- A fully combinatorial algorithm for submodular function minimization. (Q1850585) (← links)
- Graph imperfection. II (Q1850632) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Random utility models and their applications: Recent developments (Q1867815) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- On the even permutation polytope (Q1887623) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- Interval stochastic matrices: A combinatorial lemma and the computation of invariant measures of dynamical systems (Q1898810) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- Irregularities of point distributions relative to homothetic convex bodies. I (Q1907007) (← links)
- Stability critical graphs and ranks facets of the stable set polytope (Q1910521) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Genetic algorithms in constrained optimization (Q1921070) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)