Search Sciweavers | Sciweavers

2181 search results - page 7 / 437

» The restriction scaffold problem

click to vote

JCO
2008

102views more JCO 2008»

Stable matching problems with exchange restrictions

13 years 8 months ago

Download www.dcs.gla.ac.uk

We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...

Robert W. Irving

claim paper

Read More »

click to vote

FCT
1999
Springer

79views Applied Computing» more FCT 1999»

Restrictive Acceptance Suffices for Equivalence Problems

14 years 25 days ago

Download www.lms.ac.uk

One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...

Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...

claim paper

Read More »

click to vote

MP
2008

137views more MP 2008»

Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints

13 years 8 months ago

Download www.optimization-online.org

Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...

Nilay Noyan, Andrzej Ruszczynski

claim paper

Read More »

click to vote

ENC
2006
IEEE

79views Theoretical Computer Science» more ENC 2006»

Complexity of the Mixed Postman Problem with Restrictions on the Edges

14 years 2 months ago