Sciweavers

1963 search results - page 50 / 393
» The Maximum Solution Problem on Graphs
Sort
View
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 10 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
JCO
2007
122views more  JCO 2007»
13 years 8 months ago
Packing 5-cycles into balanced complete m -partite graphs for odd m
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
14 years 2 months ago
Improved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
Zhi-Zhong Chen, Takayuki Nagoya
AMC
2007
136views more  AMC 2007»
13 years 8 months ago
Iterative method for solving a nonlinear boundary value problem
In this paper, a boundary value problem for a nonlinear second-order ordinary differential equation is studied. By means of the maximum principle we established the existence and...
A. Dang Quang
EMO
2003
Springer
136views Optimization» more  EMO 2003»
14 years 1 months ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf