Sciweavers

109 search results - page 14 / 22
» Vertex Ranking with Capacity
Sort
View
JDA
2007
62views more  JDA 2007»
14 years 9 months ago
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
Cédric Bentz, Marie-Christine Costa, Fr&eac...
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
14 years 9 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
85
Voted
APIN
2006
207views more  APIN 2006»
14 years 9 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
FOCS
2002
IEEE
15 years 2 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
14 years 9 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky