IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02089412.html
   My bibliography  Save this paper

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems

Author

Listed:
  • Vittorio Bilò

    (University of Salento [Lecce])

  • Ioannis Caragiannis

    (Department of Computer Engineering and Informatics [Patras] - University of Patras)

  • Angelo Fanelli

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique)

  • Michele Flammini

    (DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila)

  • Gianpiero Monaco

    (DI - Dipartimento di Informatica [Italy] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila)

Abstract

We revisit fundamental problems in undirected and directed graphs, such as the problems of computing spanning trees, shortest paths, steiner trees, and spanning arborescences of minimum cost. We assume that there are d different cost functions associated with the edges of the input graph and seek for solutions to the resulting multidimensional graph problems so that the p - norm of the different costs of the solution is minimized. We present combinatorial algorithms that achieve very good approximations for this objective. The main advantage of our algorithms is their simplicity: they are as simple as classical combinatorial graph algorithms of Dijkstra and Kruskal, or the greedy algorithm for matroids.

Suggested Citation

  • Vittorio Bilò & Ioannis Caragiannis & Angelo Fanelli & Michele Flammini & Gianpiero Monaco, 2017. "Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems," Post-Print hal-02089412, HAL.
    • Handle: RePEc:hal:journl:hal-02089412
    DOI: 10.4230/LIPIcs.ICALP.2017.125
    Note: View the original document on HAL open archive server: https://hal.science/hal-02089412
    as

    Download full text from publisher

    File URL: https://hal.science/hal-02089412/document
    Download Restriction: no
    File URL: https://libkey.io/10.4230/LIPIcs.ICALP.2017.125?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chassein, André & Goerigk, Marc & Kasperski, Adam & Zieliński, Paweł, 2020. "Approximating combinatorial optimization problems with the ordered weighted averaging criterion," European Journal of Operational Research, Elsevier, vol. 286(3), pages 828-838.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
    2. Shisheng Li & T.C.E. Cheng & C.T. Ng & Jinjiang Yuan, 2017. "Two‐agent scheduling on a single sequential and compatible batching machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(8), pages 628-641, December.
    3. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
    4. Li Guan & Jianping Li & Weidong Li & Junran Lichen, 2019. "Improved approximation algorithms for the combination problem of parallel machine scheduling and path," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 689-697, October.
    5. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    6. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    7. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
    8. M. Reza Khani & Mohammad R. Salavatipour, 2016. "Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 669-685, February.
    9. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    10. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    11. Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    12. Amir Elalouf, 2014. "Fast approximation algorithms for routing problems with hop-wise constraints," Annals of Operations Research, Springer, vol. 222(1), pages 279-291, November.
    13. Nir Halman & Mikhail Y. Kovalyov & Alain Quilliot & Dvir Shabtay & Moshe Zofi, 2019. "Bi-criteria path problem with minimum length and maximum survival probability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 469-489, June.
    14. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    15. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
    16. Elalouf, Amir & Levner, Eugene & Cheng, T.C.E., 2013. "Routing and dispatching of multiple mobile agents in integratedenterprises," International Journal of Production Economics, Elsevier, vol. 145(1), pages 96-106.
    17. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
    18. April K. Andreas & J. Cole Smith, 2008. "Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 553-564, November.
    19. Karsten, Christian Vad & Pisinger, David & Ropke, Stefan & Brouer, Berit Dangaard, 2015. "The time constrained multi-commodity network flow problem and its application to liner shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 122-138.
    20. Shaghayegh Mokarami & S. Hashemi, 2015. "Constrained shortest path with uncertain transit times," Journal of Global Optimization, Springer, vol. 63(1), pages 149-163, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-02089412. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.