Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen

Source URL: people.mpi-inf.mpg.de

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity Christoph Lenzen and Roger Wattenhofer Computer Engineering and Networks Laboratory (TIK) ETH Zurich {lenzen,wattenhofer}@tik.ee.ethz.ch

Source URL: disco.ethz.ch

A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

Source URL: eda.mmci.uni-saarland.de

• Graph theory
• Mathematics
• NP-complete problems
• Network theory
• Networks
• Combinatorial optimization
• Semantic similarity
• Line graph
• Centrality
• Matching
• Dominating set
• Graph partition

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont

Source URL: community.dur.ac.uk

• Graph theory
• NP-complete problems
• Graph coloring
• Dominating set
• Graph
• Chordal graph
• Pathwidth
• Trapezoid graph

Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

Source URL: web.stanford.edu

• Graph theory
• NP-complete problems
• Graph operations
• Line graph
• Cograph
• Clique
• Neighbourhood
• Matching
• Hypergraph
• Independent set
• Graph
• Dominating set

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Maximal independent set
• Independent set
• Dominating set
• Vertex cover
• Graph coloring
• Planar graph
• Graph minor
• Planar separator theorem
• Tree decomposition

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Matching
• Combinatorial optimization
• Dominating set
• Vertex cover
• Transportation theory
• Distribution

Sensor Networks Continue to Puzzle: Selected Open Problems Thomas Locher, Pascal von Rickenbach, and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, Switzerland {lochert, pascalv, wattenhofer}

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• NP-complete problems
• Edsger W. Dijkstra
• Routing algorithms
• Network theory
• Unit disk graph
• Search algorithms
• Connectivity
• Topology control
• Independent set
• Dominating set

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Source URL: community.dur.ac.uk

• Graph theory
• NP-complete problems
• Ear decomposition
• Matroid theory
• Graph
• Dominating set
• Chordal graph
• Graph coloring
• Line graph
• Expander graph

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Source URL: www.cs.tufts.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Set cover problem
• Approximation algorithm
• Facility location problem
• Dominating set
• Combinatorial optimization
• Reduction
• Algorithm