Sciweavers

2869 search results - page 22 / 574
» The Inference Problem: A Survey
Sort
View
CJ
2008
69views more  CJ 2008»
13 years 10 months ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
EOR
2010
81views more  EOR 2010»
13 years 10 months ago
Dynamic pickup and delivery problems
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup an...
Gerardo Berbeglia, Jean-François Cordeau, G...
SCHEDULING
2010
79views more  SCHEDULING 2010»
13 years 8 months ago
Open problems in real-time scheduling
Abstract We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling semina...
Sanjoy K. Baruah, Kirk Pruhs
GD
2004
Springer
14 years 3 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
CSR
2009
Springer
14 years 1 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas