Sciweavers

3192 search results - page 130 / 639
» The minimum latency problem
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 3 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
EOR
2010
178views more  EOR 2010»
15 years 3 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 10 months ago
Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, M...
PPSN
2004
Springer
15 years 9 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 3 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart