7129 search results - page 272 / 1426 » Approximation Algorithms for Treewidth |
185
click to vote
IFIPTCS
2010
15 years 2 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
141
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
169
click to vote
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
252
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
152
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...