Sciweavers

366 search results - page 73 / 74
» Four equivalent equivalences of reductions
Sort
View
OSN
2007
185views more  OSN 2007»
13 years 5 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 3 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
HICSS
2011
IEEE
157views Biometrics» more  HICSS 2011»
12 years 9 months ago
Reusing Relational Queries for Intuitive Decision Optimization
— Decision optimization is used in many applications such as those for finding the best course of action in emergencies. However, optimization solutions require considerable mat...
Alexander Brodsky, Nathan E. Egge, Xiaoyang Sean W...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 8 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 8 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...