3475 search results - page 71 / 695 » Backbones in Optimization and Approximation |
131
click to vote
INFOCOM
2010
IEEE
15 years 29 days ago
2010
IEEE
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
130
click to vote
ICTAI
2010
IEEE
15 years 13 days ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
103
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
99
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
132
click to vote
ADHOC
2008
15 years 2 months ago
2008
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...