Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings

373 Pages·2014·8.157 MB·English

by  Kurt Mehlhorn (auth.), Sudebkumar Prasant Pal, Kunihiko Sadakane (eds.)

Sudebkumar Prasant Pal
Kunihiko Sadakane (Eds.)
4 Algorithms
4
3
8

S
and Computation
C
N
L
8th International Workshop, WALCOM 2014
Chennai, India, February 13-15, 2014
Proceedings
123
Lecture Notes in Computer Science 8344
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Sudebkumar Prasant Pal
Kunihiko Sadakane (Eds.)
Algorithms
and Computation
8th International Workshop, WALCOM 2014
Chennai, India, February 13-15, 2014
Proceedings
1 3
VolumeEditors
SudebkumarPrasantPal
IndianInstituteofTechnologyKharagpur
DepartmentofComputerScienceandEngineering
Kharagpur721302,India
E-mail:[email protected]
KunihikoSadakane
NationalInstituteofInformatics
2-1-2Hitotsubashi,Chiyoda-ku,Tokyo101-8430,Japan
E-mail:[email protected]
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-319-04656-3 e-ISBN978-3-319-04657-0
DOI10.1007/978-3-319-04657-0
SpringerChamHeidelbergNewYorkDordrechtLondon
LibraryofCongressControlNumber:2014930232
CRSubjectClassification(1998):F.2,G.2.1-2,G.4,I.1,I.3.5,E.1
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
©SpringerInternationalPublishingSwitzerland2014
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof
thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection
withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand
executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation,
inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse
maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution
undertherespectiveCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication,
neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor
omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe
materialcontainedherein.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
The 8th International Workshop on Algorithms and Computation (WALCOM
2014) was held during February 13–15, 2014 at the Indian Institute of Tech-
nology Madras, Chennai, India. This event was organized by the Department
of Computer Science and Engineering, Indian Institute of Technology Madras.
Theworkshopcoveredadiverserangeoftopicsonalgorithmsandcomputations
includingcomputationalgeometry,approximationalgorithms,graphalgorithms,
parallelanddistributedcomputing,graphdrawing,andcomputationalcomplex-
ity.
This volume contains 29 contributed papers presented during WALCOM
2014. There were 62 submissions from 16 countries. These submissions were
rigorouslyrefereedby the ProgramCommittee members with the help of exter-
nal reviewers. Abstracts of three invited talks delivered at WALCOM 2014 are
also included in this volume.
We would like to thank the authors for contributing high-quality research
papers to the workshop. We express our heartfelt thanks to the ProgramCom-
mittee members and the external referees for their active participation in re-
viewing the papers. We are grateful to Kurt Mehlhorn, Ian Munro, and Pavel
Valtrfordeliveringexcellentinvitedtalks.WethanktheOrganizingCommittee,
chairedbyN.S.Narayanaswamyforthesmoothfunctioningoftheworkshop.We
thank Springer for publishing the proceedings in the reputed Lecture Notes in
Computer Science series. We thank our sponsors for their support. Finally, we
remarkthatthe EasyChairconferencemanagementsystemwasveryeffective in
handling the reviewing process.
February 2014 Sudebkumar Prasant Pal
Kunihiko Sadakane
Organization
Steering Committee
Kyung-Yong Chwa KAIST, South Korea
Costas S. Iliopoulos King’s College London, UK
M. Kaykobad BUET, Bangladesh
Petra Mutzel TU Dortmund, Germany
Shin-ichi Nakano Gunma University, Japan
Subhas Chandra Nandy ISI Kolkata, India
Takao Nishizeki Tohoku University, Japan
Md. Saidur Rahman BUET, Bangladesh
C. Pandu Rangan IIT Madras, India
Organizing Committee
N.S. Narayanaswamy Indian Institute of Technology Madras,
Chennai, India (Chair)
Sasanka Roy Chennai Mathematical Institute, Chennai,
India
Sajin Koroth Indian Institute of Technology Madras,
Chennai, India
R. Krithika Indian Institute of Technology Madras,
Chennai, India
C.S. Rahul Indian Institute of Technology Madras,
Chennai, India
Program Committee
Hee-Kap Ahn Pohang University of Science and Technology,
Gyeongbuk, South Korea
V. Arvind Institute of Mathematical Sciences, Chennai,
India
Amitabha Bagchi Indian Institute of Technology, Delhi, India
Giuseppe Battista Third University of Rome, Italy
Arijit Bishnu Indian Statistical Institute, Kolkata, India
Franz Brandenburg University of Passau, Germany
Sumit Ganguly Indian Institute of Technology, Kanpur, India
Subir Ghosh Tata Institute of Fundamental Research,
Mumbai, India
VIII Organization
Sathish Govindarajan Indian Institute of Science, Bangalore, India
Shuji Kijima Kyushu University, Fukuoka, Japan
Ramesh Krishnamurti SimonFraserUniversity,Burnaby,BC,Canada
Giuseppe Liotta University of Perugia, Italy
Sudebkumar Pal IIT Kharagpur, India (Co-chair)
Leonidas Palios University of Ioannina, Greece
Rina Panigrahy Microsoft Research, Mountain View, CA, USA
Rosella Petreschi Sapienza University of Rome, Italy
Sheung-Hung Poon National Tsing Hua University, Hsinchu,
Taiwan
Sohel Rahman Bangladesh University of Engineering and
Technology, Dhaka, Bangladesh
Rajeev Raman University of Leicester, UK
Abhiram Ranade Indian Institute of Technology, Bombay, India
C. Pandu Rangan Indian Institute of Technology, Madras, India
Kunihiko Sadakane NationalInstituteofInformatics,Tokyo,Japan
(Co-chair)
Nicola Santoro Carleton University, Ottawa, ON, Canada
Jayalal Sarma Indian Institute of Technology, Madras, India
Saket Saurabh Institute of Mathematical Sciences, Chennai,
India
Shakhar Smorodinsky Ben-Gurion University, Be’er Sheva, Israel
Takeshi Tokuyama Tohoku University, Sendai, Japan
Peter Widmayer ETH Zurich, Switzerland
Hsu-Chen Yen National Taiwan University, Taipei, Taiwan
Additional Reviewers
Alam, Muhammad Rashed Iranmanesh, Ehsan
Angelini, Patrizio Karmakar, Arindam
Bae, Sang Won Khidamoradi, Kamyar
Bari, Md. Faizul Kindermann, Philipp
Baswana, Surender Komarath, Balagopal
Bekos, Michael Koroth, Sajin
Bohmova, Katerina Ku, Tsung-Han
Bonifaci, Vincenzo Lin, Chun-Cheng
Calamoneri, Tiziana Lin, Jin-Yong
Curticapean, Radu Lu, Chia Wei
Da Lozzo, Giordano Mehta, Shashank
Das, Gautam Kumar Misra, Neeldhara
Di Giacomo, Emilio Mondal, Debajyoti
Frati, Fabrizio Monti, Angelo
Fusco, Emanuele Morgenstern, Gila
Ghosh, Arijit Nandakumar, Satyadev
Hossain, Md. Iqbal Narayanaswamy,N.S.
Organization IX
Nekrich, Yakov Roselli, Vincenzo
Nicosia, Gaia Savicky, Petr
Nishat, Rahnuma Islam Sinaimeri, Blerina
N¨ollenburg, Martin Tanigawa, Shin-Ichi
Ono, Hirotaka Tewari, Raghunath
Paul, Subhabrata Tschager, Thomas
Peng, Yuejian Vatshelle, Martin
Pro¨ger, Tobias Zhang, Guochuan
Rafiey, Arash Zohora, Fatema Tuz
Rao B.V., Raghavendra
Table of Contents
Invited Papers
Algorithms for Equilibrium Prices in Linear Market Models ........... 1
Kurt Mehlhorn
In as Few Comparisons as Possible ................................. 5
J. Ian Munro
The Happy End Theorem and Related Results....................... 7
Pavel Valtr
Computational Geometry
Generalized Class Cover Problem with Axis-Parallel Strips ............ 8
Apurva Mudgal and Supantha Pandit
Top-k Manhattan Spatial Skyline Queries ........................... 22
Wanbin Son, Fabian Stehn, Christian Knauer, and Hee-Kap Ahn
On Generalized Planar Skyline and Convex Hull Range Queries........ 34
Nadeem Moidu, Jatin Agarwal, Sankalp Khare,
Kishore Kothapalli, and Kannan Srinathan
Boundary Labeling with Flexible Label Positions .................... 44
Zhi-Dong Huang, Sheung-Hung Poon, and Chun-Cheng Lin
Algorithms and Approximations
Approximating the Bipartite TSP and Its Biased Generalization ....... 56
Aleksandar Shurbevski, Hiroshi Nagamochi, and Yoshiyuki Karuno
A (k+1)-Approximation Robust Network Flow Algorithm and
a Tighter Heuristic Method Using Iterative Multiroute Flow........... 68
Jean-Fran¸cois Baffier and Vorapong Suppakitpaisarn
Simple Linear Comparison of Strings in V-Order
(Extended Abstract) ............................................. 80
Ali Alatabbi, Jackie Daykin, M. Sohel Rahman, and
William F. Smyth
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest
Neighbor Search ................................................. 90
Nils Kriege, Petra Mutzel, and Till Sch¨afer
XII Table of Contents
Distributed Computing and Networks
Optimal Serial Broadcast of Successive Chunks ...................... 102
Satoshi Fujita
The G-Packing with t-OverlapProblem............................. 114
Jazm´ın Romero and Alejandro L´opez-Ortiz
Minimax Regret Sink Location Problem in Dynamic Tree Networks
with Uniform Capacity ........................................... 125
Yuya Higashikawa, Mordecai J. Golin, and Naoki Katoh
On a Class of Covering Problems with Variable Capacities in Wireless
Networks ....................................................... 138
Selim Akl, Robert Benkoczi, Daya Ram Gaur, Hossam Hassanein,
Shahadat Hossain, and Mark Thom
Graph Algorithms
Algorithm and Hardness Results for Outer-connected Dominating Set
in Graphs....................................................... 151
B.S. Panda and Arti Pandey
Some Results on Point Visibility Graphs ............................ 163
Subir Kumar Ghosh and Bodhayan Roy
Some Extensions of the Bottleneck Paths Problem ................... 176
Tong-Wook Shinn and Tadao Takaoka
I/O EfficientAlgorithms for the Minimum Cut ProblemonUnweighted
Undirected Graphs............................................... 188
Alka Bhushan and G. Sajith
Complexity and Bounds
On Some NP-complete SEFE Problems ............................ 200
Patrizio Angelini, Giordano Da Lozzo, and Daniel Neuwirth
On Dilworth k Graphs and Their Pairwise Compatibility.............. 213
Tiziana Calamoneri and Rossella Petreschi
Efficient Algorithms for Sorting k-Sets in Bins ....................... 225
Atsuki Nagao, Kazuhisa Seto, and Junichi Teruyama
Results on Independent Sets in Categorical Products of Graphs,
the Ultimate Categorical Independence Ratio and the Ultimate
Categorical Independent Domination Ratio.......................... 237
Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu,
Sheung-Hung Poon, and Yue-Li Wang