2137 search results - page 149 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
166
Voted
MP
2010
15 years 4 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
162
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
203
Voted
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
166
Voted
IPSN
2009
Springer
16 years 28 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
170
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...