7129 search results - page 849 / 1426 » Approximation Algorithms for Treewidth |
178
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
182
click to vote
ICASSP
2009
IEEE
16 years 29 days ago
2009
IEEE
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
169
click to vote
AAIM
2009
Springer
16 years 25 days ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
146
click to vote
APPROX
2009
Springer
16 years 24 days ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
144
click to vote
COMPGEOM
2009
ACM
16 years 22 days ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...