The \Constraint Bipartite Vertex Cover " problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k 1; k 2, is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It formalizes the spare allocation problem for recongurable arrays, an important problem from VLSI manufacturing. We provide the rst nontrivial so-called \ xed parameter " algorithm for CBVC, running in time O(1:3999 k1+k2 +(k 1 +k 2)n). Our algorithm is ecient and practical for small values of k 1 and k 2, as occurring in applications. Chapter 1
|
2771
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
469
|
Parameterized Complexity
– Downey, Fellows
- 1999
|
|
370
|
Learning regular sets from queries and counterexamples
– Angluin
- 1987
|
|
356
|
Formal Languages
– Salomaa
- 1973
|
|
319
|
Graph Theory
– Diestel
- 1997
|
|
121
|
Inference of reversible languages
– Angluin
- 1982
|
|
121
|
Evidence against the Context–Freeness of Natural Languages
– Shieber
- 1985
|
|
92
|
Regulated Rewriting in Formal Language Theory
– Paun
- 1989
|
|
89
|
When won't membership queries help
– Angluin, Kharitonov
- 1995
|
|
77
|
Negative results for equivalence queries
– Angluin
- 1990
|
|
75
|
An improved exponential-time algorithm for k-SAT
– Paturi, Pudl'ak, et al.
- 1998
|
|
73
|
Algorithms for maximum independent sets
– Robson
|
|
62
|
Parameterized computational feasibility
– Downey, Fellows
- 1993
|
|
62
|
Parameterized Complexity: A Framework for Systematically Confronting
– Downey, Fellows, et al.
- 1999
|
|
59
|
Language identi in the limit
– Gold
- 1967
|
|
55
|
Upper bounds for vertex cover further improved
– Niedermeier, Rossmanith
- 1999
|
|
51
|
Finding a maximum independent set
– Tarjan, Trojanowski
|
|
50
|
Clique Partitions, Graph Compression and Speeding-up Algorithms. Special Issue for the STOC conference
– Feder, Motwani
- 1995
|
|
44
|
Parameterizing above guaranteed values: MaxSat and MaxCut
– Mahajan, Raman
- 1999
|
|
41
|
Petri net algorithms in the theory of matrix grammars
– Hauschildt, Jantzen
- 1994
|
|
38
|
3-coloring in time O(1:3446 n ): a no-MIS algorithm
– Beigel, Eppstein
- 1995
|
|
34
|
Remarks on blind and partially blind one-way multicounter machines
– Greibach
- 1978
|
|
32
|
Graph Algorithms and NP-Completeness
– Mehlhorn
- 1984
|
|
30
|
Computing a maximum cardinality matching in a bipartite graph
– Alt, Blum, et al.
- 1991
|
|
29
|
On the Entropy of Context-Free Languages
– Kuich
- 1970
|
|
24
|
Programmed Grammars and Classes of Formal Languages
– Rosenkrantz
- 1969
|
|
22
|
Grammatical inference for even linear languages based on control sets
– Takada
- 1988
|
|
20
|
Two new upper bounds for SAT
– Hirsch
- 1998
|
|
19
|
Accepting grammars with regulation
– Bordihn, Fernau
- 1994
|
|
18
|
A universal Turing machine with two internal states
– Shannon
- 1956
|
|
18
|
Exact learning of formulas in parallel
– Bshouty
|
|
17
|
Learning one-counter languages in polynomial time
– BERMAN, ROOS
- 1987
|
|
16
|
New upper bounds for MaxSat
– Niedermeier, Rossmanith
- 1998
|
|
15
|
Learning Deterministic Even Linear Languages from Positive Examples
– Koshiba, Mkinen
- 1995
|
|
14
|
Learning regular languages from counterexamples
– Ibarra, Jiang
- 1988
|
|
13
|
A hierarchy of language families learnable by regular language learners
– Takada
- 1994
|
|
12
|
Inference of even linear grammars and its application to picture description languages
– Radhakrishnan, Nagaraja
- 1988
|
|
11
|
Transductions and Context-Free Languages, volume 38
– Berstel
- 1979
|
|
11
|
A Fault-Driven Comprehensive Redundancy Algorithm
– Day
- 1985
|
|
10
|
Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition
– Garca, Vidal
- 1990
|
|
9
|
Asking queries to minimize errors
– Bshouty, Goldman, et al.
- 1993
|
|
9
|
Finite-turn pushdown automata
– Ginsburg, Spanier
- 1966
|
|
9
|
A machine realization of the linear context-free languages
– Rosenberg
- 1967
|
|
9
|
Testing repairable RAMs and mostly good memories
– Evans
- 1981
|
|
9
|
Designing UltraSparc for testability
– Levitt
- 1997
|
|
8
|
Control sets on grammars
– Ginsburg, Spanier
- 1968
|
|
8
|
Simple matrix languages
– Ibarra
- 1970
|
|
8
|
A geometric hierarchy beyond context-free languages
– Weir
- 1992
|
|
8
|
An improved parameter algorithm for vertex cover
– Balasubramanian, Fellows, et al.
- 1998
|
|
8
|
Complexity of fault diagnosis in comparison models
– Blough, Pelc
- 1992
|
|
