Sciweavers

SIAMDM
2008
97views more  SIAMDM 2008»
13 years 11 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
AOR
2006
74views more  AOR 2006»
13 years 11 months ago
Note on Upper Bounds for TSP Domination Number
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...
Gregory Gutin, Angela Koller, Anders Yeo