6740 search results - page 364 / 1348 » An s -Hamiltonian Line Graph Problem |
140
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
122
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
115
Voted
AICT
2006
IEEE
15 years 10 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
130
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
132
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...