{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:05:10Z","timestamp":1742997910264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_27","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"328-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraph Representation via\u00a0Axis-Aligned Point-Subspace Cover"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-7640","authenticated-orcid":false,"given":"Oksana","family":"Firman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6452","authenticated-orcid":false,"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01844843","volume":"16","author":"R Aharoni","year":"1996","unstructured":"Aharoni, R., Holzman, R., Krivelevich, M.: On a theorem of lov\u00e1sz on covers in tau-partite hypergraphs. Combinatorica 16(2), 149\u2013174 (1996). https:\/\/doi.org\/10.1007\/BF01844843","journal-title":"Combinatorica"},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995). https:\/\/doi.org\/10.1007\/BF02570718","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"publisher","unstructured":"Chan, T.M., Grant, E., K\u00f6nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: Rabani, Y. (ed.) Proceedings of Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201912), pp. 1576\u20131585. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.125","key":"27_CR3","DOI":"10.1137\/1.9781611973099.125"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). https:\/\/doi.org\/10.1287\/moor.4.3.233","journal-title":"Math. Oper. Res."},{"issue":"5","key":"27_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0002-9904-1950-09407-5","volume":"56","author":"HSM Coxeter","year":"1950","unstructured":"Coxeter, H.S.M.: Self-dual configurations and regular graphs. Bull. Amer. Math. Soc. 56(5), 413\u2013455 (1950)","journal-title":"Bull. Amer. Math. Soc."},{"doi-asserted-by":"publisher","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: Proceedings of 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201913), pp. 509\u2013518. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.61","key":"27_CR7","DOI":"10.1109\/FOCS.2013.61"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-35802-0_2","volume-title":"Graph Drawing and Network Visualization","author":"W Evans","year":"2019","unstructured":"Evans, W., Rzazewski, P., Saeedi, N., Shin, C.-S., Wolff, A.: Representing graphs and hypergraphs by touching polygons in 3D. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 18\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_2"},{"doi-asserted-by":"crossref","unstructured":"Firman, O., Spoerhase, J.: Hypergraph representation via axis-aligned point-subspace cover. Arxiv report. arXiv:2111.13555 (2021)","key":"27_CR9","DOI":"10.1007\/978-3-030-96731-4_27"},{"unstructured":"Gaur, D.R., Bhattacharya, B.: Covering points by axis parallel lines. In: Proceedings 23rd European Workshop on Computational Geometry (EuroCG\u201907), pp. 42\u201345. Citeseer (2007)","key":"27_CR10"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14165-2_31","volume-title":"Automata, Languages and Programming","author":"V Guruswami","year":"2010","unstructured":"Guruswami, V., Saket, R.: On the inapproximability of vertex cover on k-partite k-uniform hypergraphs. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 360\u2013371. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_31"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discret. Appl. Math. 30(1), 29\u201342 (1991). https:\/\/doi.org\/10.1016\/0166-218X(91)90011-K","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20\u201339 (2006). https:\/\/doi.org\/10.1007\/s00037-006-0205-6","journal-title":"Comput. Complex."},{"doi-asserted-by":"publisher","unstructured":"Ilie, L., Solis-Oba, R., Yu, S.: Reducing the size of NFAs by using equivalences and preorders. In: Apostolico, A., Crochemore, M., Park, K. (eds.) Combinatorial Pattern Matching, pp. 310\u2013321. SV (2005). https:\/\/doi.org\/10.1007\/11496656_27","key":"27_CR14","DOI":"10.1007\/11496656_27"},{"doi-asserted-by":"publisher","unstructured":"Kratsch, S., Philip, G., Ray, S.: Point line cover: the easy kernel is essentially tight. In: Chekuri, C. (ed.) Proceedings of 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201914), pp. 1596\u20131606. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.116","key":"27_CR15","DOI":"10.1137\/1.9781611973402.116"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/3-540-45022-X_53","volume-title":"Automata, Languages and Programming","author":"VSA Kumar","year":"2000","unstructured":"Kumar, V.S.A., Arya, S., Ramesh, H.: Hardness of set cover with intersection 1. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 624\u2013635. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_53"},{"key":"27_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in Intersection Graph Theory","author":"TA McKee","year":"1999","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1999)"},{"unstructured":"Pisanski, T., Randi\u0107, M.: Bridges between geometry and graph theory. In: Gorini, C.A. (ed.) Geometry at Work, MAA Notes 53, pp. 174\u2013194. America (2000)","key":"27_CR18"},{"doi-asserted-by":"publisher","unstructured":"Varadarajan, K.R.: Weighted geometric set cover via quasi-uniform sampling. In: Schulman, L.J. (ed.) Proceedings of 42nd ACM Symposium on Theory of Computing (STOC\u201910), pp. 641\u2013648. ACM (2010). https:\/\/doi.org\/10.1145\/1806689.1806777","key":"27_CR19","DOI":"10.1145\/1806689.1806777"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T06:56:16Z","timestamp":1674975376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}