scientific article
From MaRDI portal
Publication:2708231
zbMath0972.68127MaRDI QIDQ2708231
Publication date: 17 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Shrinking maxima, decreasing costs: new online packing and covering problems ⋮ Technical Note—Online Hypergraph Matching with Delays ⋮ Approximability of sparse integer programs ⋮ Local search algorithms for the maximum carpool matching problem ⋮ How heavy independent sets help to find arborescences with many leaves in DAGs ⋮ Competitive router scheduling with structured data ⋮ Hardness of approximation for non-overlapping local alignments. ⋮ Competitive algorithms for multistage online scheduling ⋮ An approximation algorithm for maximum triangle packing ⋮ A modified greedy algorithm for dispersively weighted 3-set cover ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ Towards better models of externalities in sponsored search auctions ⋮ Overflow management with self-eliminations ⋮ Overflow management with self-eliminations ⋮ On approximating four covering and packing problems ⋮ Independent sets in bounded-degree hypergraphs ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
This page was built for publication: