1429 search results - page 5 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
124
Voted
SOFSEM
2009
Springer
16 years 18 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
123
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
148
Voted
TAMC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
109
Voted
4OR
2008
15 years 3 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
104
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
