On the polytope faces of the graph approximation problem
From MaRDI portal
Recommendations
- Polynomial-time approximation schemes for geometric graphs
- On the combinatorial complexity of approximating polytopes
- On the combinatorial complexity of approximating polytopes
- scientific article; zbMATH DE number 861344
- Polytopal approximation bounding the number of \(k\)-faces
- On polyhedron graph density in problems of combinatorial optimization
- Approximation algorithms for graph approximation problems
- Polynomial approximation on graphs
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Cites work
- scientific article; zbMATH DE number 3828714 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3797792 (Why is no real title available?)
- Approximation algorithms for graph approximation problems
- Cluster graph modification problems
- Integer models for the interrupt-oriented services of jobs by single machine
- Polytopes and connected subgraphs
- Solution of large-scale symmetric travelling salesman problems
Cited in
(3)
This page was built for publication: On the polytope faces of the graph approximation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186827)
