Sciweavers

JAIR
2010
100views more  JAIR 2010»
13 years 3 months ago
Mechanisms for Multi-Unit Auctions
We present an incentive-compatible polynomial-time approximation scheme for multiunit auctions with general k-minded player valuations. The mechanism fully optimizes over an appro...
Shahar Dobzinski, Noam Nisan
MST
2006
149views more  MST 2006»
13 years 5 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
COR
2007
121views more  COR 2007»
13 years 5 months ago
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The obje...
Xiuli Wang, T. C. Edwin Cheng
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 5 months ago
Pants Decomposition of the Punctured Plane
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
Sheung-Hung Poon, Shripad Thite
FOCS
1995
IEEE
13 years 8 months ago
An Approximation Scheme for Planar Graph TSP
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
Michelangelo Grigni, Elias Koutsoupias, Christos H...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
FCT
2003
Springer
13 years 10 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
13 years 10 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
COCOON
2005
Springer
13 years 10 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
RTAS
2007
IEEE
13 years 11 months ago
Real-Time Task Replication for Fault Tolerance in Identical Multiprocessor Systems
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
Jian-Jia Chen, Chuan-Yue Yang, Tei-Wei Kuo, Shau-Y...