Measure and conquer
DOI10.1145/1109557.1109560zbMATH Open1192.68960OpenAlexW4251769540WikidataQ60488762 ScholiaQ60488762MaRDI QIDQ3581486FDOQ3581486
Fedor V. Fomin, Dieter Kratsch, Fabrizio Grandoni
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109560
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) General topics in the theory of algorithms (68W01)
Cited In (34)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- On Independent Sets and Bicliques in Graphs
- Computing optimal Steiner trees in polynomial space
- Finding a dominating set on bipartite graphs
- Solving larger maximum clique problems using parallel quantum annealing
- Convex Recoloring Revisited: Complexity and Exact Algorithms
- On the independent set problem in random graphs
- Improved edge-coloring with three colors
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
- Approximation of min coloring by moderately exponential algorithms
- Exponential-time approximation of weighted set cover
- Efficient algorithms for clique problems
- On maximum independent sets in \(P_{5}\)-free graphs
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem
- The complexity of König subgraph problems and above-guarantee vertex cover
- Computing branchwidth via efficient triangulations and blocks
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Independent sets in graphs
- Stability preserving transformations of graphs
- An Improved SAT Algorithm in Terms of Formula Length
- Confronting intractability via parameters
- Title not available (Why is that?)
- On comparing algorithms for the maximum clique problem
- A heuristic approach for the max-min diversity problem based on max-clique
- Branch and recharge: exact algorithms for generalized domination
- Faster Steiner Tree Computation in Polynomial-Space
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Computing the differential of a graph: hardness, approximability and exact algorithms
- Solving connected dominating set faster than \(2^n\)
- Isolation concepts for efficiently enumerating dense subgraphs
- New potential functions for greedy independence and coloring
- Iterative Compression and Exact Algorithms
- A 4D-sequencing approach for air traffic management
- Iterative compression and exact algorithms
This page was built for publication: Measure and conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581486)
