scientific article; zbMATH DE number 1305405

MaRDI QIDQ4252286zbMATH OpenFDO

Authors Barun Chandra, Magnús M. Halldórsson

Publication date 17 June 1999

zbMATH Keywords

approximation algorithmpacking problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Greedy local improvement and weighted set packing approximation
• On local search for weighted \(k\)-set packing
• On local search for weighted \(k\)-set packing
• The limits of local search for weighted \(k\)-set packing

Cited in

(20)

• Competitive algorithms for multistage online scheduling
• A local search algorithm for binary maximum 2-path partitioning
• Scheduling time-constrained multicast messages in circuit-switched tree networks.
• Approximation algorithms for NMR spectral peak assignment.
• The limits of local search for weighted \(k\)-set packing
• Data dependent worst case bounds for weighted set packing
• Greedy local improvement and weighted set packing approximation
• On local search for weighted \(k\)-set packing
• Improved approximations for k-exchange systems (extended abstract)
• Approximating the k-set packing problem by local improvements
• scientific article; zbMATH DE number 910871 (Why is no real title available?)
• A 0.5358-approximation for Bandpass-2
• Max-independent set and the quantum alternating operator ansatz
• Large neighborhood local search for the maximum set packing problem
• On the bandpass problem
• Algorithm for optimal winner determination in combinatorial auctions
• The limits of local search for weighted k-set packing
• On linear and semidefinite programming relaxations for hypergraph matching
• On local search for weighted \(k\)-set packing
• On a posterior evaluation of a simple greedy method for set packing

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