15033 search results - page 106 / 3007 » Complexity Theory and Algorithms |
127
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
141
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
153
Voted
WD
2010
15 years 1 months ago
2010
The use of topological features, more specifically, the importance of an element related to its structural position is a subject widely studied. For instance, complex networks theo...
133
Voted
APAL
2007
15 years 3 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
111
Voted
COCO
1994
Springer
15 years 7 months ago
1994
Springer