523 search results - page 58 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
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...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
IPL
2006
13 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...