Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems

DOI10.1016/j.dam.2004.05.003zbMath1078.68161OpenAlexW2086911752MaRDI QIDQ1885820

Michel Minoux

Publication date: 12 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.05.003

zbMATH Keywords

Polynomial approximationContinuous segmentationDiscrete segmentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (1)

Approximation by pseudo-linear operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Dioïds and semirings: Links to fuzzy sets and other applications
• Incidence matrices and interval graphs
• On Grouping for Maximum Homogeneity
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This page was built for publication: Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems