4843 search results - page 598 / 969 » The Shortcut Problem - Complexity and Approximation |
188
click to vote
PVLDB
2010
15 years 5 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
159
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
247
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
170
click to vote
IOR
2010
15 years 4 months ago
2010
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
198
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...