370 search results - page 44 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
124
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
137
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
141
click to vote
SGP
2007
15 years 4 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
130
click to vote
MOBISYS
2004
ACM
16 years 1 months ago
2004
ACM
The 802.11 IEEE Standard has enabled low cost and effective wireless LAN services (WLAN). With the sales and deployment of WLAN based networks exploding, many people believe that ...
123
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...