Sciweavers

1090 search results - page 58 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 1 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ISTA
2007
13 years 11 months ago
Analytical data modeling of investment project financing process
: The present work is devoted to the research of investment projects’ financing issues. Within this paper a data analytical tool for an optimal financing schema computation on th...
Mikhail D. Godlevskiy, Valentina V. Moskalenko, Vl...
ADHOCNOW
2003
Springer
14 years 3 months ago
Topology Control Problems under Symmetric and Asymmetric Power Thresholds
We consider topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties. The ...
Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madha...
ORL
2008
99views more  ORL 2008»
13 years 10 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ATAL
2011
Springer
12 years 10 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...