scientific article; zbMATH DE number 1182762

MaRDI QIDQ4400845zbMATH OpenFDO

Authors C. Baur, Sándor P. Fekete

Publication date 25 October 1998

zbMATH Keywords

knapsack problemsgeometric packing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximation of geometric dispersion problems
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
• Approximation algorithms for dispersion problems
• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM

Cited in

(8)

• A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
• A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
• Dispersing and grouping points on planar segments
• Polynomial algorithms for p-dispersion problems in a planar Pareto Front
• Away from each other
• Approximation of geometric dispersion problems
• Max-min dispersion on a line
• Repulsion-based p-dispersion with distance constraints in non-convex polygons

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400845)