Sciweavers

626 search results - page 74 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
On Allocating Goods to Maximize Fairness
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khan...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
MOBIHOC
2008
ACM
14 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
ADHOC
2010
292views more  ADHOC 2010»
13 years 10 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
AUTOID
2005
IEEE
14 years 3 months ago
Fully Automated Facial Symmetry Axis Detection in Frontal Color Images
In this paper, we consider the problem of automatically detecting a facial symmetry axis in what we will call a standard human face image (acquired when the subject is looking dir...
Xin Chen, Patrick J. Flynn, Kevin W. Bowyer