Sciweavers

6740 search results - page 82 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
INFOCOM
2000
IEEE
14 years 2 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
AUSSOIS
2001
Springer
14 years 2 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
DM
1999
61views more  DM 1999»
13 years 9 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
EVOW
2007
Springer
14 years 4 months ago
An Ant Algorithm for the Steiner Tree Problem in Graphs
The Steiner Tree Problem (STP) in graphs is a well-known
Luc Luyet, Sacha Varone, Nicolas Zufferey
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 11 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál