Sciweavers

1404 search results - page 78 / 281
» Optimization problems in multiple-interval graphs
Sort
View
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 7 days ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
SIAMJO
2008
144views more  SIAMJO 2008»
14 years 9 months ago
Embedded in the Shadow of the Separator
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Frank Göring, Christoph Helmberg, Markus Wapp...
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 3 months ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
15 years 4 months ago
Minimum Wheel-Rotation Paths for Differential Drive Mobile Robots Among Piecewise Smooth Obstacles
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
Hamid Reza Chitsaz, Steven M. LaValle