Sciweavers

100 search results - page 12 / 20
» Combination of Lower Bounds in Exact BDD Minimization
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 10 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
FOCS
2007
IEEE
14 years 5 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CCE
2006
13 years 10 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 10 months ago
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
Norman Biggs