Sciweavers

4 search results - page 1 / 1
» Split Hypergraphs
Sort
View
SIAMDM
2008
114views more  SIAMDM 2008»
13 years 4 months ago
Split Hypergraphs
Ádám Timár
CORR
2011
Springer
268views Education» more  CORR 2011»
12 years 8 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
FOCS
2007
IEEE
13 years 11 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
ECCC
2007
90views more  ECCC 2007»
13 years 4 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider