779 search results - page 111 / 156 » A graph polynomial for independent sets of bipartite graphs |
161
click to vote
FUN
2010
Springer
15 years 5 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
118
click to vote
ATMOS
2007
15 years 3 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
128
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
CP
2005
Springer
15 years 7 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
106
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...