scientific article; zbMATH DE number 2086940

MaRDI QIDQ4737545zbMATHFDO

Authors Bruce Shepherd, Adrian Vetta

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370457.htm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The Demand-Matching Problem
• Further approximations for demand matching: matroid constraints and minor-closed graphs
• Perfect matching in bipartite hypergraphs subject to a demand graph
• Optimal general matchings
• scientific article; zbMATH DE number 2038727

Cited in

(7)

• The maximin line problem with regional demand
• Scheduling problems over a network of machines
• Further approximations for demand matching: matroid constraints and minor-closed graphs
• Constant factor approximation for the weighted partial degree bounded edge packing problem
• Scheduling problems over network of machines
• Constant factor approximation for the weighted partial degree bounded edge packing problem
• The Demand-Matching Problem

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