Sciweavers

626 search results - page 62 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
SSS
2009
Springer
162views Control Systems» more  SSS 2009»
15 years 4 months ago
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
André Schumacher, Harri Haanpää
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
NIPS
2001
14 years 11 months ago
The Unified Propagation and Scaling Algorithm
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
Yee Whye Teh, Max Welling
JMLR
2006
97views more  JMLR 2006»
14 years 9 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke