Sciweavers

178 search results - page 25 / 36
» combinatorics 2007
Sort
View
COCOON
2007
Springer
14 years 5 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
COCOON
2007
Springer
14 years 5 months ago
Properties of Symmetric Incentive Compatible Auctions
We formalize the definition of symmetric auctions to study fundamental properties of incentive compatible auction protocols. We characterize such auction protocols for those with ...
Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, T...
COCOON
2007
Springer
14 years 5 months ago
Generating Minimal k-Vertex Connected Spanning Subgraphs
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
Endre Boros, Konrad Borys, Khaled M. Elbassioni, V...
IJCAI
2007
14 years 9 days ago
A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
Bart Verheij
COCOON
2007
Springer
14 years 2 months ago
Efficient Testing of Forecasts
Each day a weather forecaster predicts a probability of each type of weather for the next day. After n days, all the predicted probabilities and the real weather data are sent to a...
Ching-Lueh Chang, Yuh-Dauh Lyuu