A Constant-Factor Approximation Algorithm for the Geometric k -MST Problem in the Plane

We show that any rectilinear polygonal subdivision in the plane can be converted into a "guillotine" subdivision whose length is at most twice that of the original subdivision. "Guillotine" subdivisions have a simple recursive structure that allows one to search for "optimal...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 28; číslo 3; s. 771 - 781
Hlavní autoři:	Mitchell, Joseph S. B., Blum, Avrim, Chalasani, Prasad, Vempala, Santosh
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.1998
Témata:	Algorithmics. Computability. Computer arithmetics Algorithms Applied mathematics Applied sciences Approximation Artificial intelligence Bank robberies Computer science Computer science; control theory; systems Dynamic programming Exact sciences and technology Graphs Information retrieval. Graph Laboratories Multiplication & division Network management systems Orienteering Pattern recognition. Digital image processing. Computational geometry Scholarships & fellowships Theoretical computing Traveling salesman problem Computational geometry Spanning tree Algorithm complexity Travelling salesman problem Dynamic programming Algorithm Polynomial time
ISSN:	0097-5397, 1095-7111
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!