Sciweavers

1395 search results - page 130 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
IPL
2008
172views more  IPL 2008»
14 years 10 months ago
Approximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
Valentin Ziegler
DM
2007
59views more  DM 2007»
14 years 10 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
15 years 3 months ago
A Coverage Algorithm for Multi-robot Boundary Inspection
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
Kjerstin Easton, Joel Burdick
IWPEC
2009
Springer
15 years 4 months ago
On the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 3 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...