Sciweavers

1952 search results - page 331 / 391
» Complete partitions of graphs
Sort
View
DAM
1999
132views more  DAM 1999»
15 years 4 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
LPAR
2010
Springer
15 years 3 months ago
The Complexity of Partial-Observation Parity Games
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
Krishnendu Chatterjee, Laurent Doyen
156
Voted
IEICET
2010
124views more  IEICET 2010»
15 years 1 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
CORR
2011
Springer
212views Education» more  CORR 2011»
14 years 11 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
225
Voted
AUSAI
2011
Springer
14 years 4 months ago
Image Feature Selection Based on Ant Colony Optimization
Image feature selection (FS) is an important task which can affect the performance of image classification and recognition. In this paper, we present a feature selection algorithm ...
Ling Chen, Bolun Chen, Yixin Chen