z-logo
open-access-imgOpen Access
Guillotine Cut in Approximation Algorithms
Author(s) -
Xiuzhen Cheng,
DingZhu Du,
Joonmo Kim,
Hung Q. Ngo
Publication year - 2005
Publication title -
kluwer academic publishers ebooks
Language(s) - English
Resource type - Book series
DOI - 10.1007/0-306-47536-7_2
Subject(s) - computer science , algorithm , mathematics
The guillotine cut is one of main techniques to design polynomial-time approximation schemes for geometric optimization problems. This article is a short survey on its history and current developments.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom