Sciweavers

1671 search results - page 111 / 335
» On the Covering Steiner Problem
Sort
View
108
Voted
JSYML
2010
95views more  JSYML 2010»
14 years 7 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
95
Voted
WEBDB
2004
Springer
80views Database» more  WEBDB 2004»
15 years 6 months ago
Unraveling the Duplicate-Elimination Problem in XML-to-SQL Query Translation
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...
Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F...
JCO
2007
80views more  JCO 2007»
15 years 22 days ago
The wireless network jamming problem
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...
TCAD
2002
110views more  TCAD 2002»
15 years 14 days ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
81
Voted
JUCS
2006
94views more  JUCS 2006»
15 years 23 days ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe