Convex Polyhedra With Triangular Faces and Cone Triangulation
Milica Stojanović, Milica Vučković (2011)
The Yugoslav Journal of Operations Research
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Algorithms for investigating optimality of cone triangulation for a polyhedron”
Convex Polyhedra With Triangular Faces and Cone Triangulation
Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
On the completeness-number of a finite graph. II.
Ivan Havel (1968)
Časopis pro pěstování matematiky
Similarity:
On some graph-theoretical problems of V. G. Vizing
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
Similarity:
Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs.
Chen, Hon-Chan (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of , where is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to . To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs...