Sciweavers

1963 search results - page 35 / 393
» The Maximum Solution Problem on Graphs
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 8 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
MST
2006
99views more  MST 2006»
13 years 8 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
CVPR
2011
IEEE
13 years 4 months ago
Multiobject Tracking as Maximum Weight Independent Set
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
William Brendel, Mohamed Amer, Sinisa Todorovic
RECOMB
2010
Springer
14 years 3 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 2 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf