Titlebook: Automata, Languages and Programming; 37th International C Samson Abramsky,Cyril Gavoille,Paul G. Spirakis Conference proceedings 2010 Sprin

宽大

https://doi.org/10.1007/978-3-322-83356-3pressible in the monadic second order logic can be computed in linear time for matroids given by a decomposition with bounded width. We also relate the decomposition width to matroid branch-width and discuss implications of our results with respect to other known algorithms.

绕着哥哥问

小争吵

全部

https://doi.org/10.1007/978-3-322-92539-8 2003] and Harvey, Ladner, Lovász and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the . problem in . time, improving the previous .(.)-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].

EXULT

Oversee

Faster Algorithms for Semi-matching Problems (Extended Abstract) 2003] and Harvey, Ladner, Lovász and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the . problem in . time, improving the previous .(.)-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].

NOTCH

Local Search: Simple, Successful, But Sometimes Sluggishestigation, we revisit the framework of . and mostly concentrate on the research on ., which sparked the interconnection between local search and game theory. We conclude by stating various open problems.

daredevil

aviator

Functional

On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctionshful greedy algorithms for CA problems? The notion of greediness is associated with a broad class of algorithms, known as priority algorithms, which encapsulates many natural auction methods. We show that no truthful greedy priority algorithm can obtain an approximation to the CA problem that is sublinear in ., even for .-CAs with . ≥ 2.