


default search action
Theoretical Computer Science, Volume 555
Volume 555, October 2014
Editorial
- Subir Kumar Ghosh, Takeshi Tokuyama

:
Guest Editors' foreword. 1
- Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:

Approximation algorithms for the partition vertex cover problem. 2-8 - Binay Bhattacharya, Soudipta Chakraborty

, Ehsan Iranmanesh, Ramesh Krishnamurti:
The cyclical scheduling problem. 9-22 - Mourad El Ouali

, Helena Fohlin, Anand Srivastav:
A randomised approximation algorithm for the hitting set problem. 23-34 - Kei Uchizawa

, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized rainbow connectivity of graphs. 35-42 - Sándor P. Fekete

, Jan-Marc Reinhardt, Nils Schweer:
A competitive strategy for distance-aware online shape allocation. 43-54 - Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:

Fixed-orientation equilateral triangle matching of point sets. 55-70 - Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong

, Hirotaka Ono
, Yota Otachi
, Takeshi Tokuyama
, Ryuhei Uehara
, Takeaki Uno:
Base-object location problems for base-monotone regions. 71-84

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














