scientific article; zbMATH DE number 1182757
From MaRDI portal
Publication:4400840
zbMATH Open0903.05044MaRDI QIDQ4400840FDOQ4400840
Authors: Magnús M. Halldórsson 
Publication date: 10 December 1998
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)
Cited In (30)
- Approximation algorithms for the weighted independent set problem in sparse graphs
- Geometric rounding: A dependent randomized rounding scheme
- Approximating maximum independent sets by excluding subgraphs
- Title not available (Why is that?)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- Approximating maximum independent sets by excluding subgraphs
- Conversion of coloring algorithms into maximum weight independent set algorithms
- The complexity of dissociation set problems in graphs
- Computing independent sets in graphs with large girth
- Complexity results for rainbow matchings
- On the approximability of clique and related maximization problems
- Mining relevant information on the Web: a clique-based approach
- On Lagrangian Relaxation and Subset Selection Problems
- Approximation algorithms for maximum independent set of pseudo-disks
- Fast heuristics and approximation algorithms
- Algorithm for optimal winner determination in combinatorial auctions
- Ultimate greedy approximation of independent sets in subcubic graphs
- Greedy approximations of independent sets in low degree graphs
- On the complexity of the independent set problem in triangle graphs
- Approximation algorithms for independent sets in map graphs
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- On approximation properties of the independent set problem for low degree graphs
- Efficient independent set approximation in unit disk graphs
- Approximating weighted neighborhood independent sets
- Approximation resistance from pairwise independent subgroups
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Simple and local independent set approximation
- Combinatorial auctions with conflict-based externalities
- GreedyMAX-type algorithms for the maximum independent set problem
- On constant time approximation of parameters of bounded degree graphs
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 Q4400840)
