420 search results - page 2 / 84 » Some Algorithmic Problems in Polytope Theory |
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
100
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
95
Voted
DAM
2000
14 years 9 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...