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