z-logo
open-access-imgOpen Access
Epsilon-covering: a greedy optimal algorithm for simple shapes
Author(s) -
Tuong-Bach Nguyen,
Isabelle Sivig
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - parameterized complexity , cardinality (data modeling) , simple (philosophy) , greedy algorithm , set (abstract data type) , algorithm , mathematics , polynomial , computer science , combinatorics , mathematical optimization , mathematical analysis , database , philosophy , epistemology , programming language

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