7796 search results - page 1379 / 1560 » On Generalized Schur Numbers |
165
click to vote
STACS
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
211
click to vote
VSTTE
2005
Springer
16 years 18 days ago
2005
Springer
The validation of modern software systems on mobile devices needs to incorporate both functional and non-functional requirements. While some progress has been made in validating pe...
219
click to vote
WAOA
2005
Springer
16 years 18 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
202
click to vote
WEA
2005
Springer
16 years 18 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
179
click to vote
WG
2005
Springer
16 years 18 days ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...