L 1 C 1 polynomial spline approximation algorithms for large data sets.
Laurent GajnyOlivier GibaruEric NyiriPublished in: Numer. Algorithms (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- data sets
- facility location problem
- minimum cost
- worst case
- np hardness
- network design problem
- approximation schemes
- exact algorithms
- set cover
- approximation ratio
- precedence constraints
- b spline
- constant factor approximation
- primal dual
- disjoint paths
- randomized algorithms
- constant factor
- combinatorial auctions
- open shop
- undirected graph
- approximation guarantees
- integer programming
- branch and bound algorithm
- curve fitting