scientific article; zbMATH DE number 4197287

zbMATH Open0725.65059MaRDI QIDQ5203585FDOQ5203585

Authors: Zoltán Zubor 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• On interval and circular-arc covering problems
• Generalized vertex covering in interval graphs
• The conditional covering problem on unweighted interval graphs
• Covering a Set of Points with a Minimum Number of Lines
• Refined algorithms for hitting many intervals

zbMATH Keywords

optimal algorithmordering algorithminteger-valued linear programming problempath of maximal weightstrong covering of an interval system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10)

Cited In (3)

• Irredundant intervals
• Refined algorithms for hitting many intervals
• Title not available (Why is that?)

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 Q5203585)