Sciweavers

JCO
2016
43views more  JCO 2016»
8 years 22 days ago
Improved approximation algorithms for single-tiered relay placement
Gruia Calinescu, Benjamin Grimmer, Satyajayant Mis...
JCO
2016
50views more  JCO 2016»
8 years 22 days ago
Information exchange with collision detection on multiple channels
Abstract. Information exchange is a fundamental communication primitive in radio networks. We study this problem in multi-channel singlehop networks. In particular, given k pieces ...
Yuepeng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu,...
JCO
2016
46views more  JCO 2016»
8 years 22 days ago
Minimum-latency aggregation scheduling in wireless sensor network
Abstract—Data aggregation is an essential yet timeconsuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS)...
Longjiang Guo, Yingshu Li, Zhipeng Cai
JCO
2016
49views more  JCO 2016»
8 years 22 days ago
A simplex like approach based on star sets for recognizing convex-QP adverse graphs
A graph G with convex-QP stability number (or simply a convex-QP graph) is a graph for which the stability number is equal to the optimal value of a convex quadratic program, say ...
Domingos M. Cardoso, Carlos J. Luz
JCO
2016
50views more  JCO 2016»
8 years 22 days ago
Problem dependent optimization (PDO)
Iliya Bluskov
JCO
2016
102views more  JCO 2016»
8 years 22 days ago
Degree-constrained orientations of embedded graphs
Yann Disser, Jannik Matuschke
JCO
2016
45views more  JCO 2016»
8 years 22 days ago
On the computational complexity of bridgecard
Bridgecardisaclassicaltrick-takinggameutilizingastandard52-carddeck, in which four players in two competing partnerships attempt to “win” each round, i.e. trick. Existing theor...
Zihan Tan
JCO
2016
37views more  JCO 2016»
8 years 22 days ago
On revenue maximization with sharp multi-unit demands
We consider markets consisting of a set of indivisible items, and buyers that have sharp multi-unit demand. This means that each buyer i wants a specific number di of items; a bu...
Ning Chen, Xiaotie Deng, Paul W. Goldberg, Jinshan...
JCO
2016
50views more  JCO 2016»
8 years 22 days ago
Crossing edges and faces of line arrangements in the plane
For any natural number n we define f(n) to be the minimum number with the following property. Given any arrangement A(L) of n blue lines in the real projective plane one can fin...
Rom Pinchasi
JCO
2016
41views more  JCO 2016»
8 years 22 days ago
Linearizable special cases of the QAP
We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable ...
Eranda Çela, Vladimir G. Deineko, Gerhard J...