2137 search results - page 190 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
176
click to vote
JSAT
2006
15 years 6 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
160
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
138
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
164
Voted
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
220
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...