Sciweavers

3396 search results - page 419 / 680
» Tree representations of graphs
Sort
View
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
15 years 6 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
NETWORKS
2010
15 years 5 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
GIS
2006
ACM
16 years 7 months ago
Recognition of island structures for map generalization
In this paper we describe work on the automatic recognition of island structures. In an initial phase several test persons were asked to mark groups of islands that they perceived...
Stefan Steiniger, Dirk Burghardt, Robert Weibel
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 12 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz