Sciweavers

Share
84 search results - page 1 / 17
» Approximating the minimum hub cover problem on planar graphs
Sort
View
OL
2016
62views more  OL 2016»
3 years 2 months ago
Approximating the minimum hub cover problem on planar graphs
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs. The problem, which is referred to as the minimum hub...
Belma Yelbay, S. Ilker Birbil, Kerem Bülb&uum...
ICALP
2004
Springer
8 years 11 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
ICALP
2001
Springer
8 years 10 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
DAM
2006
191views more  DAM 2006»
8 years 6 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
CORR
2011
Springer
188views Education» more  CORR 2011»
8 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
books