scientific article; zbMATH DE number 1182757
From MaRDI portal
Publication:4400840
zbMath0903.05044MaRDI QIDQ4400840
Publication date: 10 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85) Ramsey theory (05D10)
Related Items (16)
On the approximability of clique and related maximization problems ⋮ Fast Heuristics and Approximation Algorithms ⋮ Complexity results for rainbow matchings ⋮ Combinatorial Auctions with Conflict-Based Externalities ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Geometric rounding: A dependent randomized rounding scheme ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments ⋮ On Constant Time Approximation of Parameters of Bounded Degree Graphs ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ On the complexity of the independent set problem in triangle graphs ⋮ The complexity of dissociation set problems in graphs ⋮ On Lagrangian Relaxation and Subset Selection Problems ⋮ Mining relevant information on the Web: a clique-based approach ⋮ Algorithm for optimal winner determination in combinatorial auctions ⋮ GreedyMAX-type Algorithms for the Maximum Independent Set Problem
This page was built for publication:
