scientific article; zbMATH DE number 754942

DOI10.1002/1520-6750(199502)42:1%3C81::AID-NAV3220420108%3E3.0.CO;2-XMaRDI QIDQ4698131zbMATHFDO

Authors Gang Yu, Panagiotis Kouvelis, Songjun Luo

Publication date 14 May 1995

zbMATH Keywords

heuristicsNP-completeindependent set problemgeometric vertex packingspecially structured geometric graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A study on two geometric location problems
• Vertex packing problem application to the design of electronic testing fixtures
• scientific article; zbMATH DE number 1670536
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3361920 (Why is no real title available?)
• On cliques in graphs
• Unit disk graphs

Cited in

(4)

• The mixed vertex packing problem.
• A polyhedral study of the generalized vertex packing problem
• The maximum clique problem
• Vertex packing problem application to the design of electronic testing fixtures

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