Sciweavers

2137 search results - page 47 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
COMBINATORICA
2006
137views more  COMBINATORICA 2006»
13 years 8 months ago
Extremal Problems For Transversals In Graphs With Bounded Degree
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
Tibor Szabó, Gábor Tardos
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
13 years 10 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
CIKM
2010
Springer
13 years 7 months ago
Hypergraph-based multilevel matrix approximation for text information retrieval
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
Haw-ren Fang, Yousef Saad
IPL
2011
112views more  IPL 2011»
13 years 3 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
13 years 9 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...