Sciweavers

1272 search results - page 75 / 255
» The Set Cover with Pairs Problem
Sort
View
FSTTCS
2004
Springer
15 years 6 months ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
93
Voted
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 20 days ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
AUTOMATICA
2007
62views more  AUTOMATICA 2007»
15 years 28 days ago
Further results on structural assignment of linear systems via sensor selection
The problem of assigning structural properties of a linear system through sensor selection is, for a given pair (A, B), to find an output pair (C, D) such that the resulting syst...
Xinmin Liu, Zongli Lin, Ben M. Chen
CSCLP
2007
Springer
15 years 7 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
136
Voted
4OR
2008
115views more  4OR 2008»
14 years 11 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...