Sciweavers

3415 search results - page 92 / 683
» Lower Bounds for Kernelizations
Sort
View
ECCC
2010
80views more  ECCC 2010»
15 years 4 months ago
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
ENDM
2010
65views more  ENDM 2010»
15 years 4 months ago
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
Maria Ayala, Christian Artigues, Bernat Gacias
ENDM
2010
101views more  ENDM 2010»
15 years 4 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
DM
2008
91views more  DM 2008»
15 years 4 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
Jiaojiao Wu, Xuding Zhu