1723 search results - page 3 / 345 » Cycling in linear programming problems |
VLSID
1999
IEEE
14 years 21 days ago
1999
IEEE
This paper provides a theoretical basis for eliminating or reducing the energy consumption due to transients in a synchronous digital circuit. The transient energy is minimized wh...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
CPM
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...