Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

SIAMDM
2010

favoriteEmaildiscussreport

136views more SIAMDM 2010»

Obnoxious Centers in Graphs

12 years 11 months ago

Obnoxious Centers in Graphs

Download www.fmf.uni-lj.si

We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expected time. For planar graphs, we give algorithms with O(n log n) expected time and O(n log3 n) worst-case time. For graphs with bounded treewidth, we give an algorithm taking O(n log n) worst-case time. The algorithms make use of parametric search and several results for computing distances on graphs of bounded treewidth and planar graphs.

Sergio Cabello, Günter Rote

Real-time Traffic

Algorithms | Planar Graphs | SIAMDM 2010 | Worst-case Time |

claim paper

Related Content

» Multicriteria SemiObnoxious Network Location Problems MSNLP with Sum and Center Objectives

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» Recommendation via Query Centered Random Walk on KPartite Graph

» Donation Center Location Problem

» Situation Assessment and Decision Making Integrated into the Process Centered Environment

» A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

» The role control center features and case studies

» Efficient Algorithms for Centers and Medians in Interval and CircularArc Graphs

» Star Shape Prior for GraphCut Image Segmentation

Post Info
More Details (n/a)

Added	21 May 2011
Updated	21 May 2011
Type	Journal
Year	2010
Where	SIAMDM
Authors	Sergio Cabello, Günter Rote

Comments (0)